Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760800297.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldIIPt-PT-030B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760800297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 20:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 20:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 512K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717237411217

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:23:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:23:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:23:32] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-06-01 10:23:32] [INFO ] Transformed 2103 places.
[2024-06-01 10:23:32] [INFO ] Transformed 1953 transitions.
[2024-06-01 10:23:32] [INFO ] Found NUPN structural information;
[2024-06-01 10:23:32] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-030B-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 95 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 301 places :
Symmetric choice reduction at 0 with 301 rule applications. Total rules 301 place count 1802 transition count 1652
Iterating global reduction 0 with 301 rules applied. Total rules applied 602 place count 1802 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 603 place count 1801 transition count 1651
Iterating global reduction 0 with 1 rules applied. Total rules applied 604 place count 1801 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 605 place count 1800 transition count 1650
Iterating global reduction 0 with 1 rules applied. Total rules applied 606 place count 1800 transition count 1650
Applied a total of 606 rules in 703 ms. Remains 1800 /2103 variables (removed 303) and now considering 1650/1953 (removed 303) transitions.
// Phase 1: matrix 1650 rows 1800 cols
[2024-06-01 10:23:33] [INFO ] Computed 271 invariants in 33 ms
[2024-06-01 10:23:34] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-06-01 10:23:34] [INFO ] Invariant cache hit.
[2024-06-01 10:23:35] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
Running 1649 sub problems to find dead transitions.
[2024-06-01 10:23:35] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1799/3450 variables, and 0 constraints, problems are : Problem set: 0 solved, 1649 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1800 constraints, PredecessorRefiner: 1649/1649 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1649 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1799/3450 variables, and 0 constraints, problems are : Problem set: 0 solved, 1649 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1800 constraints, PredecessorRefiner: 0/1649 constraints, Known Traps: 0/0 constraints]
After SMT, in 60523ms problems are : Problem set: 0 solved, 1649 unsolved
Search for dead transitions found 0 dead transitions in 60559ms
Starting structural reductions in LTL mode, iteration 1 : 1800/2103 places, 1650/1953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63270 ms. Remains : 1800/2103 places, 1650/1953 transitions.
Support contains 95 out of 1800 places after structural reductions.
[2024-06-01 10:24:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 10:24:36] [INFO ] Flatten gal took : 130 ms
[2024-06-01 10:24:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldIIPt-PT-030B-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:24:36] [INFO ] Flatten gal took : 68 ms
[2024-06-01 10:24:36] [INFO ] Input system was already deterministic with 1650 transitions.
Support contains 83 out of 1800 places (down from 95) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2569 ms. (15 steps per ms) remains 18/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
[2024-06-01 10:24:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 542/588 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1212/1800 variables, 202/271 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1800 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1650/3450 variables, 1800/2071 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3450 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/3450 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3450/3450 variables, and 2071 constraints, problems are : Problem set: 0 solved, 18 unsolved in 3004 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 1800/1800 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 542/588 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 10:24:40] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 18 ms to minimize.
[2024-06-01 10:24:40] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-06-01 10:24:40] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 2 ms to minimize.
[2024-06-01 10:24:40] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 2 ms to minimize.
[2024-06-01 10:24:40] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:24:41] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1212/1800 variables, 202/277 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 10:24:41] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 5 ms to minimize.
[2024-06-01 10:24:42] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 5 ms to minimize.
[2024-06-01 10:24:42] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 9 ms to minimize.
[2024-06-01 10:24:42] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 4 ms to minimize.
[2024-06-01 10:24:42] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 4 ms to minimize.
[2024-06-01 10:24:42] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 4 ms to minimize.
[2024-06-01 10:24:43] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 4 ms to minimize.
[2024-06-01 10:24:43] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-06-01 10:24:43] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 3 ms to minimize.
[2024-06-01 10:24:43] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 3 ms to minimize.
[2024-06-01 10:24:43] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 4 ms to minimize.
[2024-06-01 10:24:43] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-06-01 10:24:44] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 3 ms to minimize.
[2024-06-01 10:24:44] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
[2024-06-01 10:24:44] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-06-01 10:24:44] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-06-01 10:24:44] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-06-01 10:24:44] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 3 ms to minimize.
[2024-06-01 10:24:44] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 3 ms to minimize.
[2024-06-01 10:24:45] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1800 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 10:24:45] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-06-01 10:24:45] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-06-01 10:24:45] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-06-01 10:24:45] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
SMT process timed out in 8066ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 1800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 340 rules applied. Total rules applied 340 place count 1800 transition count 1310
Reduce places removed 340 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 344 rules applied. Total rules applied 684 place count 1460 transition count 1306
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 688 place count 1456 transition count 1306
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 220 Pre rules applied. Total rules applied 688 place count 1456 transition count 1086
Deduced a syphon composed of 220 places in 2 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 3 with 440 rules applied. Total rules applied 1128 place count 1236 transition count 1086
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1140 place count 1224 transition count 1074
Iterating global reduction 3 with 12 rules applied. Total rules applied 1152 place count 1224 transition count 1074
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1152 place count 1224 transition count 1066
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1168 place count 1216 transition count 1066
Performed 503 Post agglomeration using F-continuation condition.Transition count delta: 503
Deduced a syphon composed of 503 places in 0 ms
Reduce places removed 503 places and 0 transitions.
Iterating global reduction 3 with 1006 rules applied. Total rules applied 2174 place count 713 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2175 place count 713 transition count 562
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2177 place count 712 transition count 561
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 2335 place count 633 transition count 608
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2336 place count 633 transition count 607
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2340 place count 633 transition count 603
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2344 place count 629 transition count 603
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 2370 place count 629 transition count 603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2371 place count 628 transition count 602
Applied a total of 2371 rules in 621 ms. Remains 628 /1800 variables (removed 1172) and now considering 602/1650 (removed 1048) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 621 ms. Remains : 628/1800 places, 602/1650 transitions.
RANDOM walk for 40000 steps (8 resets) in 842 ms. (47 steps per ms) remains 10/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
// Phase 1: matrix 602 rows 628 cols
[2024-06-01 10:24:46] [INFO ] Computed 271 invariants in 2 ms
[2024-06-01 10:24:46] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 111/141 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/167 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 208/375 variables, 167/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 21/248 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 300/675 variables, 151/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/675 variables, 67/466 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/675 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/675 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 11/686 variables, 7/475 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 5/480 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/686 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 8/694 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/694 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 255/949 variables, 140/624 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/949 variables, 51/675 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/949 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 12/961 variables, 12/687 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/961 variables, 8/695 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/961 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 30/991 variables, 13/708 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/991 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/991 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (OVERLAPS) 141/1132 variables, 98/808 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1132 variables, 26/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1132 variables, 7/841 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1132 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (OVERLAPS) 4/1136 variables, 7/848 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1136 variables, 4/852 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1136 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (OVERLAPS) 2/1138 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1138 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (OVERLAPS) 49/1187 variables, 27/880 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1187 variables, 11/891 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1187 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (OVERLAPS) 2/1189 variables, 1/892 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1189 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (OVERLAPS) 4/1193 variables, 2/894 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1193 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (OVERLAPS) 27/1220 variables, 19/913 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1220 variables, 5/918 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1220 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (OVERLAPS) 1/1221 variables, 1/919 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1221 variables, 1/920 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1221 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (OVERLAPS) 2/1223 variables, 1/921 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1223 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (OVERLAPS) 7/1230 variables, 6/927 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1230 variables, 2/929 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1230 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 53 (OVERLAPS) 0/1230 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1230/1230 variables, and 929 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3035 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 628/628 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 111/141 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/167 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 208/375 variables, 167/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 21/248 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 300/675 variables, 151/403 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/675 variables, 67/470 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/675 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/675 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 10:24:50] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:24:50] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/675 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 10:24:50] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/675 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/675 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 11/686 variables, 7/488 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/686 variables, 5/493 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/686 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 8/694 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/694 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 255/949 variables, 140/637 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/949 variables, 51/688 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/949 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 12/961 variables, 12/700 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/961 variables, 8/708 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/961 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (OVERLAPS) 30/991 variables, 13/721 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/991 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/991 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (OVERLAPS) 141/1132 variables, 98/821 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1132 variables, 26/847 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1132 variables, 7/854 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1132 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (OVERLAPS) 4/1136 variables, 7/861 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1136 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1136 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (OVERLAPS) 2/1138 variables, 1/866 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1138 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (OVERLAPS) 49/1187 variables, 27/893 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1187 variables, 11/904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1187 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (OVERLAPS) 2/1189 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1189 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (OVERLAPS) 4/1193 variables, 2/907 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1193 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (OVERLAPS) 27/1220 variables, 19/926 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1220 variables, 5/931 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1220 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (OVERLAPS) 1/1221 variables, 1/932 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1221 variables, 1/933 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1221 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (OVERLAPS) 2/1223 variables, 1/934 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1223 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 54 (OVERLAPS) 7/1230 variables, 6/940 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1230 variables, 2/942 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1230 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 57 (OVERLAPS) 0/1230 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 942 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4618 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 628/628 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints]
After SMT, in 7678ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4392 ms.
Support contains 30 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 602/602 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 628 transition count 598
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 624 transition count 598
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 624 transition count 595
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 621 transition count 595
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 613 transition count 587
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 611 transition count 588
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 611 transition count 588
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 607 transition count 584
Applied a total of 39 rules in 93 ms. Remains 607 /628 variables (removed 21) and now considering 584/602 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 607/628 places, 584/602 transitions.
RANDOM walk for 40000 steps (8 resets) in 444 ms. (89 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
// Phase 1: matrix 584 rows 607 cols
[2024-06-01 10:24:59] [INFO ] Computed 271 invariants in 2 ms
[2024-06-01 10:24:59] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 104/132 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 11/143 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 190/333 variables, 143/194 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 17/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 306/639 variables, 154/365 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 70/435 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 3/438 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 7/646 variables, 6/444 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 5/449 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 8/654 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/654 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 266/920 variables, 146/599 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/920 variables, 59/658 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/920 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 7/927 variables, 9/667 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/927 variables, 7/674 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/927 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 10/937 variables, 5/679 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/937 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 142/1079 variables, 84/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1079 variables, 28/791 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1079 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (OVERLAPS) 6/1085 variables, 9/800 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1085 variables, 6/806 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1085 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (OVERLAPS) 6/1091 variables, 3/809 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1091 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (OVERLAPS) 61/1152 variables, 38/847 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1152 variables, 15/862 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1152 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (OVERLAPS) 1/1153 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1153 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1153 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (OVERLAPS) 2/1155 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1155 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (OVERLAPS) 26/1181 variables, 16/881 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1181 variables, 6/887 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1181 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (OVERLAPS) 1/1182 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1182 variables, 1/889 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1182 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (OVERLAPS) 2/1184 variables, 1/890 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1184 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (OVERLAPS) 7/1191 variables, 6/896 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1191 variables, 2/898 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1191 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (OVERLAPS) 0/1191 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1191/1191 variables, and 898 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2527 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 607/607 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 104/132 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 11/143 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 190/333 variables, 143/194 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 17/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 306/639 variables, 154/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 70/439 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 3/442 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 5/447 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 10:25:02] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 7/646 variables, 6/454 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/646 variables, 5/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/646 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 8/654 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/654 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 266/920 variables, 146/609 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/920 variables, 59/668 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/920 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 7/927 variables, 9/677 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/927 variables, 7/684 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/927 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 10/937 variables, 5/689 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 10:25:03] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/937 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/937 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 142/1079 variables, 84/774 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1079 variables, 28/802 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1079 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 6/1085 variables, 9/811 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1085 variables, 6/817 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1085 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (OVERLAPS) 6/1091 variables, 3/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1091 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (OVERLAPS) 61/1152 variables, 38/858 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1152 variables, 15/873 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1152 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (OVERLAPS) 1/1153 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1153 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1153 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (OVERLAPS) 2/1155 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1155 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (OVERLAPS) 26/1181 variables, 16/892 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1181 variables, 6/898 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1181 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (OVERLAPS) 1/1182 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1182 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1182 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (OVERLAPS) 2/1184 variables, 1/901 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1184 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 53 (OVERLAPS) 7/1191 variables, 6/907 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1191 variables, 2/909 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1191 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (OVERLAPS) 0/1191 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1191/1191 variables, and 909 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4115 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 607/607 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 6653ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 4143 ms.
Support contains 28 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 584/584 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 607 transition count 583
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 606 transition count 583
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 604 transition count 584
Applied a total of 6 rules in 45 ms. Remains 604 /607 variables (removed 3) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 604/607 places, 584/584 transitions.
RANDOM walk for 40000 steps (8 resets) in 501 ms. (79 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 220 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 221 ms. (180 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 157701 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 9
Probabilistic random walk after 157701 steps, saw 101257 distinct states, run finished after 3004 ms. (steps per millisecond=52 ) properties seen :0
// Phase 1: matrix 584 rows 604 cols
[2024-06-01 10:25:14] [INFO ] Computed 271 invariants in 2 ms
[2024-06-01 10:25:14] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 104/132 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 11/143 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 192/335 variables, 143/194 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 17/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 304/639 variables, 154/365 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 72/437 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 4/643 variables, 4/445 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/643 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/643 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 8/651 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/651 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 266/917 variables, 144/597 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/917 variables, 59/656 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/917 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 7/924 variables, 9/665 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/924 variables, 7/672 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/924 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 10/934 variables, 5/677 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/934 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 142/1076 variables, 84/761 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1076 variables, 28/789 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1076 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (OVERLAPS) 6/1082 variables, 9/798 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1082 variables, 6/804 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1082 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (OVERLAPS) 6/1088 variables, 3/807 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1088 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (OVERLAPS) 61/1149 variables, 38/845 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1149 variables, 15/860 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1149 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (OVERLAPS) 1/1150 variables, 1/861 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1150 variables, 1/862 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1150 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (OVERLAPS) 2/1152 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1152 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (OVERLAPS) 26/1178 variables, 16/879 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1178 variables, 6/885 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1178 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (OVERLAPS) 1/1179 variables, 1/886 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1179 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1179 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (OVERLAPS) 2/1181 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1181 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (OVERLAPS) 7/1188 variables, 6/894 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1188 variables, 2/896 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1188 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (OVERLAPS) 0/1188 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1188/1188 variables, and 896 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2634 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 604/604 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 104/132 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 11/143 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 10:25:16] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:25:17] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 192/335 variables, 143/196 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 17/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 304/639 variables, 154/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 72/443 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 5/452 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 10:25:17] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/639 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 4/643 variables, 4/457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/643 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 8/651 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/651 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 266/917 variables, 144/609 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/917 variables, 59/668 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/917 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 7/924 variables, 9/677 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/924 variables, 7/684 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/924 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 10/934 variables, 5/689 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/934 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 142/1076 variables, 84/773 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1076 variables, 28/801 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1076 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 6/1082 variables, 9/810 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1082 variables, 6/816 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1082 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (OVERLAPS) 6/1088 variables, 3/819 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1088 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (OVERLAPS) 61/1149 variables, 38/857 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1149 variables, 15/872 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1149 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (OVERLAPS) 1/1150 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1150 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1150 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (OVERLAPS) 2/1152 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1152 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (OVERLAPS) 26/1178 variables, 16/891 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1178 variables, 6/897 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1178 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (OVERLAPS) 1/1179 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1179 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1179 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (OVERLAPS) 2/1181 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1181 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 53 (OVERLAPS) 7/1188 variables, 6/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1188 variables, 2/908 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1188 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (OVERLAPS) 0/1188 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1188/1188 variables, and 908 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3890 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 604/604 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 6536ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1774 ms.
Support contains 28 out of 604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 604/604 places, 584/584 transitions.
Applied a total of 0 rules in 12 ms. Remains 604 /604 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 604/604 places, 584/584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 604/604 places, 584/584 transitions.
Applied a total of 0 rules in 12 ms. Remains 604 /604 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-06-01 10:25:22] [INFO ] Invariant cache hit.
[2024-06-01 10:25:22] [INFO ] Implicit Places using invariants in 284 ms returned [596, 597]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 286 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 602/604 places, 584/584 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 602 transition count 583
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 601 transition count 583
Applied a total of 2 rules in 14 ms. Remains 601 /602 variables (removed 1) and now considering 583/584 (removed 1) transitions.
// Phase 1: matrix 583 rows 601 cols
[2024-06-01 10:25:22] [INFO ] Computed 269 invariants in 5 ms
[2024-06-01 10:25:23] [INFO ] Implicit Places using invariants in 287 ms returned [590]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 288 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 600/604 places, 583/584 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 599 transition count 582
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 599 transition count 582
Applied a total of 2 rules in 17 ms. Remains 599 /600 variables (removed 1) and now considering 582/583 (removed 1) transitions.
// Phase 1: matrix 582 rows 599 cols
[2024-06-01 10:25:23] [INFO ] Computed 268 invariants in 4 ms
[2024-06-01 10:25:23] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-06-01 10:25:23] [INFO ] Invariant cache hit.
[2024-06-01 10:25:23] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 10:25:24] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 599/604 places, 582/584 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1527 ms. Remains : 599/604 places, 582/584 transitions.
RANDOM walk for 40000 steps (8 resets) in 284 ms. (140 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
[2024-06-01 10:25:24] [INFO ] Invariant cache hit.
[2024-06-01 10:25:24] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 85/109 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 11/120 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 166/286 variables, 120/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 14/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 278/564 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 64/381 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 6/570 variables, 5/386 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 4/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/570 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 4/574 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/574 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 276/850 variables, 142/534 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/850 variables, 56/590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/850 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/850 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 10/860 variables, 12/604 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/860 variables, 8/612 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/860 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 10/870 variables, 5/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/870 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 155/1025 variables, 92/709 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1025 variables, 32/741 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1025 variables, 2/743 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1025 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 7/1032 variables, 8/751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1032 variables, 5/756 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1032 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 6/1038 variables, 3/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1038 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 88/1126 variables, 52/811 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1126 variables, 18/829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1126 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 3/1129 variables, 4/833 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1129 variables, 3/836 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1129 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 4/1133 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1133 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (OVERLAPS) 38/1171 variables, 26/864 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1171 variables, 10/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1171 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (OVERLAPS) 1/1172 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1172 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1172 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (OVERLAPS) 2/1174 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1174 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 7/1181 variables, 6/883 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1181 variables, 2/885 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1181 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (OVERLAPS) 0/1181 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1181/1181 variables, and 885 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2202 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 599/599 constraints, ReadFeed: 18/18 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 85/109 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 11/120 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 166/286 variables, 120/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 14/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 278/564 variables, 140/319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 64/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 6/570 variables, 5/394 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/570 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/570 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 4/574 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/574 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 276/850 variables, 142/542 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/850 variables, 56/598 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/850 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/850 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 10/860 variables, 12/612 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/860 variables, 8/620 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/860 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 10/870 variables, 5/625 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/870 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 155/1025 variables, 92/717 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1025 variables, 32/749 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1025 variables, 2/751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1025 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 7/1032 variables, 8/759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1032 variables, 5/764 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1032 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 6/1038 variables, 3/767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1038 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 88/1126 variables, 52/819 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1126 variables, 18/837 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1126 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 3/1129 variables, 4/841 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1129 variables, 3/844 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1129 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (OVERLAPS) 4/1133 variables, 2/846 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1133 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 38/1171 variables, 26/872 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1171 variables, 10/882 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1171 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (OVERLAPS) 1/1172 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1172 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1172 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 2/1174 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1174 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (OVERLAPS) 7/1181 variables, 6/891 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1181 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1181 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 0/1181 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1181/1181 variables, and 893 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3168 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 599/599 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 5380ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2562 ms.
Support contains 24 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 582/582 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 599 transition count 581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 598 transition count 581
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 598 transition count 579
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 596 transition count 579
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 2 with 2 rules applied. Total rules applied 8 place count 595 transition count 578
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 593 transition count 579
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 592 transition count 578
Applied a total of 13 rules in 52 ms. Remains 592 /599 variables (removed 7) and now considering 578/582 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 592/599 places, 578/582 transitions.
RANDOM walk for 40000 steps (8 resets) in 471 ms. (84 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 159468 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 8
Probabilistic random walk after 159468 steps, saw 98937 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
// Phase 1: matrix 578 rows 592 cols
[2024-06-01 10:25:36] [INFO ] Computed 268 invariants in 3 ms
[2024-06-01 10:25:36] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 85/109 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 11/120 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 167/287 variables, 120/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 14/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 276/563 variables, 141/318 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 67/385 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/565 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 4/569 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/569 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 275/844 variables, 140/531 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/844 variables, 57/588 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/844 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 8/852 variables, 11/599 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/852 variables, 8/607 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/852 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 10/862 variables, 5/612 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/862 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 153/1015 variables, 90/702 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1015 variables, 33/735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1015 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 5/1020 variables, 7/742 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1020 variables, 5/747 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1020 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 6/1026 variables, 3/750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1026 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 89/1115 variables, 50/800 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1115 variables, 18/818 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1115 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 3/1118 variables, 4/822 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1118 variables, 3/825 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1118 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (OVERLAPS) 4/1122 variables, 2/827 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1122 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 38/1160 variables, 26/853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1160 variables, 10/863 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1160 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (OVERLAPS) 1/1161 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1161 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1161 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 2/1163 variables, 1/866 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1163 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (OVERLAPS) 7/1170 variables, 6/872 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1170 variables, 2/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1170 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (OVERLAPS) 0/1170 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1170/1170 variables, and 874 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2156 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 592/592 constraints, ReadFeed: 14/14 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 85/109 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 11/120 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 167/287 variables, 120/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 14/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 276/563 variables, 141/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 67/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 6/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:25:38] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:25:38] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/563 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/563 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 2/565 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 4/569 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/569 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 275/844 variables, 140/541 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/844 variables, 57/598 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/844 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 8/852 variables, 11/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/852 variables, 8/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/852 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 10/862 variables, 5/622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/862 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 153/1015 variables, 90/712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1015 variables, 33/745 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1015 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 5/1020 variables, 7/752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1020 variables, 5/757 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1020 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 6/1026 variables, 3/760 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1026 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 89/1115 variables, 50/810 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1115 variables, 18/828 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1115 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (OVERLAPS) 3/1118 variables, 4/832 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1118 variables, 3/835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1118 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 4/1122 variables, 2/837 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1122 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (OVERLAPS) 38/1160 variables, 26/863 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1160 variables, 10/873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1160 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 1/1161 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1161 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1161 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (OVERLAPS) 2/1163 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1163 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (OVERLAPS) 7/1170 variables, 6/882 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1170 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1170 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (OVERLAPS) 0/1170 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1170/1170 variables, and 884 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3254 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 592/592 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 5430ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 4438 ms.
Support contains 24 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 578/578 transitions.
Applied a total of 0 rules in 10 ms. Remains 592 /592 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 592/592 places, 578/578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 578/578 transitions.
Applied a total of 0 rules in 10 ms. Remains 592 /592 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-06-01 10:25:45] [INFO ] Invariant cache hit.
[2024-06-01 10:25:46] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-06-01 10:25:46] [INFO ] Invariant cache hit.
[2024-06-01 10:25:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 10:25:46] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2024-06-01 10:25:46] [INFO ] Redundant transitions in 34 ms returned []
Running 572 sub problems to find dead transitions.
[2024-06-01 10:25:46] [INFO ] Invariant cache hit.
[2024-06-01 10:25:46] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 247/247 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (OVERLAPS) 6/592 variables, 21/268 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-06-01 10:25:59] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:26:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:26:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (OVERLAPS) 578/1170 variables, 592/863 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/1170 variables, 14/877 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1170/1170 variables, and 877 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 592/592 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 247/247 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 3 (OVERLAPS) 6/592 variables, 21/270 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 6 (OVERLAPS) 578/1170 variables, 592/863 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1170 variables, 14/877 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1170 variables, 572/1449 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1170 variables, 0/1449 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1170/1170 variables, and 1449 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 592/592 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 3/3 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 572 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61085 ms. Remains : 592/592 places, 578/578 transitions.
[2024-06-01 10:26:47] [INFO ] Flatten gal took : 56 ms
[2024-06-01 10:26:47] [INFO ] Flatten gal took : 55 ms
[2024-06-01 10:26:47] [INFO ] Input system was already deterministic with 1650 transitions.
Computed a total of 486 stabilizing places and 486 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1777 transition count 1627
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1777 transition count 1627
Applied a total of 46 rules in 144 ms. Remains 1777 /1800 variables (removed 23) and now considering 1627/1650 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 1777/1800 places, 1627/1650 transitions.
[2024-06-01 10:26:47] [INFO ] Flatten gal took : 43 ms
[2024-06-01 10:26:47] [INFO ] Flatten gal took : 43 ms
[2024-06-01 10:26:47] [INFO ] Input system was already deterministic with 1627 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 367 transitions
Trivial Post-agglo rules discarded 367 transitions
Performed 367 trivial Post agglomeration. Transition count delta: 367
Iterating post reduction 0 with 367 rules applied. Total rules applied 367 place count 1799 transition count 1282
Reduce places removed 367 places and 0 transitions.
Iterating post reduction 1 with 367 rules applied. Total rules applied 734 place count 1432 transition count 1282
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 225 Pre rules applied. Total rules applied 734 place count 1432 transition count 1057
Deduced a syphon composed of 225 places in 1 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 2 with 450 rules applied. Total rules applied 1184 place count 1207 transition count 1057
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1205 place count 1186 transition count 1036
Iterating global reduction 2 with 21 rules applied. Total rules applied 1226 place count 1186 transition count 1036
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 1226 place count 1186 transition count 1020
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1258 place count 1170 transition count 1020
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 477
Deduced a syphon composed of 477 places in 1 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 2 with 954 rules applied. Total rules applied 2212 place count 693 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2213 place count 693 transition count 542
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 2215 place count 692 transition count 541
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2217 place count 690 transition count 539
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2219 place count 688 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2219 place count 688 transition count 538
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2221 place count 687 transition count 538
Applied a total of 2221 rules in 251 ms. Remains 687 /1800 variables (removed 1113) and now considering 538/1650 (removed 1112) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 251 ms. Remains : 687/1800 places, 538/1650 transitions.
[2024-06-01 10:26:47] [INFO ] Flatten gal took : 15 ms
[2024-06-01 10:26:47] [INFO ] Flatten gal took : 16 ms
[2024-06-01 10:26:47] [INFO ] Input system was already deterministic with 538 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 362 transitions
Trivial Post-agglo rules discarded 362 transitions
Performed 362 trivial Post agglomeration. Transition count delta: 362
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 1799 transition count 1287
Reduce places removed 362 places and 0 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 724 place count 1437 transition count 1287
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 224 Pre rules applied. Total rules applied 724 place count 1437 transition count 1063
Deduced a syphon composed of 224 places in 1 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 2 with 448 rules applied. Total rules applied 1172 place count 1213 transition count 1063
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1190 place count 1195 transition count 1045
Iterating global reduction 2 with 18 rules applied. Total rules applied 1208 place count 1195 transition count 1045
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1208 place count 1195 transition count 1032
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1234 place count 1182 transition count 1032
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 478
Deduced a syphon composed of 478 places in 1 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 2 with 956 rules applied. Total rules applied 2190 place count 704 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2191 place count 704 transition count 553
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2193 place count 703 transition count 552
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2194 place count 702 transition count 551
Applied a total of 2194 rules in 228 ms. Remains 702 /1800 variables (removed 1098) and now considering 551/1650 (removed 1099) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 228 ms. Remains : 702/1800 places, 551/1650 transitions.
[2024-06-01 10:26:48] [INFO ] Flatten gal took : 19 ms
[2024-06-01 10:26:48] [INFO ] Flatten gal took : 16 ms
[2024-06-01 10:26:48] [INFO ] Input system was already deterministic with 551 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1774 transition count 1624
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1774 transition count 1624
Applied a total of 52 rules in 162 ms. Remains 1774 /1800 variables (removed 26) and now considering 1624/1650 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 1774/1800 places, 1624/1650 transitions.
[2024-06-01 10:26:48] [INFO ] Flatten gal took : 35 ms
[2024-06-01 10:26:48] [INFO ] Flatten gal took : 37 ms
[2024-06-01 10:26:48] [INFO ] Input system was already deterministic with 1624 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1773 transition count 1623
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1773 transition count 1623
Applied a total of 54 rules in 144 ms. Remains 1773 /1800 variables (removed 27) and now considering 1623/1650 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 1773/1800 places, 1623/1650 transitions.
[2024-06-01 10:26:48] [INFO ] Flatten gal took : 34 ms
[2024-06-01 10:26:48] [INFO ] Flatten gal took : 36 ms
[2024-06-01 10:26:48] [INFO ] Input system was already deterministic with 1623 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1772 transition count 1622
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1772 transition count 1622
Applied a total of 56 rules in 140 ms. Remains 1772 /1800 variables (removed 28) and now considering 1622/1650 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 1772/1800 places, 1622/1650 transitions.
[2024-06-01 10:26:49] [INFO ] Flatten gal took : 32 ms
[2024-06-01 10:26:49] [INFO ] Flatten gal took : 34 ms
[2024-06-01 10:26:49] [INFO ] Input system was already deterministic with 1622 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 368 transitions
Trivial Post-agglo rules discarded 368 transitions
Performed 368 trivial Post agglomeration. Transition count delta: 368
Iterating post reduction 0 with 368 rules applied. Total rules applied 368 place count 1799 transition count 1281
Reduce places removed 368 places and 0 transitions.
Iterating post reduction 1 with 368 rules applied. Total rules applied 736 place count 1431 transition count 1281
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 224 Pre rules applied. Total rules applied 736 place count 1431 transition count 1057
Deduced a syphon composed of 224 places in 1 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 2 with 448 rules applied. Total rules applied 1184 place count 1207 transition count 1057
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1205 place count 1186 transition count 1036
Iterating global reduction 2 with 21 rules applied. Total rules applied 1226 place count 1186 transition count 1036
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 1226 place count 1186 transition count 1020
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1258 place count 1170 transition count 1020
Performed 475 Post agglomeration using F-continuation condition.Transition count delta: 475
Deduced a syphon composed of 475 places in 0 ms
Reduce places removed 475 places and 0 transitions.
Iterating global reduction 2 with 950 rules applied. Total rules applied 2208 place count 695 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2209 place count 695 transition count 544
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2211 place count 694 transition count 543
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2213 place count 692 transition count 541
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2215 place count 690 transition count 541
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2215 place count 690 transition count 540
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2217 place count 689 transition count 540
Applied a total of 2217 rules in 231 ms. Remains 689 /1800 variables (removed 1111) and now considering 540/1650 (removed 1110) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 231 ms. Remains : 689/1800 places, 540/1650 transitions.
[2024-06-01 10:26:49] [INFO ] Flatten gal took : 13 ms
[2024-06-01 10:26:49] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:26:49] [INFO ] Input system was already deterministic with 540 transitions.
RANDOM walk for 17 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
FORMULA ShieldIIPt-PT-030B-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1771 transition count 1621
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1771 transition count 1621
Applied a total of 58 rules in 130 ms. Remains 1771 /1800 variables (removed 29) and now considering 1621/1650 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 1771/1800 places, 1621/1650 transitions.
[2024-06-01 10:26:49] [INFO ] Flatten gal took : 32 ms
[2024-06-01 10:26:49] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:26:49] [INFO ] Input system was already deterministic with 1621 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1774 transition count 1624
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1774 transition count 1624
Applied a total of 52 rules in 130 ms. Remains 1774 /1800 variables (removed 26) and now considering 1624/1650 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 1774/1800 places, 1624/1650 transitions.
[2024-06-01 10:26:49] [INFO ] Flatten gal took : 45 ms
[2024-06-01 10:26:49] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:26:50] [INFO ] Input system was already deterministic with 1624 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 365 transitions
Trivial Post-agglo rules discarded 365 transitions
Performed 365 trivial Post agglomeration. Transition count delta: 365
Iterating post reduction 0 with 365 rules applied. Total rules applied 365 place count 1799 transition count 1284
Reduce places removed 365 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 367 rules applied. Total rules applied 732 place count 1434 transition count 1282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 734 place count 1432 transition count 1282
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 224 Pre rules applied. Total rules applied 734 place count 1432 transition count 1058
Deduced a syphon composed of 224 places in 2 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 3 with 448 rules applied. Total rules applied 1182 place count 1208 transition count 1058
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1203 place count 1187 transition count 1037
Iterating global reduction 3 with 21 rules applied. Total rules applied 1224 place count 1187 transition count 1037
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 1224 place count 1187 transition count 1021
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1256 place count 1171 transition count 1021
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 478
Deduced a syphon composed of 478 places in 0 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 3 with 956 rules applied. Total rules applied 2212 place count 693 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2213 place count 693 transition count 542
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2215 place count 692 transition count 541
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2217 place count 690 transition count 539
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2219 place count 688 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2219 place count 688 transition count 538
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 2221 place count 687 transition count 538
Applied a total of 2221 rules in 189 ms. Remains 687 /1800 variables (removed 1113) and now considering 538/1650 (removed 1112) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 190 ms. Remains : 687/1800 places, 538/1650 transitions.
[2024-06-01 10:26:50] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:26:50] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:26:50] [INFO ] Input system was already deterministic with 538 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1775 transition count 1625
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1775 transition count 1625
Applied a total of 50 rules in 177 ms. Remains 1775 /1800 variables (removed 25) and now considering 1625/1650 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 1775/1800 places, 1625/1650 transitions.
[2024-06-01 10:26:50] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:26:50] [INFO ] Flatten gal took : 37 ms
[2024-06-01 10:26:50] [INFO ] Input system was already deterministic with 1625 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1772 transition count 1622
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1772 transition count 1622
Applied a total of 56 rules in 142 ms. Remains 1772 /1800 variables (removed 28) and now considering 1622/1650 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 1772/1800 places, 1622/1650 transitions.
[2024-06-01 10:26:50] [INFO ] Flatten gal took : 31 ms
[2024-06-01 10:26:50] [INFO ] Flatten gal took : 32 ms
[2024-06-01 10:26:50] [INFO ] Input system was already deterministic with 1622 transitions.
[2024-06-01 10:26:50] [INFO ] Flatten gal took : 32 ms
[2024-06-01 10:26:50] [INFO ] Flatten gal took : 34 ms
[2024-06-01 10:26:50] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 10:26:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1800 places, 1650 transitions and 4260 arcs took 8 ms.
Total runtime 198726 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldIIPt-PT-030B-CTLCardinality-2024-00
Could not compute solution for formula : ShieldIIPt-PT-030B-CTLCardinality-2024-02
Could not compute solution for formula : ShieldIIPt-PT-030B-CTLCardinality-2024-03
Could not compute solution for formula : ShieldIIPt-PT-030B-CTLCardinality-2024-04
Could not compute solution for formula : ShieldIIPt-PT-030B-CTLCardinality-2024-05
Could not compute solution for formula : ShieldIIPt-PT-030B-CTLCardinality-2024-06
Could not compute solution for formula : ShieldIIPt-PT-030B-CTLCardinality-2024-10
Could not compute solution for formula : ShieldIIPt-PT-030B-CTLCardinality-2024-11
Could not compute solution for formula : ShieldIIPt-PT-030B-CTLCardinality-2023-12
Could not compute solution for formula : ShieldIIPt-PT-030B-CTLCardinality-2023-13
Could not compute solution for formula : ShieldIIPt-PT-030B-CTLCardinality-2023-14

BK_STOP 1717237611337

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldIIPt-PT-030B-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/742/ctl_0_
ctl formula name ShieldIIPt-PT-030B-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/742/ctl_1_
ctl formula name ShieldIIPt-PT-030B-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/742/ctl_2_
ctl formula name ShieldIIPt-PT-030B-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/742/ctl_3_
ctl formula name ShieldIIPt-PT-030B-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/742/ctl_4_
ctl formula name ShieldIIPt-PT-030B-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/742/ctl_5_
ctl formula name ShieldIIPt-PT-030B-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/742/ctl_6_
ctl formula name ShieldIIPt-PT-030B-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/742/ctl_7_
ctl formula name ShieldIIPt-PT-030B-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/742/ctl_8_
ctl formula name ShieldIIPt-PT-030B-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/742/ctl_9_
ctl formula name ShieldIIPt-PT-030B-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/742/ctl_10_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-030B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldIIPt-PT-030B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760800297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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