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.r496-tall-171640603000257.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 FunctionPointer-PT-b064, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603000257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 6.5K 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 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 15:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717189471106

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:04:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:04:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:04:32] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-31 21:04:32] [INFO ] Transformed 306 places.
[2024-05-31 21:04:32] [INFO ] Transformed 840 transitions.
[2024-05-31 21:04:32] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 84 places in 8 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b064-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 213 transition count 648
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 27 place count 195 transition count 534
Iterating global reduction 1 with 18 rules applied. Total rules applied 45 place count 195 transition count 534
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 77 place count 195 transition count 502
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 85 place count 187 transition count 486
Iterating global reduction 2 with 8 rules applied. Total rules applied 93 place count 187 transition count 486
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 105 place count 187 transition count 474
Applied a total of 105 rules in 52 ms. Remains 187 /222 variables (removed 35) and now considering 474/648 (removed 174) transitions.
[2024-05-31 21:04:32] [INFO ] Flow matrix only has 322 transitions (discarded 152 similar events)
// Phase 1: matrix 322 rows 187 cols
[2024-05-31 21:04:32] [INFO ] Computed 2 invariants in 19 ms
[2024-05-31 21:04:32] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-31 21:04:32] [INFO ] Flow matrix only has 322 transitions (discarded 152 similar events)
[2024-05-31 21:04:32] [INFO ] Invariant cache hit.
[2024-05-31 21:04:32] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-31 21:04:33] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-05-31 21:04:33] [INFO ] Flow matrix only has 322 transitions (discarded 152 similar events)
[2024-05-31 21:04:33] [INFO ] Invariant cache hit.
[2024-05-31 21:04:33] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (OVERLAPS) 322/508 variables, 186/188 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 62/250 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 472 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/509 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 8 (OVERLAPS) 0/509 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 472 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 251 constraints, problems are : Problem set: 0 solved, 472 unsolved in 20492 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (OVERLAPS) 322/508 variables, 186/188 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 62/250 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 32/282 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 7 (OVERLAPS) 1/509 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 440/723 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 10 (OVERLAPS) 0/509 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 472 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 723 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
After SMT, in 51206ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 51223ms
Starting structural reductions in LTL mode, iteration 1 : 187/222 places, 474/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51875 ms. Remains : 187/222 places, 474/648 transitions.
Support contains 68 out of 187 places after structural reductions.
[2024-05-31 21:05:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 21:05:24] [INFO ] Flatten gal took : 57 ms
FORMULA FunctionPointer-PT-b064-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:05:24] [INFO ] Flatten gal took : 28 ms
[2024-05-31 21:05:24] [INFO ] Input system was already deterministic with 474 transitions.
Support contains 63 out of 187 places (down from 68) after GAL structural reductions.
RANDOM walk for 40015 steps (26 resets) in 1626 ms. (24 steps per ms) remains 26/49 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
[2024-05-31 21:05:25] [INFO ] Flow matrix only has 322 transitions (discarded 152 similar events)
[2024-05-31 21:05:25] [INFO ] Invariant cache hit.
[2024-05-31 21:05:25] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 42/78 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 22/100 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 214/314 variables, 100/102 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 19/121 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 8 (OVERLAPS) 137/451 variables, 52/173 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 38/211 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/211 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 51/502 variables, 28/239 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 5/244 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 0/244 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 7/509 variables, 7/251 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/509 variables, 0/251 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 0/509 variables, 0/251 constraints. Problems are: Problem set: 5 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 251 constraints, problems are : Problem set: 5 solved, 21 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 43/72 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 154/226 variables, 72/73 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 6/79 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/79 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 166/392 variables, 46/125 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 42/167 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 21/188 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/188 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 19/411 variables, 1/189 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 3/192 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 86/497 variables, 54/246 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/497 variables, 14/260 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/497 variables, 0/260 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 12/509 variables, 12/272 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/509 variables, 0/272 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 18 (OVERLAPS) 0/509 variables, 0/272 constraints. Problems are: Problem set: 5 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 272 constraints, problems are : Problem set: 5 solved, 21 unsolved in 1468 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 21/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 2523ms problems are : Problem set: 5 solved, 21 unsolved
Fused 21 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 29 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 474/474 transitions.
Graph (complete) has 749 edges and 187 vertex of which 172 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 172 transition count 443
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 163 transition count 423
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 163 transition count 423
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 58 place count 163 transition count 415
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 161 transition count 411
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 161 transition count 411
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 159 transition count 405
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 159 transition count 405
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 157 transition count 399
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 157 transition count 399
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 156 transition count 397
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 156 transition count 397
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 155 transition count 393
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 155 transition count 393
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 154 transition count 389
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 154 transition count 389
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 153 transition count 387
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 153 transition count 387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 152 transition count 385
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 152 transition count 385
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 151 transition count 383
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 151 transition count 383
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 150 transition count 381
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 150 transition count 381
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 98 place count 150 transition count 367
Applied a total of 98 rules in 98 ms. Remains 150 /187 variables (removed 37) and now considering 367/474 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 150/187 places, 367/474 transitions.
RANDOM walk for 40001 steps (10 resets) in 311 ms. (128 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
[2024-05-31 21:05:28] [INFO ] Flow matrix only has 247 transitions (discarded 120 similar events)
// Phase 1: matrix 247 rows 150 cols
[2024-05-31 21:05:28] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 21:05:28] [INFO ] State equation strengthened by 45 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, 19 unsolved
At refinement iteration 1 (OVERLAPS) 44/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 140/208 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 121/329 variables, 38/111 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 34/145 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 15/344 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 44/388 variables, 34/183 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 9/397 variables, 7/197 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 0/397 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 197 constraints, problems are : Problem set: 0 solved, 19 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 44/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 140/208 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 121/329 variables, 38/111 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 34/145 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 19/164 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 15/344 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 44/388 variables, 34/202 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 9/397 variables, 7/216 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/397 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 0/397 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 216 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 1909ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 14 different solutions.
Parikh walk visited 3 properties in 9842 ms.
Support contains 21 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 367/367 transitions.
Graph (complete) has 609 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 146 transition count 361
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 143 transition count 355
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 143 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 143 transition count 353
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 141 transition count 347
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 141 transition count 347
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 139 transition count 343
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 139 transition count 343
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 138 transition count 341
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 138 transition count 341
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 137 transition count 339
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 137 transition count 339
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 136 transition count 337
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 136 transition count 337
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 135 transition count 335
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 135 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 134 transition count 333
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 134 transition count 333
Applied a total of 33 rules in 38 ms. Remains 134 /150 variables (removed 16) and now considering 333/367 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 134/150 places, 333/367 transitions.
RANDOM walk for 40001 steps (9 resets) in 230 ms. (173 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 187735 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :1 out of 16
Probabilistic random walk after 187735 steps, saw 117629 distinct states, run finished after 3017 ms. (steps per millisecond=62 ) properties seen :1
[2024-05-31 21:05:43] [INFO ] Flow matrix only has 221 transitions (discarded 112 similar events)
// Phase 1: matrix 221 rows 134 cols
[2024-05-31 21:05:43] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:05:43] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 45/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 107/301 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 31/132 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 11/312 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 37/349 variables, 28/164 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 6/355 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/355 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 174 constraints, problems are : Problem set: 0 solved, 15 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 45/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 107/301 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 31/132 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 15/147 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 11/312 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 37/349 variables, 28/179 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 5/184 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/349 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 6/355 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 189 constraints, problems are : Problem set: 0 solved, 15 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 1367ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 20 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 333/333 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 133 transition count 331
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 133 transition count 331
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 132 transition count 327
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 132 transition count 327
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 131 transition count 325
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 131 transition count 325
Applied a total of 6 rules in 18 ms. Remains 131 /134 variables (removed 3) and now considering 325/333 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 131/134 places, 325/333 transitions.
RANDOM walk for 40004 steps (9 resets) in 293 ms. (136 steps per ms) remains 14/15 properties
BEST_FIRST walk for 40004 steps (10 resets) in 75 ms. (526 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (9 resets) in 72 ms. (548 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 55 ms. (714 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 57 ms. (689 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (9 resets) in 65 ms. (606 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (9 resets) in 52 ms. (754 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (10 resets) in 51 ms. (769 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (10 resets) in 56 ms. (701 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (9 resets) in 63 ms. (625 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (9 resets) in 58 ms. (678 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (10 resets) in 46 ms. (851 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 203041 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 14
Probabilistic random walk after 203041 steps, saw 127154 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-31 21:05:48] [INFO ] Flow matrix only has 215 transitions (discarded 110 similar events)
// Phase 1: matrix 215 rows 131 cols
[2024-05-31 21:05:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:05:48] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 46/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 104/298 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 31/132 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 11/309 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 34/343 variables, 27/163 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 3/346 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/346 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/346 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 171 constraints, problems are : Problem set: 0 solved, 14 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 46/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 104/298 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 31/132 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 14/146 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 11/309 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 34/343 variables, 27/177 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/343 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 3/346 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 0/346 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 185 constraints, problems are : Problem set: 0 solved, 14 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 1267ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 8 different solutions.
Parikh walk visited 3 properties in 32954 ms.
Support contains 16 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 325/325 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 321
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 129 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 128 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 128 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 127 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 127 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 126 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 126 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 125 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 125 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 124 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 124 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 123 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 123 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 122 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 122 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 121 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 121 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 120 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 120 transition count 297
Applied a total of 24 rules in 30 ms. Remains 120 /131 variables (removed 11) and now considering 297/325 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 120/131 places, 297/325 transitions.
RANDOM walk for 40037 steps (10 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (9 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (11 resets) in 31 ms. (1250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (10 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (11 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 250823 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 11
Probabilistic random walk after 250823 steps, saw 156896 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2024-05-31 21:06:25] [INFO ] Flow matrix only has 195 transitions (discarded 102 similar events)
// Phase 1: matrix 195 rows 120 cols
[2024-05-31 21:06:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:06:25] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 46/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 119/181 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 89/270 variables, 28/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 28/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 10/280 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 32/312 variables, 25/149 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/312 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 3/315 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/315 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/315 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 157 constraints, problems are : Problem set: 0 solved, 11 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 120/120 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 46/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 119/181 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 89/270 variables, 28/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 28/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 10/280 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 32/312 variables, 25/160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/312 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/312 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 3/315 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/315 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 0/315 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 168 constraints, problems are : Problem set: 0 solved, 11 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 120/120 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 962ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 2 properties in 37628 ms.
Support contains 14 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 297/297 transitions.
Graph (complete) has 496 edges and 120 vertex of which 117 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 117 transition count 291
Applied a total of 7 rules in 9 ms. Remains 117 /120 variables (removed 3) and now considering 291/297 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 117/120 places, 291/297 transitions.
RANDOM walk for 40001 steps (8 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 227709 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 9
Probabilistic random walk after 227709 steps, saw 142511 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-31 21:07:07] [INFO ] Flow matrix only has 189 transitions (discarded 102 similar events)
// Phase 1: matrix 189 rows 117 cols
[2024-05-31 21:07:07] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 21:07:07] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 47/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 116/177 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 84/261 variables, 26/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 25/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 10/271 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 32/303 variables, 25/144 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/303 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 3/306 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/306 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/306 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 152 constraints, problems are : Problem set: 0 solved, 9 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 32/32 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 47/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 116/177 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 84/261 variables, 26/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 25/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 10/271 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 32/303 variables, 25/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 3/306 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/306 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 161 constraints, problems are : Problem set: 0 solved, 9 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 14 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 291/291 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 117/117 places, 291/291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 291/291 transitions.
Applied a total of 0 rules in 6 ms. Remains 117 /117 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-05-31 21:07:08] [INFO ] Flow matrix only has 189 transitions (discarded 102 similar events)
[2024-05-31 21:07:08] [INFO ] Invariant cache hit.
[2024-05-31 21:07:08] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-31 21:07:08] [INFO ] Flow matrix only has 189 transitions (discarded 102 similar events)
[2024-05-31 21:07:08] [INFO ] Invariant cache hit.
[2024-05-31 21:07:08] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 21:07:08] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-31 21:07:08] [INFO ] Redundant transitions in 14 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-31 21:07:08] [INFO ] Flow matrix only has 189 transitions (discarded 102 similar events)
[2024-05-31 21:07:08] [INFO ] Invariant cache hit.
[2024-05-31 21:07:08] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 189/306 variables, 117/120 constraints. Problems are: Problem set: 0 solved, 289 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 32/152 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (OVERLAPS) 0/306 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 152 constraints, problems are : Problem set: 0 solved, 289 unsolved in 5502 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 189/306 variables, 117/120 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 32/152 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 289/441 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 441 constraints, problems are : Problem set: 0 solved, 289 unsolved in 9007 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 0/0 constraints]
After SMT, in 14768ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 14773ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15043 ms. Remains : 117/117 places, 291/291 transitions.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA FunctionPointer-PT-b064-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:07:23] [INFO ] Flatten gal took : 33 ms
[2024-05-31 21:07:23] [INFO ] Flatten gal took : 33 ms
[2024-05-31 21:07:23] [INFO ] Input system was already deterministic with 474 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 999 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 159 transition count 396
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 159 transition count 396
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 152 transition count 378
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 152 transition count 378
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 145 transition count 354
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 145 transition count 354
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 104 place count 138 transition count 330
Iterating global reduction 2 with 7 rules applied. Total rules applied 111 place count 138 transition count 330
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 118 place count 131 transition count 308
Iterating global reduction 2 with 7 rules applied. Total rules applied 125 place count 131 transition count 308
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 132 place count 124 transition count 290
Iterating global reduction 2 with 7 rules applied. Total rules applied 139 place count 124 transition count 290
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 146 place count 117 transition count 276
Iterating global reduction 2 with 7 rules applied. Total rules applied 153 place count 117 transition count 276
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 160 place count 110 transition count 262
Iterating global reduction 2 with 7 rules applied. Total rules applied 167 place count 110 transition count 262
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 174 place count 103 transition count 248
Iterating global reduction 2 with 7 rules applied. Total rules applied 181 place count 103 transition count 248
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 185 place count 99 transition count 240
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 191 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 97 transition count 236
Applied a total of 193 rules in 26 ms. Remains 97 /187 variables (removed 90) and now considering 236/474 (removed 238) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 97/187 places, 236/474 transitions.
[2024-05-31 21:07:23] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:07:23] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:07:23] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Graph (complete) has 999 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 159 transition count 396
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 159 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 152 transition count 378
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 152 transition count 378
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 145 transition count 354
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 145 transition count 354
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 138 transition count 330
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 138 transition count 330
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 118 place count 131 transition count 308
Iterating global reduction 1 with 7 rules applied. Total rules applied 125 place count 131 transition count 308
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 132 place count 124 transition count 290
Iterating global reduction 1 with 7 rules applied. Total rules applied 139 place count 124 transition count 290
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 146 place count 117 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 153 place count 117 transition count 276
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 160 place count 110 transition count 262
Iterating global reduction 1 with 7 rules applied. Total rules applied 167 place count 110 transition count 262
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 174 place count 103 transition count 248
Iterating global reduction 1 with 7 rules applied. Total rules applied 181 place count 103 transition count 248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 185 place count 99 transition count 240
Iterating global reduction 1 with 4 rules applied. Total rules applied 189 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 191 place count 97 transition count 236
Iterating global reduction 1 with 2 rules applied. Total rules applied 193 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 195 place count 97 transition count 234
Applied a total of 195 rules in 54 ms. Remains 97 /187 variables (removed 90) and now considering 234/474 (removed 240) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 97/187 places, 234/474 transitions.
[2024-05-31 21:07:23] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:07:23] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:07:23] [INFO ] Input system was already deterministic with 234 transitions.
RANDOM walk for 40048 steps (37 resets) in 38 ms. (1026 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (25 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1864641 steps, run timeout after 3018 ms. (steps per millisecond=617 ) properties seen :0 out of 1
Probabilistic random walk after 1864641 steps, saw 1225777 distinct states, run finished after 3018 ms. (steps per millisecond=617 ) properties seen :0
[2024-05-31 21:07:26] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-31 21:07:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:07:26] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/170 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 26/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/233 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/248 variables, 12/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/252 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/255 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/170 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 26/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 63/233 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/248 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/252 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/255 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/255 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/255 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 231ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 234/234 transitions.
Graph (complete) has 397 edges and 97 vertex of which 73 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 73 transition count 186
Applied a total of 49 rules in 16 ms. Remains 73 /97 variables (removed 24) and now considering 186/234 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 73/97 places, 186/234 transitions.
RANDOM walk for 4000002 steps (8 resets) in 5519 ms. (724 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2174 ms. (1839 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3868179 steps, run timeout after 6001 ms. (steps per millisecond=644 ) properties seen :0 out of 1
Probabilistic random walk after 3868179 steps, saw 2407687 distinct states, run finished after 6001 ms. (steps per millisecond=644 ) properties seen :0
[2024-05-31 21:07:35] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
// Phase 1: matrix 112 rows 73 cols
[2024-05-31 21:07:35] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 21:07:35] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/154 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/171 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/178 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/182 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/185 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/154 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/171 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/178 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/182 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/185 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 204ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 73/73 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-31 21:07:35] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:07:35] [INFO ] Invariant cache hit.
[2024-05-31 21:07:35] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 21:07:35] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:07:35] [INFO ] Invariant cache hit.
[2024-05-31 21:07:35] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 21:07:35] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-31 21:07:35] [INFO ] Redundant transitions in 2 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-31 21:07:35] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:07:35] [INFO ] Invariant cache hit.
[2024-05-31 21:07:35] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3373 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 275 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4623 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 8096ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 8100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8348 ms. Remains : 73/73 places, 186/186 transitions.
RANDOM walk for 400001 steps (8 resets) in 1413 ms. (282 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-31 21:07:44] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:07:44] [INFO ] Invariant cache hit.
[2024-05-31 21:07:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:07:44] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:07:44] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 21:07:44] [INFO ] After 3ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:07:44] [INFO ] After 12ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:07:44] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:07:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 21:07:44] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:07:44] [INFO ] After 3ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:07:44] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:07:44] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000009 steps (8 resets) in 5607 ms. (713 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2442 ms. (1637 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3858737 steps, run timeout after 6131 ms. (steps per millisecond=629 ) properties seen :0 out of 1
Probabilistic random walk after 3858737 steps, saw 2401811 distinct states, run finished after 6132 ms. (steps per millisecond=629 ) properties seen :0
[2024-05-31 21:07:52] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:07:52] [INFO ] Invariant cache hit.
[2024-05-31 21:07:52] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/154 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/171 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/178 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/182 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/185 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/154 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/171 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/178 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/182 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/185 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 73/73 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-31 21:07:52] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:07:52] [INFO ] Invariant cache hit.
[2024-05-31 21:07:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 21:07:52] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:07:52] [INFO ] Invariant cache hit.
[2024-05-31 21:07:52] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 21:07:52] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-31 21:07:52] [INFO ] Redundant transitions in 2 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-31 21:07:52] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:07:52] [INFO ] Invariant cache hit.
[2024-05-31 21:07:52] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3388 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 275 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4472 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 7962ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 7965ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8158 ms. Remains : 73/73 places, 186/186 transitions.
RANDOM walk for 400000 steps (8 resets) in 458 ms. (871 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-31 21:08:00] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:08:00] [INFO ] Invariant cache hit.
[2024-05-31 21:08:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:08:00] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:08:00] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 21:08:00] [INFO ] After 2ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:08:00] [INFO ] After 9ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:08:00] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:08:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:08:01] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:08:01] [INFO ] After 3ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:08:01] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:08:01] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1956409 steps, run timeout after 3001 ms. (steps per millisecond=651 ) properties seen :0 out of 1
Probabilistic random walk after 1956409 steps, saw 1217784 distinct states, run finished after 3001 ms. (steps per millisecond=651 ) properties seen :0
[2024-05-31 21:08:04] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:08:04] [INFO ] Invariant cache hit.
[2024-05-31 21:08:04] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/154 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/171 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/178 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/182 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/185 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/154 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/171 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/178 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/182 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/185 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 73/73 places, 186/186 transitions.
RANDOM walk for 40000 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1917485 steps, run timeout after 3001 ms. (steps per millisecond=638 ) properties seen :0 out of 1
Probabilistic random walk after 1917485 steps, saw 1193555 distinct states, run finished after 3003 ms. (steps per millisecond=638 ) properties seen :0
[2024-05-31 21:08:07] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:08:07] [INFO ] Invariant cache hit.
[2024-05-31 21:08:07] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/154 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/171 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/178 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/182 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/185 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/154 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/171 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/178 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/182 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/185 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 8 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 73/73 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 10 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-31 21:08:07] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:08:07] [INFO ] Invariant cache hit.
[2024-05-31 21:08:07] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 21:08:07] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:08:07] [INFO ] Invariant cache hit.
[2024-05-31 21:08:07] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 21:08:07] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-31 21:08:07] [INFO ] Redundant transitions in 1 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-31 21:08:07] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-31 21:08:07] [INFO ] Invariant cache hit.
[2024-05-31 21:08:07] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3388 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 275 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4396 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 7897ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 7901ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8085 ms. Remains : 73/73 places, 186/186 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 73 transition count 105
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 66 transition count 105
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 88 place count 66 transition count 94
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 110 place count 55 transition count 94
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 138 place count 41 transition count 80
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 35 transition count 68
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 35 transition count 68
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 29 transition count 56
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 29 transition count 56
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 168 place count 23 transition count 44
Iterating global reduction 2 with 6 rules applied. Total rules applied 174 place count 23 transition count 44
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 180 place count 23 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 21 transition count 39
Applied a total of 184 rules in 23 ms. Remains 21 /73 variables (removed 52) and now considering 39/186 (removed 147) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 21 cols
[2024-05-31 21:08:15] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 21:08:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:08:15] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:08:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 21:08:15] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:08:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:08:15] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:08:15] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:08:15] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 107 ms.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 73 transition count 105
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 66 transition count 105
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 88 place count 66 transition count 94
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 110 place count 55 transition count 94
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 138 place count 41 transition count 80
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 35 transition count 68
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 35 transition count 68
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 29 transition count 56
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 29 transition count 56
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 168 place count 23 transition count 44
Iterating global reduction 2 with 6 rules applied. Total rules applied 174 place count 23 transition count 44
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 180 place count 23 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 21 transition count 39
Applied a total of 184 rules in 7 ms. Remains 21 /73 variables (removed 52) and now considering 39/186 (removed 147) transitions.
Running SMT prover for 1 properties.
[2024-05-31 21:08:15] [INFO ] Invariant cache hit.
[2024-05-31 21:08:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:08:15] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:08:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:08:15] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:08:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:08:15] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:08:15] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:08:15] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 82 ms.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 170 transition count 440
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 170 transition count 440
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 47 place count 170 transition count 426
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 162 transition count 404
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 162 transition count 404
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 155 transition count 386
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 155 transition count 386
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 83 place count 149 transition count 366
Iterating global reduction 2 with 6 rules applied. Total rules applied 89 place count 149 transition count 366
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 95 place count 143 transition count 346
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 143 transition count 346
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 107 place count 137 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 113 place count 137 transition count 326
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 119 place count 131 transition count 310
Iterating global reduction 2 with 6 rules applied. Total rules applied 125 place count 131 transition count 310
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 131 place count 125 transition count 298
Iterating global reduction 2 with 6 rules applied. Total rules applied 137 place count 125 transition count 298
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 119 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 119 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 154 place count 114 transition count 276
Iterating global reduction 2 with 5 rules applied. Total rules applied 159 place count 114 transition count 276
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 163 place count 110 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 167 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 169 place count 108 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 171 place count 108 transition count 264
Applied a total of 171 rules in 27 ms. Remains 108 /187 variables (removed 79) and now considering 264/474 (removed 210) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 108/187 places, 264/474 transitions.
[2024-05-31 21:08:15] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:08:15] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:08:15] [INFO ] Input system was already deterministic with 264 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 170 transition count 438
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 170 transition count 438
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 45 place count 170 transition count 426
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 53 place count 162 transition count 406
Iterating global reduction 2 with 8 rules applied. Total rules applied 61 place count 162 transition count 406
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 156 transition count 390
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 156 transition count 390
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 150 transition count 370
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 150 transition count 370
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 144 transition count 350
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 144 transition count 350
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 138 transition count 330
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 138 transition count 330
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 115 place count 132 transition count 314
Iterating global reduction 2 with 6 rules applied. Total rules applied 121 place count 132 transition count 314
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 127 place count 126 transition count 302
Iterating global reduction 2 with 6 rules applied. Total rules applied 133 place count 126 transition count 302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 139 place count 120 transition count 290
Iterating global reduction 2 with 6 rules applied. Total rules applied 145 place count 120 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 150 place count 115 transition count 280
Iterating global reduction 2 with 5 rules applied. Total rules applied 155 place count 115 transition count 280
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 159 place count 111 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 163 place count 111 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 165 place count 109 transition count 268
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 109 transition count 268
Applied a total of 167 rules in 24 ms. Remains 109 /187 variables (removed 78) and now considering 268/474 (removed 206) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 109/187 places, 268/474 transitions.
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:08:16] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 171 transition count 440
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 171 transition count 440
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 39 place count 171 transition count 432
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 46 place count 164 transition count 412
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 164 transition count 412
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 158 transition count 398
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 158 transition count 398
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 69 place count 154 transition count 384
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 154 transition count 384
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 77 place count 150 transition count 372
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 150 transition count 372
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 85 place count 146 transition count 358
Iterating global reduction 2 with 4 rules applied. Total rules applied 89 place count 146 transition count 358
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 93 place count 142 transition count 346
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 142 transition count 346
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 138 transition count 338
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 138 transition count 338
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 134 transition count 330
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 134 transition count 330
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 130 transition count 322
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 130 transition count 322
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 128 transition count 318
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 128 transition count 318
Applied a total of 125 rules in 24 ms. Remains 128 /187 variables (removed 59) and now considering 318/474 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 128/187 places, 318/474 transitions.
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:08:16] [INFO ] Input system was already deterministic with 318 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 174 transition count 444
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 174 transition count 444
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 36 place count 174 transition count 434
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 168 transition count 418
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 168 transition count 418
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 164 transition count 408
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 164 transition count 408
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 161 transition count 398
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 161 transition count 398
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 159 transition count 392
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 159 transition count 392
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 157 transition count 386
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 157 transition count 386
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 155 transition count 380
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 155 transition count 380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 153 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 153 transition count 376
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 151 transition count 372
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 151 transition count 372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 150 transition count 370
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 150 transition count 370
Applied a total of 84 rules in 24 ms. Remains 150 /187 variables (removed 37) and now considering 370/474 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 150/187 places, 370/474 transitions.
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 11 ms
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 12 ms
[2024-05-31 21:08:16] [INFO ] Input system was already deterministic with 370 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Graph (complete) has 999 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 159 transition count 396
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 159 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 152 transition count 378
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 152 transition count 378
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 145 transition count 354
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 145 transition count 354
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 138 transition count 330
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 138 transition count 330
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 118 place count 131 transition count 308
Iterating global reduction 1 with 7 rules applied. Total rules applied 125 place count 131 transition count 308
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 132 place count 124 transition count 290
Iterating global reduction 1 with 7 rules applied. Total rules applied 139 place count 124 transition count 290
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 145 place count 118 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 151 place count 118 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 157 place count 112 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 163 place count 112 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 169 place count 106 transition count 254
Iterating global reduction 1 with 6 rules applied. Total rules applied 175 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 179 place count 102 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 183 place count 102 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 185 place count 100 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 187 place count 100 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 189 place count 100 transition count 240
Applied a total of 189 rules in 43 ms. Remains 100 /187 variables (removed 87) and now considering 240/474 (removed 234) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 100/187 places, 240/474 transitions.
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:08:16] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Graph (complete) has 999 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 159 transition count 396
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 159 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 152 transition count 378
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 152 transition count 378
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 145 transition count 354
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 145 transition count 354
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 138 transition count 330
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 138 transition count 330
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 118 place count 131 transition count 308
Iterating global reduction 1 with 7 rules applied. Total rules applied 125 place count 131 transition count 308
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 132 place count 124 transition count 290
Iterating global reduction 1 with 7 rules applied. Total rules applied 139 place count 124 transition count 290
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 146 place count 117 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 153 place count 117 transition count 276
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 160 place count 110 transition count 262
Iterating global reduction 1 with 7 rules applied. Total rules applied 167 place count 110 transition count 262
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 174 place count 103 transition count 248
Iterating global reduction 1 with 7 rules applied. Total rules applied 181 place count 103 transition count 248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 185 place count 99 transition count 240
Iterating global reduction 1 with 4 rules applied. Total rules applied 189 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 191 place count 97 transition count 236
Iterating global reduction 1 with 2 rules applied. Total rules applied 193 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 195 place count 97 transition count 234
Applied a total of 195 rules in 39 ms. Remains 97 /187 variables (removed 90) and now considering 234/474 (removed 240) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 97/187 places, 234/474 transitions.
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:08:16] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Graph (complete) has 999 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 170 transition count 440
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 170 transition count 440
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 49 place count 170 transition count 424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 164 transition count 408
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 164 transition count 408
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 159 transition count 394
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 159 transition count 394
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 155 transition count 382
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 155 transition count 382
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 151 transition count 368
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 151 transition count 368
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 91 place count 147 transition count 354
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 147 transition count 354
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 144 transition count 348
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 144 transition count 348
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 141 transition count 342
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 141 transition count 342
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 138 transition count 336
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 138 transition count 336
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 135 transition count 330
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 135 transition count 330
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 133 transition count 326
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 133 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 133 place count 133 transition count 316
Applied a total of 133 rules in 42 ms. Remains 133 /187 variables (removed 54) and now considering 316/474 (removed 158) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 133/187 places, 316/474 transitions.
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 11 ms
[2024-05-31 21:08:16] [INFO ] Input system was already deterministic with 316 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 161 transition count 404
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 161 transition count 404
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 156 transition count 390
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 156 transition count 390
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 80 place count 151 transition count 374
Iterating global reduction 2 with 5 rules applied. Total rules applied 85 place count 151 transition count 374
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 90 place count 146 transition count 358
Iterating global reduction 2 with 5 rules applied. Total rules applied 95 place count 146 transition count 358
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 99 place count 142 transition count 344
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 142 transition count 344
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 107 place count 138 transition count 332
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 138 transition count 332
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 134 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 134 transition count 324
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 130 transition count 316
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 130 transition count 316
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 131 place count 126 transition count 308
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 126 transition count 308
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 123 transition count 302
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 123 transition count 302
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 121 transition count 298
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 121 transition count 298
Applied a total of 145 rules in 27 ms. Remains 121 /187 variables (removed 66) and now considering 298/474 (removed 176) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 121/187 places, 298/474 transitions.
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 17 ms
[2024-05-31 21:08:16] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 169 transition count 438
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 169 transition count 438
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 51 place count 169 transition count 422
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 162 transition count 404
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 162 transition count 404
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 156 transition count 388
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 156 transition count 388
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 151 transition count 372
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 151 transition count 372
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 146 transition count 356
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 146 transition count 356
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 141 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 141 transition count 338
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 136 transition count 324
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 136 transition count 324
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 131 transition count 314
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 131 transition count 314
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 126 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 126 transition count 304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 142 place count 121 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 121 transition count 294
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 150 place count 118 transition count 288
Iterating global reduction 2 with 3 rules applied. Total rules applied 153 place count 118 transition count 288
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 116 transition count 284
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 116 transition count 284
Applied a total of 157 rules in 27 ms. Remains 116 /187 variables (removed 71) and now considering 284/474 (removed 190) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 116/187 places, 284/474 transitions.
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:08:16] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Graph (complete) has 999 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 159 transition count 396
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 159 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 152 transition count 378
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 152 transition count 378
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 145 transition count 354
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 145 transition count 354
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 103 place count 139 transition count 334
Iterating global reduction 1 with 6 rules applied. Total rules applied 109 place count 139 transition count 334
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 115 place count 133 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 121 place count 133 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 127 place count 127 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 133 place count 127 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 139 place count 121 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 145 place count 121 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 151 place count 115 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 157 place count 115 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 163 place count 109 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 169 place count 109 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 173 place count 105 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 105 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 179 place count 103 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 181 place count 103 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 185 place count 103 transition count 246
Applied a total of 185 rules in 69 ms. Remains 103 /187 variables (removed 84) and now considering 246/474 (removed 228) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 103/187 places, 246/474 transitions.
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:08:16] [INFO ] Input system was already deterministic with 246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 474/474 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 474
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 168 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 51 place count 168 transition count 420
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 160 transition count 400
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 160 transition count 400
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 155 transition count 386
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 155 transition count 386
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 150 transition count 370
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 150 transition count 370
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 145 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 145 transition count 354
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 140 transition count 336
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 140 transition count 336
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 135 transition count 322
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 135 transition count 322
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 130 transition count 312
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 130 transition count 312
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 125 transition count 302
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 125 transition count 302
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 142 place count 120 transition count 292
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 120 transition count 292
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 151 place count 116 transition count 284
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 116 transition count 284
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 157 place count 114 transition count 280
Iterating global reduction 2 with 2 rules applied. Total rules applied 159 place count 114 transition count 280
Applied a total of 159 rules in 21 ms. Remains 114 /187 variables (removed 73) and now considering 280/474 (removed 194) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 114/187 places, 280/474 transitions.
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:08:16] [INFO ] Input system was already deterministic with 280 transitions.
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 12 ms
[2024-05-31 21:08:16] [INFO ] Flatten gal took : 12 ms
[2024-05-31 21:08:16] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 21:08:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 187 places, 474 transitions and 1908 arcs took 11 ms.
Total runtime 224617 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 : FunctionPointer-PT-b064-CTLCardinality-2024-00
Could not compute solution for formula : FunctionPointer-PT-b064-CTLCardinality-2024-01
Could not compute solution for formula : FunctionPointer-PT-b064-CTLCardinality-2024-02
Could not compute solution for formula : FunctionPointer-PT-b064-CTLCardinality-2024-03
Could not compute solution for formula : FunctionPointer-PT-b064-CTLCardinality-2024-04
Could not compute solution for formula : FunctionPointer-PT-b064-CTLCardinality-2024-05
Could not compute solution for formula : FunctionPointer-PT-b064-CTLCardinality-2024-06
Could not compute solution for formula : FunctionPointer-PT-b064-CTLCardinality-2024-07
Could not compute solution for formula : FunctionPointer-PT-b064-CTLCardinality-2024-08
Could not compute solution for formula : FunctionPointer-PT-b064-CTLCardinality-2024-09
Could not compute solution for formula : FunctionPointer-PT-b064-CTLCardinality-2024-11
Could not compute solution for formula : FunctionPointer-PT-b064-CTLCardinality-2023-12
Could not compute solution for formula : FunctionPointer-PT-b064-CTLCardinality-2023-14

BK_STOP 1717189697184

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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 FunctionPointer-PT-b064-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/704/ctl_0_
ctl formula name FunctionPointer-PT-b064-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/704/ctl_1_
ctl formula name FunctionPointer-PT-b064-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/704/ctl_2_
ctl formula name FunctionPointer-PT-b064-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/704/ctl_3_
ctl formula name FunctionPointer-PT-b064-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/704/ctl_4_
ctl formula name FunctionPointer-PT-b064-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/704/ctl_5_
ctl formula name FunctionPointer-PT-b064-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/704/ctl_6_
ctl formula name FunctionPointer-PT-b064-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/704/ctl_7_
ctl formula name FunctionPointer-PT-b064-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/704/ctl_8_
ctl formula name FunctionPointer-PT-b064-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/704/ctl_9_
ctl formula name FunctionPointer-PT-b064-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/704/ctl_10_
ctl formula name FunctionPointer-PT-b064-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/704/ctl_11_
ctl formula name FunctionPointer-PT-b064-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/704/ctl_12_
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="FunctionPointer-PT-b064"
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 FunctionPointer-PT-b064, 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 r496-tall-171640603000257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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