Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399800598.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 189K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717226124984

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:15:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:15:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:15:26] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-01 07:15:26] [INFO ] Transformed 772 places.
[2024-06-01 07:15:26] [INFO ] Transformed 685 transitions.
[2024-06-01 07:15:26] [INFO ] Found NUPN structural information;
[2024-06-01 07:15:26] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (219 resets) in 1558 ms. (25 steps per ms) remains 8/12 properties
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (39 resets) in 371 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (37 resets) in 174 ms. (228 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (46 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (38 resets) in 145 ms. (273 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (37 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (45 resets) in 827 ms. (48 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (43 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (37 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
// Phase 1: matrix 670 rows 757 cols
[2024-06-01 07:15:27] [INFO ] Computed 125 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 476/549 variables, 60/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/549 variables, 476/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 69/618 variables, 18/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/618 variables, 69/696 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 138/756 variables, 46/742 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/756 variables, 138/880 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/756 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/757 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/757 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/757 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 670/1427 variables, 757/1639 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1427 variables, 0/1639 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/1427 variables, 0/1639 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1427/1427 variables, and 1639 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1938 ms.
Refiners :[Domain max(s): 757/757 constraints, Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 757/757 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/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 476/549 variables, 60/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/549 variables, 476/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 16 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 3 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 181 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 186 places in 137 ms of which 9 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 180 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 20/629 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 174 places in 117 ms of which 4 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 6 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 179 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 182 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 179 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 175 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 169 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 175 places in 118 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 20/649 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 180 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 179 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 177 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 171 places in 106 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1427 variables, and 655 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5011 ms.
Refiners :[Domain max(s): 549/757 constraints, Positive P Invariants (semi-flows): 60/78 constraints, Generalized P Invariants (flows): 0/47 constraints, State Equation: 0/757 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 46/46 constraints]
After SMT, in 7067ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 356 edges and 757 vertex of which 4 / 757 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1516 edges and 754 vertex of which 747 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 747 transition count 544
Reduce places removed 121 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 139 rules applied. Total rules applied 262 place count 626 transition count 526
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 280 place count 608 transition count 526
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 280 place count 608 transition count 422
Deduced a syphon composed of 104 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 225 rules applied. Total rules applied 505 place count 487 transition count 422
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 576 place count 416 transition count 351
Iterating global reduction 3 with 71 rules applied. Total rules applied 647 place count 416 transition count 351
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 647 place count 416 transition count 346
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 658 place count 410 transition count 346
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 870 place count 304 transition count 240
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 872 place count 303 transition count 243
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 873 place count 303 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 874 place count 302 transition count 242
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 877 place count 302 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 878 place count 301 transition count 241
Applied a total of 878 rules in 170 ms. Remains 301 /757 variables (removed 456) and now considering 241/670 (removed 429) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 301/757 places, 241/670 transitions.
RANDOM walk for 40000 steps (1159 resets) in 661 ms. (60 steps per ms) remains 5/8 properties
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (204 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (199 resets) in 136 ms. (292 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (198 resets) in 129 ms. (307 steps per ms) remains 3/5 properties
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (216 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
// Phase 1: matrix 241 rows 301 cols
[2024-06-01 07:15:35] [INFO ] Computed 101 invariants in 9 ms
[2024-06-01 07:15:35] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 178/222 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/236 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/276 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 237/513 variables, 276/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 28/541 variables, 24/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 8/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/542 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/542 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 404 constraints, problems are : Problem set: 0 solved, 3 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 178/222 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 14/236 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BusinessProcesses-PT-19-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 40/276 variables, 26/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 20/124 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 16/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 8/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 237/513 variables, 276/424 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/513 variables, 2/426 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/513 variables, 20/446 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/513 variables, 20/466 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/513 variables, 20/486 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 4 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 2 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/513 variables, 18/504 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/513 variables, 10/514 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/513 variables, 0/514 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 28/541 variables, 24/538 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/541 variables, 8/546 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/541 variables, 2/548 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/541 variables, 3/551 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/541 variables, 3/554 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/541 variables, 0/554 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/542 variables, 1/555 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/542 variables, 1/556 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/542 variables, 0/556 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
At refinement iteration 31 (OVERLAPS) 0/542 variables, 1/557 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/542 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/542 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 557 constraints, problems are : Problem set: 1 solved, 2 unsolved in 32572 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 151/151 constraints]
After SMT, in 32973ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 267 ms.
Support contains 41 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 241/241 transitions.
Graph (complete) has 915 edges and 301 vertex of which 299 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 299 transition count 231
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 289 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 288 transition count 230
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 23 place count 288 transition count 221
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 45 place count 275 transition count 221
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 52 place count 268 transition count 214
Iterating global reduction 3 with 7 rules applied. Total rules applied 59 place count 268 transition count 214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 59 place count 268 transition count 213
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 267 transition count 213
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 82 place count 256 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 255 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 255 transition count 202
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 253 transition count 200
Applied a total of 86 rules in 70 ms. Remains 253 /301 variables (removed 48) and now considering 200/241 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 253/301 places, 200/241 transitions.
RANDOM walk for 40000 steps (1921 resets) in 570 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (377 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (410 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1126621 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :1 out of 2
Probabilistic random walk after 1126621 steps, saw 188559 distinct states, run finished after 3005 ms. (steps per millisecond=374 ) properties seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 200 rows 253 cols
[2024-06-01 07:16:11] [INFO ] Computed 94 invariants in 3 ms
[2024-06-01 07:16:11] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/123 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/138 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/188 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/227 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 198/425 variables, 227/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 25/450 variables, 24/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 9/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/452 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/452 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/453 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/453 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/453 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 350 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 253/253 constraints, ReadFeed: 3/3 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/123 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/138 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/188 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/227 variables, 23/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 198/425 variables, 227/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 25/450 variables, 24/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 9/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/452 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/452 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/453 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/453 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/453 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2266 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 constraints]
After SMT, in 2476ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 18 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 200/200 transitions.
Graph (trivial) has 27 edges and 253 vertex of which 2 / 253 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 252 transition count 192
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 246 transition count 192
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 13 place count 246 transition count 187
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 27 place count 237 transition count 187
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 234 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 234 transition count 184
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 62 place count 218 transition count 171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 217 transition count 182
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 217 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 216 transition count 181
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 216 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 215 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 215 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 214 transition count 179
Applied a total of 70 rules in 63 ms. Remains 214 /253 variables (removed 39) and now considering 179/200 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 214/253 places, 179/200 transitions.
RANDOM walk for 40000 steps (1345 resets) in 313 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (678 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1138481 steps, run timeout after 3001 ms. (steps per millisecond=379 ) properties seen :0 out of 1
Probabilistic random walk after 1138481 steps, saw 265678 distinct states, run finished after 3001 ms. (steps per millisecond=379 ) properties seen :0
// Phase 1: matrix 179 rows 214 cols
[2024-06-01 07:16:17] [INFO ] Computed 87 invariants in 4 ms
[2024-06-01 07:16:17] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/120 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/151 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/158 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/333 variables, 158/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 59/392 variables, 55/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 26/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/393 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/393 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/393 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 214/214 constraints, ReadFeed: 4/4 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/120 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/151 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/158 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 175/333 variables, 158/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 59/392 variables, 55/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 26/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/392 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/392 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/392 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/392 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/393 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/393 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/393 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/393 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 214/214 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1027ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 18 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 179/179 transitions.
Applied a total of 0 rules in 9 ms. Remains 214 /214 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 214/214 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 214 /214 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-06-01 07:16:18] [INFO ] Invariant cache hit.
[2024-06-01 07:16:18] [INFO ] Implicit Places using invariants in 138 ms returned [13, 14, 36, 38, 40, 51, 53, 55, 56, 57, 58, 59, 60, 61, 64, 65, 66, 67, 183]
[2024-06-01 07:16:18] [INFO ] Actually due to overlaps returned [36, 51, 57, 58, 13, 55, 56, 59, 60, 61, 64, 65, 66, 67, 183]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 145 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 199/214 places, 179/179 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 196 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 196 transition count 167
Applied a total of 6 rules in 13 ms. Remains 196 /199 variables (removed 3) and now considering 167/179 (removed 12) transitions.
// Phase 1: matrix 167 rows 196 cols
[2024-06-01 07:16:18] [INFO ] Computed 72 invariants in 1 ms
[2024-06-01 07:16:19] [INFO ] Implicit Places using invariants in 110 ms returned [35, 37]
[2024-06-01 07:16:19] [INFO ] Actually due to overlaps returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 195/214 places, 167/179 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 193 transition count 156
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 193 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 192 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 192 transition count 152
Applied a total of 6 rules in 11 ms. Remains 192 /195 variables (removed 3) and now considering 152/167 (removed 15) transitions.
// Phase 1: matrix 152 rows 192 cols
[2024-06-01 07:16:19] [INFO ] Computed 71 invariants in 1 ms
[2024-06-01 07:16:19] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 07:16:19] [INFO ] Invariant cache hit.
[2024-06-01 07:16:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:16:19] [INFO ] Implicit Places using invariants and state equation in 241 ms returned [50, 52, 54, 56, 59, 61, 62, 64, 66, 68, 71, 72, 74, 75, 90, 92, 96, 102, 104, 110, 112, 114, 116, 118, 120, 126, 128]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 338 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 165/214 places, 152/179 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 165 transition count 142
Reduce places removed 10 places and 0 transitions.
Graph (complete) has 470 edges and 155 vertex of which 153 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 153 transition count 142
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 153 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 149 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 149 transition count 136
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 149 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 34 place count 147 transition count 134
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 35 place count 146 transition count 133
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 146 transition count 133
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 51 place count 138 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 53 place count 137 transition count 125
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 57 place count 137 transition count 121
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 61 place count 133 transition count 121
Applied a total of 61 rules in 38 ms. Remains 133 /165 variables (removed 32) and now considering 121/152 (removed 31) transitions.
// Phase 1: matrix 121 rows 133 cols
[2024-06-01 07:16:19] [INFO ] Computed 43 invariants in 1 ms
[2024-06-01 07:16:19] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 07:16:19] [INFO ] Invariant cache hit.
[2024-06-01 07:16:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 07:16:19] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [4, 5, 6, 7, 8, 10, 12, 20, 23, 27, 28, 43]
Discarding 12 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 213 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 121/214 places, 120/179 transitions.
Graph (complete) has 354 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 114 transition count 103
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 114 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 114 transition count 102
Applied a total of 12 rules in 7 ms. Remains 114 /121 variables (removed 7) and now considering 102/120 (removed 18) transitions.
// Phase 1: matrix 102 rows 114 cols
[2024-06-01 07:16:19] [INFO ] Computed 30 invariants in 1 ms
[2024-06-01 07:16:19] [INFO ] Implicit Places using invariants in 54 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 113/214 places, 102/179 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 112 transition count 101
Applied a total of 2 rules in 5 ms. Remains 112 /113 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 112 cols
[2024-06-01 07:16:19] [INFO ] Computed 29 invariants in 1 ms
[2024-06-01 07:16:19] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 07:16:19] [INFO ] Invariant cache hit.
[2024-06-01 07:16:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:16:19] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 153 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 111/214 places, 101/179 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 108 transition count 98
Applied a total of 6 rules in 4 ms. Remains 108 /111 variables (removed 3) and now considering 98/101 (removed 3) transitions.
// Phase 1: matrix 98 rows 108 cols
[2024-06-01 07:16:19] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 07:16:19] [INFO ] Implicit Places using invariants in 47 ms returned [100, 105]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 106/214 places, 98/179 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 104 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 103 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 103 transition count 94
Applied a total of 6 rules in 5 ms. Remains 103 /106 variables (removed 3) and now considering 94/98 (removed 4) transitions.
// Phase 1: matrix 94 rows 103 cols
[2024-06-01 07:16:19] [INFO ] Computed 26 invariants in 1 ms
[2024-06-01 07:16:19] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 07:16:19] [INFO ] Invariant cache hit.
[2024-06-01 07:16:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:16:20] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 103/214 places, 94/179 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 1286 ms. Remains : 103/214 places, 94/179 transitions.
RANDOM walk for 40000 steps (1685 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (719 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2669681 steps, run timeout after 3001 ms. (steps per millisecond=889 ) properties seen :0 out of 1
Probabilistic random walk after 2669681 steps, saw 651816 distinct states, run finished after 3001 ms. (steps per millisecond=889 ) properties seen :0
[2024-06-01 07:16:23] [INFO ] Invariant cache hit.
[2024-06-01 07:16:23] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/60 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/63 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/139 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 44/183 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/189 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/196 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/196 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/197 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/197 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/197 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 5/5 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/60 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/63 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/139 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/183 variables, 31/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/189 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/189 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/189 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/196 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/196 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/197 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/197 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/197 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 629ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 18 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 103/103 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-06-01 07:16:23] [INFO ] Invariant cache hit.
[2024-06-01 07:16:23] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 07:16:23] [INFO ] Invariant cache hit.
[2024-06-01 07:16:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:16:23] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-06-01 07:16:23] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 07:16:23] [INFO ] Invariant cache hit.
[2024-06-01 07:16:23] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 2 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 7 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 5 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/36 constraints. Problems are: Problem set: 5 solved, 84 unsolved
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 16/52 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/52 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 3/101 variables, 10/62 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 14/76 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 1/77 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/77 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 94/195 variables, 101/178 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 5/183 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/183 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 12 (OVERLAPS) 2/197 variables, 2/185 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 2/187 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 2/189 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/189 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/197 variables, 1/190 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/197 variables, 0/190 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 18 (OVERLAPS) 0/197 variables, 0/190 constraints. Problems are: Problem set: 7 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 190 constraints, problems are : Problem set: 7 solved, 82 unsolved in 6969 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 7 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 13/13 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/16 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 54/70 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/70 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 3/101 variables, 10/80 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/81 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/81 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 94/195 variables, 101/182 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 5/187 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 82/269 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 3/272 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/272 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 12 (OVERLAPS) 2/197 variables, 2/274 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 1/275 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/275 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 15 (OVERLAPS) 0/197 variables, 0/275 constraints. Problems are: Problem set: 7 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 275 constraints, problems are : Problem set: 7 solved, 82 unsolved in 4827 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 82/89 constraints, Known Traps: 59/59 constraints]
After SMT, in 11856ms problems are : Problem set: 7 solved, 82 unsolved
Search for dead transitions found 7 dead transitions in 11863ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 103/103 places, 87/94 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 87
Applied a total of 2 rules in 2 ms. Remains 101 /103 variables (removed 2) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 101 cols
[2024-06-01 07:16:35] [INFO ] Computed 26 invariants in 0 ms
[2024-06-01 07:16:35] [INFO ] Implicit Places using invariants in 51 ms returned [18, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/103 places, 87/94 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 86
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 98 transition count 86
Applied a total of 3 rules in 5 ms. Remains 98 /99 variables (removed 1) and now considering 86/87 (removed 1) transitions.
// Phase 1: matrix 86 rows 98 cols
[2024-06-01 07:16:35] [INFO ] Computed 24 invariants in 1 ms
[2024-06-01 07:16:35] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 07:16:35] [INFO ] Invariant cache hit.
[2024-06-01 07:16:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:16:35] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [50, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 137 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 96/103 places, 86/94 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 93 transition count 83
Applied a total of 6 rules in 3 ms. Remains 93 /96 variables (removed 3) and now considering 83/86 (removed 3) transitions.
// Phase 1: matrix 83 rows 93 cols
[2024-06-01 07:16:35] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 07:16:36] [INFO ] Implicit Places using invariants in 45 ms returned [84, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 91/103 places, 83/94 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 82
Applied a total of 2 rules in 2 ms. Remains 90 /91 variables (removed 1) and now considering 82/83 (removed 1) transitions.
// Phase 1: matrix 82 rows 90 cols
[2024-06-01 07:16:36] [INFO ] Computed 20 invariants in 0 ms
[2024-06-01 07:16:36] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 07:16:36] [INFO ] Invariant cache hit.
[2024-06-01 07:16:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:16:36] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 90/103 places, 82/94 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 12416 ms. Remains : 90/103 places, 82/94 transitions.
RANDOM walk for 40000 steps (1713 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (730 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2813917 steps, run timeout after 3001 ms. (steps per millisecond=937 ) properties seen :0 out of 1
Probabilistic random walk after 2813917 steps, saw 686176 distinct states, run finished after 3001 ms. (steps per millisecond=937 ) properties seen :0
[2024-06-01 07:16:39] [INFO ] Invariant cache hit.
[2024-06-01 07:16:39] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/49 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/113 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 45/158 variables, 30/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/164 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/171 variables, 7/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/171 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/172 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/172 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 5/5 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/49 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/51 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/113 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 45/158 variables, 30/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/164 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/171 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/171 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/172 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/172 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/172 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 459ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 18 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 90/90 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 07:16:39] [INFO ] Invariant cache hit.
[2024-06-01 07:16:39] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 07:16:39] [INFO ] Invariant cache hit.
[2024-06-01 07:16:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:16:39] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-06-01 07:16:39] [INFO ] Redundant transitions in 14 ms returned []
Running 77 sub problems to find dead transitions.
[2024-06-01 07:16:39] [INFO ] Invariant cache hit.
[2024-06-01 07:16:39] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 3/88 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 82/170 variables, 88/128 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 2/172 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/172 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/172 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/172 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/172 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/172 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 22 (OVERLAPS) 0/172 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 150 constraints, problems are : Problem set: 0 solved, 77 unsolved in 7294 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 3/88 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 82/170 variables, 88/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 77/225 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (OVERLAPS) 2/172 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/172 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 17 (OVERLAPS) 0/172 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 234 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4795 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 42/42 constraints]
After SMT, in 12129ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 12131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12297 ms. Remains : 90/90 places, 82/82 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 188 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 89 transition count 75
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 83 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 14 place count 83 transition count 69
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 77 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 35 place count 72 transition count 65
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 72 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 71 transition count 64
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 71 transition count 64
Applied a total of 40 rules in 14 ms. Remains 71 /90 variables (removed 19) and now considering 64/82 (removed 18) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 64 rows 71 cols
[2024-06-01 07:16:51] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 07:16:51] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:16:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 07:16:52] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 0 ms returned sat
[2024-06-01 07:16:52] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:16:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 07:16:52] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2024-06-01 07:16:52] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -1 properties in 126 ms.
All properties solved without resorting to model-checking.
Total runtime 85887 ms.
ITS solved all properties within timeout

BK_STOP 1717226212133

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-19"
export BK_EXAMINATION="ReachabilityCardinality"
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 BusinessProcesses-PT-19, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399800598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-19.tgz
mv BusinessProcesses-PT-19 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;