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.r464-smll-171620117900130.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 ASLink-PT-08b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117900130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 ASLink-PT-08b-CTLFireability-2024-00
FORMULA_NAME ASLink-PT-08b-CTLFireability-2024-01
FORMULA_NAME ASLink-PT-08b-CTLFireability-2024-02
FORMULA_NAME ASLink-PT-08b-CTLFireability-2024-03
FORMULA_NAME ASLink-PT-08b-CTLFireability-2024-04
FORMULA_NAME ASLink-PT-08b-CTLFireability-2024-05
FORMULA_NAME ASLink-PT-08b-CTLFireability-2024-06
FORMULA_NAME ASLink-PT-08b-CTLFireability-2024-07
FORMULA_NAME ASLink-PT-08b-CTLFireability-2024-08
FORMULA_NAME ASLink-PT-08b-CTLFireability-2024-09
FORMULA_NAME ASLink-PT-08b-CTLFireability-2024-10
FORMULA_NAME ASLink-PT-08b-CTLFireability-2024-11
FORMULA_NAME ASLink-PT-08b-CTLFireability-2023-12
FORMULA_NAME ASLink-PT-08b-CTLFireability-2023-13
FORMULA_NAME ASLink-PT-08b-CTLFireability-2023-14
FORMULA_NAME ASLink-PT-08b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717224827150

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:53:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:53:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:53:50] [INFO ] Load time of PNML (sax parser for PT used): 652 ms
[2024-06-01 06:53:50] [INFO ] Transformed 3618 places.
[2024-06-01 06:53:50] [INFO ] Transformed 4459 transitions.
[2024-06-01 06:53:50] [INFO ] Found NUPN structural information;
[2024-06-01 06:53:50] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 1024 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 194 out of 3618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Discarding 215 places :
Symmetric choice reduction at 0 with 215 rule applications. Total rules 215 place count 3403 transition count 4244
Iterating global reduction 0 with 215 rules applied. Total rules applied 430 place count 3403 transition count 4244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 431 place count 3403 transition count 4243
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 510 place count 3324 transition count 4139
Iterating global reduction 1 with 79 rules applied. Total rules applied 589 place count 3324 transition count 4139
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 615 place count 3324 transition count 4113
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 622 place count 3317 transition count 4106
Iterating global reduction 2 with 7 rules applied. Total rules applied 629 place count 3317 transition count 4106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 632 place count 3314 transition count 4103
Iterating global reduction 2 with 3 rules applied. Total rules applied 635 place count 3314 transition count 4103
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 637 place count 3312 transition count 4101
Iterating global reduction 2 with 2 rules applied. Total rules applied 639 place count 3312 transition count 4101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 641 place count 3310 transition count 4099
Iterating global reduction 2 with 2 rules applied. Total rules applied 643 place count 3310 transition count 4099
Applied a total of 643 rules in 3307 ms. Remains 3310 /3618 variables (removed 308) and now considering 4099/4459 (removed 360) transitions.
// Phase 1: matrix 4099 rows 3310 cols
[2024-06-01 06:53:54] [INFO ] Computed 355 invariants in 193 ms
[2024-06-01 06:53:57] [INFO ] Implicit Places using invariants in 3764 ms returned [3144, 3155, 3166, 3174, 3182, 3190, 3198, 3209, 3217, 3225, 3236]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 3827 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3299/3618 places, 4099/4459 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3287 transition count 4087
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3287 transition count 4087
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 3280 transition count 4080
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 3280 transition count 4080
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 3277 transition count 4077
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 3277 transition count 4077
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 3275 transition count 4075
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 3275 transition count 4075
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 3273 transition count 4073
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 3273 transition count 4073
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 3271 transition count 4071
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 3271 transition count 4071
Applied a total of 56 rules in 2662 ms. Remains 3271 /3299 variables (removed 28) and now considering 4071/4099 (removed 28) transitions.
// Phase 1: matrix 4071 rows 3271 cols
[2024-06-01 06:54:00] [INFO ] Computed 344 invariants in 168 ms
[2024-06-01 06:54:03] [INFO ] Implicit Places using invariants in 2819 ms returned []
[2024-06-01 06:54:03] [INFO ] Invariant cache hit.
[2024-06-01 06:54:17] [INFO ] Implicit Places using invariants and state equation in 13700 ms returned []
Implicit Place search using SMT with State Equation took 16525 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3271/3618 places, 4071/4459 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26355 ms. Remains : 3271/3618 places, 4071/4459 transitions.
Support contains 194 out of 3271 places after structural reductions.
[2024-06-01 06:54:17] [INFO ] Flatten gal took : 405 ms
[2024-06-01 06:54:18] [INFO ] Flatten gal took : 208 ms
[2024-06-01 06:54:18] [INFO ] Input system was already deterministic with 4071 transitions.
Support contains 190 out of 3271 places (down from 194) after GAL structural reductions.
RANDOM walk for 40000 steps (52 resets) in 3067 ms. (13 steps per ms) remains 58/106 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
[2024-06-01 06:54:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 185/296 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 591/887 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/887 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 2275/3162 variables, 245/327 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3162/7342 variables, and 327 constraints, problems are : Problem set: 0 solved, 58 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, Generalized P Invariants (flows): 245/262 constraints, State Equation: 0/3271 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 185/296 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 591/887 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/887 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 2275/3162 variables, 245/327 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 06:54:33] [INFO ] Deduced a trap composed of 136 places in 2989 ms of which 346 ms to minimize.
SMT process timed out in 13201ms, After SMT, problems are : Problem set: 0 solved, 58 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 111 out of 3271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3271/3271 places, 4071/4071 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 566 transitions
Trivial Post-agglo rules discarded 566 transitions
Performed 566 trivial Post agglomeration. Transition count delta: 566
Iterating post reduction 0 with 566 rules applied. Total rules applied 566 place count 3271 transition count 3505
Reduce places removed 566 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 571 rules applied. Total rules applied 1137 place count 2705 transition count 3500
Reduce places removed 3 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 14 rules applied. Total rules applied 1151 place count 2702 transition count 3489
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1162 place count 2691 transition count 3489
Performed 828 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 828 Pre rules applied. Total rules applied 1162 place count 2691 transition count 2661
Deduced a syphon composed of 828 places in 13 ms
Ensure Unique test removed 82 places
Reduce places removed 910 places and 0 transitions.
Iterating global reduction 4 with 1738 rules applied. Total rules applied 2900 place count 1781 transition count 2661
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 4 with 55 rules applied. Total rules applied 2955 place count 1772 transition count 2615
Reduce places removed 46 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 5 with 50 rules applied. Total rules applied 3005 place count 1726 transition count 2611
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 3009 place count 1722 transition count 2611
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 33 Pre rules applied. Total rules applied 3009 place count 1722 transition count 2578
Deduced a syphon composed of 33 places in 14 ms
Ensure Unique test removed 31 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 7 with 97 rules applied. Total rules applied 3106 place count 1658 transition count 2578
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 3107 place count 1657 transition count 2578
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 30 Pre rules applied. Total rules applied 3107 place count 1657 transition count 2548
Deduced a syphon composed of 30 places in 43 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 8 with 60 rules applied. Total rules applied 3167 place count 1627 transition count 2548
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 3176 place count 1618 transition count 2539
Iterating global reduction 8 with 9 rules applied. Total rules applied 3185 place count 1618 transition count 2539
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 3185 place count 1618 transition count 2537
Deduced a syphon composed of 2 places in 26 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3189 place count 1616 transition count 2537
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 3192 place count 1613 transition count 2529
Iterating global reduction 8 with 3 rules applied. Total rules applied 3195 place count 1613 transition count 2529
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3197 place count 1611 transition count 2527
Iterating global reduction 8 with 2 rules applied. Total rules applied 3199 place count 1611 transition count 2527
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3200 place count 1610 transition count 2526
Iterating global reduction 8 with 1 rules applied. Total rules applied 3201 place count 1610 transition count 2526
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3202 place count 1609 transition count 2525
Iterating global reduction 8 with 1 rules applied. Total rules applied 3203 place count 1609 transition count 2525
Performed 248 Post agglomeration using F-continuation condition.Transition count delta: 248
Deduced a syphon composed of 248 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 8 with 497 rules applied. Total rules applied 3700 place count 1360 transition count 2277
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 3704 place count 1356 transition count 2273
Ensure Unique test removed 1 places
Iterating global reduction 8 with 5 rules applied. Total rules applied 3709 place count 1355 transition count 2273
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3711 place count 1353 transition count 2271
Iterating global reduction 8 with 2 rules applied. Total rules applied 3713 place count 1353 transition count 2271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3715 place count 1353 transition count 2269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3716 place count 1352 transition count 2269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3718 place count 1351 transition count 2268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3720 place count 1350 transition count 2273
Free-agglomeration rule applied 11 times.
Iterating global reduction 10 with 11 rules applied. Total rules applied 3731 place count 1350 transition count 2262
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 3742 place count 1339 transition count 2262
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 3749 place count 1339 transition count 2255
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3756 place count 1332 transition count 2255
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 3762 place count 1332 transition count 2255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3763 place count 1331 transition count 2254
Reduce places removed 13 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 18 rules applied. Total rules applied 3781 place count 1318 transition count 2249
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 3786 place count 1313 transition count 2249
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 19 Pre rules applied. Total rules applied 3786 place count 1313 transition count 2230
Deduced a syphon composed of 19 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 14 with 39 rules applied. Total rules applied 3825 place count 1293 transition count 2230
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 3831 place count 1287 transition count 2230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 3831 place count 1287 transition count 2229
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3833 place count 1286 transition count 2229
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 15 with 26 rules applied. Total rules applied 3859 place count 1273 transition count 2216
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 3864 place count 1268 transition count 2211
Iterating global reduction 15 with 5 rules applied. Total rules applied 3869 place count 1268 transition count 2211
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 3870 place count 1267 transition count 2210
Iterating global reduction 15 with 1 rules applied. Total rules applied 3871 place count 1267 transition count 2210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 3872 place count 1267 transition count 2209
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 3876 place count 1267 transition count 2205
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 3880 place count 1263 transition count 2205
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 3881 place count 1263 transition count 2205
Applied a total of 3881 rules in 2597 ms. Remains 1263 /3271 variables (removed 2008) and now considering 2205/4071 (removed 1866) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2598 ms. Remains : 1263/3271 places, 2205/4071 transitions.
RANDOM walk for 40000 steps (308 resets) in 1028 ms. (38 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
Interrupted probabilistic random walk after 105523 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 57
Probabilistic random walk after 105523 steps, saw 24118 distinct states, run finished after 3008 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 2205 rows 1263 cols
[2024-06-01 06:54:39] [INFO ] Computed 199 invariants in 34 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 267/377 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 17/394 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 745/1139 variables, 112/150 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1139 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 32/1171 variables, 16/166 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1171 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 89/1260 variables, 31/197 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1260 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 1/1261 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1261 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 13 (OVERLAPS) 2/1263 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1263 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 15 (OVERLAPS) 2205/3468 variables, 1263/1462 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3468 variables, 0/1462 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 17 (OVERLAPS) 0/3468 variables, 0/1462 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3468/3468 variables, and 1462 constraints, problems are : Problem set: 0 solved, 57 unsolved in 33741 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 144/144 constraints, State Equation: 1263/1263 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 267/377 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 06:55:14] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 17/394 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 745/1139 variables, 112/151 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 4 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 57 places in 207 ms of which 4 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
Problem AtomicPropp29 is UNSAT
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 4 ms to minimize.
Problem AtomicPropp54 is UNSAT
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 3 ms to minimize.
Problem AtomicPropp93 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1139 variables, 10/161 constraints. Problems are: Problem set: 3 solved, 54 unsolved
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1139 variables, 1/162 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1139 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 32/1171 variables, 16/178 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1171 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 89/1260 variables, 31/209 constraints. Problems are: Problem set: 3 solved, 54 unsolved
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 75 places in 1083 ms of which 8 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 80 places in 1139 ms of which 12 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1260 variables, 2/211 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1260 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 15 (OVERLAPS) 1/1261 variables, 1/212 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1261 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 17 (OVERLAPS) 2/1263 variables, 1/213 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1263 variables, 0/213 constraints. Problems are: Problem set: 3 solved, 54 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 19 (OVERLAPS) 2205/3468 variables, 1263/1476 constraints. Problems are: Problem set: 13 solved, 44 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3468/3468 variables, and 1520 constraints, problems are : Problem set: 13 solved, 44 unsolved in 45029 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 144/144 constraints, State Equation: 1263/1263 constraints, PredecessorRefiner: 44/57 constraints, Known Traps: 14/14 constraints]
After SMT, in 78867ms problems are : Problem set: 13 solved, 44 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 84 out of 1263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1263/1263 places, 2205/2205 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1263 transition count 2203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1261 transition count 2203
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 4 place count 1261 transition count 2188
Deduced a syphon composed of 15 places in 6 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 34 place count 1246 transition count 2188
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 1243 transition count 2172
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 1243 transition count 2172
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 1242 transition count 2172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 1241 transition count 2171
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 1241 transition count 2170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 1240 transition count 2170
Applied a total of 45 rules in 261 ms. Remains 1240 /1263 variables (removed 23) and now considering 2170/2205 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 1240/1263 places, 2170/2205 transitions.
RANDOM walk for 40000 steps (326 resets) in 1372 ms. (29 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
Interrupted probabilistic random walk after 108319 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 43
Probabilistic random walk after 108319 steps, saw 26865 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
// Phase 1: matrix 2170 rows 1240 cols
[2024-06-01 06:56:02] [INFO ] Computed 198 invariants in 43 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 258/340 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 16/356 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 761/1117 variables, 110/146 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1117 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 34/1151 variables, 16/162 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1151 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 89/1240 variables, 36/198 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1240 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 2170/3410 variables, 1240/1438 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3410 variables, 0/1438 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 13 (OVERLAPS) 0/3410 variables, 0/1438 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3410/3410 variables, and 1438 constraints, problems are : Problem set: 0 solved, 43 unsolved in 14576 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 146/146 constraints, State Equation: 1240/1240 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 258/340 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 16/356 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 761/1117 variables, 110/146 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:56:19] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:56:19] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 4 ms to minimize.
[2024-06-01 06:56:19] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:56:21] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:56:21] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 3 ms to minimize.
[2024-06-01 06:56:21] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1117 variables, 7/153 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1117 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 34/1151 variables, 16/169 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 89/1240 variables, 36/205 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 95 places in 1296 ms of which 16 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 68 places in 1059 ms of which 12 ms to minimize.
[2024-06-01 06:56:33] [INFO ] Deduced a trap composed of 54 places in 837 ms of which 10 ms to minimize.
[2024-06-01 06:56:33] [INFO ] Deduced a trap composed of 26 places in 253 ms of which 3 ms to minimize.
[2024-06-01 06:56:36] [INFO ] Deduced a trap composed of 84 places in 1382 ms of which 15 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1240 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 06:56:38] [INFO ] Deduced a trap composed of 64 places in 786 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1240 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1240 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp104 is UNSAT
At refinement iteration 14 (OVERLAPS) 2170/3410 variables, 1240/1451 constraints. Problems are: Problem set: 14 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3410 variables, 29/1480 constraints. Problems are: Problem set: 14 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3410/3410 variables, and 1480 constraints, problems are : Problem set: 14 solved, 29 unsolved in 75012 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 146/146 constraints, State Equation: 1240/1240 constraints, PredecessorRefiner: 29/43 constraints, Known Traps: 13/13 constraints]
After SMT, in 89684ms problems are : Problem set: 14 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 1240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1240/1240 places, 2170/2170 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1240 transition count 2168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1238 transition count 2168
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 4 place count 1238 transition count 2150
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 40 place count 1220 transition count 2150
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 1219 transition count 2150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 43 place count 1217 transition count 2141
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 1217 transition count 2141
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 47 place count 1215 transition count 2132
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 1215 transition count 2132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 1214 transition count 2124
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 1214 transition count 2124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 1213 transition count 2116
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 1213 transition count 2116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 1212 transition count 2108
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 1212 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 1211 transition count 2100
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 1211 transition count 2100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 1210 transition count 2092
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 1210 transition count 2092
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 1209 transition count 2084
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 1209 transition count 2084
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 1208 transition count 2076
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 1208 transition count 2076
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 1207 transition count 2068
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 1207 transition count 2068
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 1206 transition count 2060
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 1206 transition count 2060
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 1205 transition count 2052
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 1205 transition count 2052
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 1204 transition count 2044
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 1204 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 1203 transition count 2036
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 1203 transition count 2036
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 1202 transition count 2028
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 1202 transition count 2028
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 1201 transition count 2020
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 1201 transition count 2020
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 82 place count 1198 transition count 2018
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 1197 transition count 2017
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 1197 transition count 2017
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 84 place count 1197 transition count 2016
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 1196 transition count 2016
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 1196 transition count 2015
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 1195 transition count 2015
Applied a total of 88 rules in 950 ms. Remains 1195 /1240 variables (removed 45) and now considering 2015/2170 (removed 155) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 950 ms. Remains : 1195/1240 places, 2015/2170 transitions.
Successfully simplified 27 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-08b-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:57:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 06:57:33] [INFO ] Flatten gal took : 140 ms
FORMULA ASLink-PT-08b-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:57:33] [INFO ] Flatten gal took : 146 ms
[2024-06-01 06:57:33] [INFO ] Input system was already deterministic with 4071 transitions.
Support contains 94 out of 3271 places (down from 114) after GAL structural reductions.
Computed a total of 135 stabilizing places and 135 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 3271/3271 places, 4071/4071 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 3250 transition count 4037
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 3250 transition count 4037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 3250 transition count 4036
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 3241 transition count 4022
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 3241 transition count 4022
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 3237 transition count 4011
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 3237 transition count 4011
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 3234 transition count 4008
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 3234 transition count 4008
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 3231 transition count 3998
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 3231 transition count 3998
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 3228 transition count 3988
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 3228 transition count 3988
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 3225 transition count 3985
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 3225 transition count 3985
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 3223 transition count 3976
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 3223 transition count 3976
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 3221 transition count 3967
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 3221 transition count 3967
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 3219 transition count 3965
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 3219 transition count 3965
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 3218 transition count 3957
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 3218 transition count 3957
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 3217 transition count 3949
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 3217 transition count 3949
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 3216 transition count 3948
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 3216 transition count 3948
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 3215 transition count 3940
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 3215 transition count 3940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 3214 transition count 3932
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 3214 transition count 3932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 3213 transition count 3931
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 3213 transition count 3931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 3212 transition count 3923
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 3212 transition count 3923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 3211 transition count 3915
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 3211 transition count 3915
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 3210 transition count 3914
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 3210 transition count 3914
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 3209 transition count 3906
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 3209 transition count 3906
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 3208 transition count 3898
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 3208 transition count 3898
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 3207 transition count 3897
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 3207 transition count 3897
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 3206 transition count 3889
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 3206 transition count 3889
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 3205 transition count 3881
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 3205 transition count 3881
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 3204 transition count 3880
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 3204 transition count 3880
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 3203 transition count 3872
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 3203 transition count 3872
Applied a total of 137 rules in 9438 ms. Remains 3203 /3271 variables (removed 68) and now considering 3872/4071 (removed 199) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9441 ms. Remains : 3203/3271 places, 3872/4071 transitions.
[2024-06-01 06:57:43] [INFO ] Flatten gal took : 126 ms
[2024-06-01 06:57:43] [INFO ] Flatten gal took : 138 ms
[2024-06-01 06:57:43] [INFO ] Input system was already deterministic with 3872 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3271/3271 places, 4071/4071 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 3251 transition count 4033
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 3251 transition count 4033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 3251 transition count 4032
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 3242 transition count 4018
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 3242 transition count 4018
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 3238 transition count 4007
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 3238 transition count 4007
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 3235 transition count 4004
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 3235 transition count 4004
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 3232 transition count 3994
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 3232 transition count 3994
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 3229 transition count 3984
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 3229 transition count 3984
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 3226 transition count 3981
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 3226 transition count 3981
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 3224 transition count 3972
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 3224 transition count 3972
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 3222 transition count 3963
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 3222 transition count 3963
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 3220 transition count 3961
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 3220 transition count 3961
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 3219 transition count 3953
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 3219 transition count 3953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 3218 transition count 3945
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 3218 transition count 3945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 3217 transition count 3944
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 3217 transition count 3944
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 3216 transition count 3936
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 3216 transition count 3936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 3215 transition count 3928
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 3215 transition count 3928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 3214 transition count 3927
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 3214 transition count 3927
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 3213 transition count 3919
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 3213 transition count 3919
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 3212 transition count 3911
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 3212 transition count 3911
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 3211 transition count 3910
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 3211 transition count 3910
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 3210 transition count 3902
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 3210 transition count 3902
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 3209 transition count 3894
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 3209 transition count 3894
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 3208 transition count 3893
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 3208 transition count 3893
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 3207 transition count 3885
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 3207 transition count 3885
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 3206 transition count 3877
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 3206 transition count 3877
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 3205 transition count 3876
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 3205 transition count 3876
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 3204 transition count 3868
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 3204 transition count 3868
Applied a total of 135 rules in 9989 ms. Remains 3204 /3271 variables (removed 67) and now considering 3868/4071 (removed 203) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9990 ms. Remains : 3204/3271 places, 3868/4071 transitions.
[2024-06-01 06:57:54] [INFO ] Flatten gal took : 112 ms
[2024-06-01 06:57:54] [INFO ] Flatten gal took : 132 ms
[2024-06-01 06:57:54] [INFO ] Input system was already deterministic with 3868 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3271/3271 places, 4071/4071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 603 transitions
Trivial Post-agglo rules discarded 603 transitions
Performed 603 trivial Post agglomeration. Transition count delta: 603
Iterating post reduction 0 with 603 rules applied. Total rules applied 603 place count 3270 transition count 3467
Reduce places removed 603 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 608 rules applied. Total rules applied 1211 place count 2667 transition count 3462
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 1215 place count 2664 transition count 3461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1216 place count 2663 transition count 3461
Performed 875 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 875 Pre rules applied. Total rules applied 1216 place count 2663 transition count 2586
Deduced a syphon composed of 875 places in 8 ms
Ensure Unique test removed 84 places
Reduce places removed 959 places and 0 transitions.
Iterating global reduction 4 with 1834 rules applied. Total rules applied 3050 place count 1704 transition count 2586
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 4 with 62 rules applied. Total rules applied 3112 place count 1695 transition count 2533
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 5 with 53 rules applied. Total rules applied 3165 place count 1642 transition count 2533
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 3165 place count 1642 transition count 2500
Deduced a syphon composed of 33 places in 8 ms
Ensure Unique test removed 32 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 3263 place count 1577 transition count 2500
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 31 Pre rules applied. Total rules applied 3263 place count 1577 transition count 2469
Deduced a syphon composed of 31 places in 7 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 3325 place count 1546 transition count 2469
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 3342 place count 1529 transition count 2434
Iterating global reduction 6 with 17 rules applied. Total rules applied 3359 place count 1529 transition count 2434
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 3359 place count 1529 transition count 2427
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 3373 place count 1522 transition count 2427
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3377 place count 1518 transition count 2418
Iterating global reduction 6 with 4 rules applied. Total rules applied 3381 place count 1518 transition count 2418
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 3383 place count 1516 transition count 2416
Iterating global reduction 6 with 2 rules applied. Total rules applied 3385 place count 1516 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3386 place count 1515 transition count 2415
Iterating global reduction 6 with 1 rules applied. Total rules applied 3387 place count 1515 transition count 2415
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3388 place count 1514 transition count 2414
Iterating global reduction 6 with 1 rules applied. Total rules applied 3389 place count 1514 transition count 2414
Performed 203 Post agglomeration using F-continuation condition.Transition count delta: 203
Deduced a syphon composed of 203 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 205 places and 0 transitions.
Iterating global reduction 6 with 408 rules applied. Total rules applied 3797 place count 1309 transition count 2211
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3801 place count 1305 transition count 2207
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3806 place count 1304 transition count 2207
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 3808 place count 1302 transition count 2205
Iterating global reduction 6 with 2 rules applied. Total rules applied 3810 place count 1302 transition count 2205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 3812 place count 1302 transition count 2203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3813 place count 1301 transition count 2203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3813 place count 1301 transition count 2202
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3815 place count 1300 transition count 2202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3817 place count 1299 transition count 2201
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3819 place count 1297 transition count 2199
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 8 with 24 rules applied. Total rules applied 3843 place count 1281 transition count 2191
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 3851 place count 1273 transition count 2191
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 32 Pre rules applied. Total rules applied 3851 place count 1273 transition count 2159
Deduced a syphon composed of 32 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 65 rules applied. Total rules applied 3916 place count 1240 transition count 2159
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 10 with 17 rules applied. Total rules applied 3933 place count 1223 transition count 2159
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 3933 place count 1223 transition count 2158
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3935 place count 1222 transition count 2158
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 3969 place count 1205 transition count 2141
Discarding 15 places :
Symmetric choice reduction at 11 with 15 rule applications. Total rules 3984 place count 1190 transition count 2126
Iterating global reduction 11 with 15 rules applied. Total rules applied 3999 place count 1190 transition count 2126
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 4006 place count 1183 transition count 2119
Iterating global reduction 11 with 7 rules applied. Total rules applied 4013 place count 1183 transition count 2119
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 4020 place count 1183 transition count 2112
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 7 Pre rules applied. Total rules applied 4020 place count 1183 transition count 2105
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 14 rules applied. Total rules applied 4034 place count 1176 transition count 2105
Applied a total of 4034 rules in 1550 ms. Remains 1176 /3271 variables (removed 2095) and now considering 2105/4071 (removed 1966) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1552 ms. Remains : 1176/3271 places, 2105/4071 transitions.
[2024-06-01 06:57:56] [INFO ] Flatten gal took : 69 ms
[2024-06-01 06:57:56] [INFO ] Flatten gal took : 85 ms
[2024-06-01 06:57:56] [INFO ] Input system was already deterministic with 2105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3271/3271 places, 4071/4071 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 3250 transition count 4032
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 3250 transition count 4032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 3250 transition count 4031
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 3240 transition count 4016
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 3240 transition count 4016
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 3236 transition count 4005
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 3236 transition count 4005
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 3233 transition count 4002
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 3233 transition count 4002
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 3230 transition count 3992
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 3230 transition count 3992
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 3227 transition count 3982
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 3227 transition count 3982
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 3224 transition count 3979
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 3224 transition count 3979
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 3222 transition count 3970
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 3222 transition count 3970
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 3220 transition count 3961
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 3220 transition count 3961
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 3218 transition count 3959
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 3218 transition count 3959
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 3217 transition count 3951
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 3217 transition count 3951
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 3216 transition count 3943
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 3216 transition count 3943
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 3215 transition count 3942
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 3215 transition count 3942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 3214 transition count 3934
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 3214 transition count 3934
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 3213 transition count 3926
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 3213 transition count 3926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 3212 transition count 3925
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 3212 transition count 3925
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 3211 transition count 3917
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 3211 transition count 3917
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 3210 transition count 3909
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 3210 transition count 3909
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 3209 transition count 3908
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 3209 transition count 3908
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 3208 transition count 3900
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 3208 transition count 3900
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 3207 transition count 3892
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 3207 transition count 3892
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 3206 transition count 3891
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 3206 transition count 3891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 3205 transition count 3883
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 3205 transition count 3883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 3204 transition count 3875
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 3204 transition count 3875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 3203 transition count 3874
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 3203 transition count 3874
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 3202 transition count 3866
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 3202 transition count 3866
Applied a total of 139 rules in 10341 ms. Remains 3202 /3271 variables (removed 69) and now considering 3866/4071 (removed 205) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10343 ms. Remains : 3202/3271 places, 3866/4071 transitions.
[2024-06-01 06:58:06] [INFO ] Flatten gal took : 101 ms
[2024-06-01 06:58:06] [INFO ] Flatten gal took : 124 ms
[2024-06-01 06:58:07] [INFO ] Input system was already deterministic with 3866 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3271/3271 places, 4071/4071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 604 transitions
Trivial Post-agglo rules discarded 604 transitions
Performed 604 trivial Post agglomeration. Transition count delta: 604
Iterating post reduction 0 with 604 rules applied. Total rules applied 604 place count 3270 transition count 3466
Reduce places removed 604 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 609 rules applied. Total rules applied 1213 place count 2666 transition count 3461
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1216 place count 2663 transition count 3461
Performed 875 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 875 Pre rules applied. Total rules applied 1216 place count 2663 transition count 2586
Deduced a syphon composed of 875 places in 13 ms
Ensure Unique test removed 84 places
Reduce places removed 959 places and 0 transitions.
Iterating global reduction 3 with 1834 rules applied. Total rules applied 3050 place count 1704 transition count 2586
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3110 place count 1696 transition count 2534
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3162 place count 1644 transition count 2534
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3162 place count 1644 transition count 2501
Deduced a syphon composed of 33 places in 12 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 3261 place count 1578 transition count 2501
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3261 place count 1578 transition count 2469
Deduced a syphon composed of 32 places in 12 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3325 place count 1546 transition count 2469
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 3344 place count 1527 transition count 2432
Iterating global reduction 5 with 19 rules applied. Total rules applied 3363 place count 1527 transition count 2432
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 3363 place count 1527 transition count 2424
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 3379 place count 1519 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 3385 place count 1513 transition count 2406
Iterating global reduction 5 with 6 rules applied. Total rules applied 3391 place count 1513 transition count 2406
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 3394 place count 1510 transition count 2396
Iterating global reduction 5 with 3 rules applied. Total rules applied 3397 place count 1510 transition count 2396
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3399 place count 1508 transition count 2387
Iterating global reduction 5 with 2 rules applied. Total rules applied 3401 place count 1508 transition count 2387
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3403 place count 1506 transition count 2378
Iterating global reduction 5 with 2 rules applied. Total rules applied 3405 place count 1506 transition count 2378
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3406 place count 1505 transition count 2370
Iterating global reduction 5 with 1 rules applied. Total rules applied 3407 place count 1505 transition count 2370
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3408 place count 1504 transition count 2362
Iterating global reduction 5 with 1 rules applied. Total rules applied 3409 place count 1504 transition count 2362
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3410 place count 1503 transition count 2354
Iterating global reduction 5 with 1 rules applied. Total rules applied 3411 place count 1503 transition count 2354
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3412 place count 1502 transition count 2346
Iterating global reduction 5 with 1 rules applied. Total rules applied 3413 place count 1502 transition count 2346
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3414 place count 1501 transition count 2338
Iterating global reduction 5 with 1 rules applied. Total rules applied 3415 place count 1501 transition count 2338
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3416 place count 1500 transition count 2330
Iterating global reduction 5 with 1 rules applied. Total rules applied 3417 place count 1500 transition count 2330
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3418 place count 1499 transition count 2322
Iterating global reduction 5 with 1 rules applied. Total rules applied 3419 place count 1499 transition count 2322
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3420 place count 1498 transition count 2314
Iterating global reduction 5 with 1 rules applied. Total rules applied 3421 place count 1498 transition count 2314
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3422 place count 1497 transition count 2306
Iterating global reduction 5 with 1 rules applied. Total rules applied 3423 place count 1497 transition count 2306
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3424 place count 1496 transition count 2298
Iterating global reduction 5 with 1 rules applied. Total rules applied 3425 place count 1496 transition count 2298
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3426 place count 1495 transition count 2290
Iterating global reduction 5 with 1 rules applied. Total rules applied 3427 place count 1495 transition count 2290
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3428 place count 1494 transition count 2282
Iterating global reduction 5 with 1 rules applied. Total rules applied 3429 place count 1494 transition count 2282
Performed 206 Post agglomeration using F-continuation condition.Transition count delta: 206
Deduced a syphon composed of 206 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 5 with 414 rules applied. Total rules applied 3843 place count 1286 transition count 2076
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3847 place count 1282 transition count 2072
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3852 place count 1281 transition count 2072
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 3853 place count 1281 transition count 2071
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3854 place count 1280 transition count 2071
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3854 place count 1280 transition count 2070
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3856 place count 1279 transition count 2070
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3858 place count 1277 transition count 2068
Iterating global reduction 7 with 2 rules applied. Total rules applied 3860 place count 1277 transition count 2068
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 3862 place count 1277 transition count 2066
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3863 place count 1276 transition count 2066
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 3863 place count 1276 transition count 2065
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3865 place count 1275 transition count 2065
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3867 place count 1273 transition count 2063
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 9 with 24 rules applied. Total rules applied 3891 place count 1257 transition count 2055
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3899 place count 1249 transition count 2055
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 32 Pre rules applied. Total rules applied 3899 place count 1249 transition count 2023
Deduced a syphon composed of 32 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 11 with 65 rules applied. Total rules applied 3964 place count 1216 transition count 2023
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 3981 place count 1199 transition count 2023
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3981 place count 1199 transition count 2022
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3983 place count 1198 transition count 2022
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 7 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 4017 place count 1181 transition count 2005
Discarding 16 places :
Symmetric choice reduction at 12 with 16 rule applications. Total rules 4033 place count 1165 transition count 1989
Iterating global reduction 12 with 16 rules applied. Total rules applied 4049 place count 1165 transition count 1989
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4057 place count 1157 transition count 1981
Iterating global reduction 12 with 8 rules applied. Total rules applied 4065 place count 1157 transition count 1981
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 12 with 8 rules applied. Total rules applied 4073 place count 1157 transition count 1973
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 8 Pre rules applied. Total rules applied 4073 place count 1157 transition count 1965
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 12 with 16 rules applied. Total rules applied 4089 place count 1149 transition count 1965
Applied a total of 4089 rules in 2874 ms. Remains 1149 /3271 variables (removed 2122) and now considering 1965/4071 (removed 2106) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2875 ms. Remains : 1149/3271 places, 1965/4071 transitions.
[2024-06-01 06:58:10] [INFO ] Flatten gal took : 104 ms
[2024-06-01 06:58:10] [INFO ] Flatten gal took : 95 ms
[2024-06-01 06:58:10] [INFO ] Input system was already deterministic with 1965 transitions.
RANDOM walk for 35380 steps (286 resets) in 333 ms. (105 steps per ms) remains 0/1 properties
FORMULA ASLink-PT-08b-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 3271/3271 places, 4071/4071 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 3250 transition count 4032
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 3250 transition count 4032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 3250 transition count 4031
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 3240 transition count 4016
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 3240 transition count 4016
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 3236 transition count 4005
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 3236 transition count 4005
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 3233 transition count 4002
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 3233 transition count 4002
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 3230 transition count 3992
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 3230 transition count 3992
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 3227 transition count 3982
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 3227 transition count 3982
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 3224 transition count 3979
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 3224 transition count 3979
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 3222 transition count 3970
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 3222 transition count 3970
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 3220 transition count 3961
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 3220 transition count 3961
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 3218 transition count 3959
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 3218 transition count 3959
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 3217 transition count 3951
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 3217 transition count 3951
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 3216 transition count 3943
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 3216 transition count 3943
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 3215 transition count 3942
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 3215 transition count 3942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 3214 transition count 3934
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 3214 transition count 3934
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 3213 transition count 3926
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 3213 transition count 3926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 3212 transition count 3925
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 3212 transition count 3925
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 3211 transition count 3917
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 3211 transition count 3917
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 3210 transition count 3909
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 3210 transition count 3909
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 3209 transition count 3908
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 3209 transition count 3908
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 3208 transition count 3900
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 3208 transition count 3900
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 3207 transition count 3892
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 3207 transition count 3892
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 3206 transition count 3891
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 3206 transition count 3891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 3205 transition count 3883
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 3205 transition count 3883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 3204 transition count 3875
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 3204 transition count 3875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 3203 transition count 3874
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 3203 transition count 3874
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 3202 transition count 3866
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 3202 transition count 3866
Applied a total of 139 rules in 9243 ms. Remains 3202 /3271 variables (removed 69) and now considering 3866/4071 (removed 205) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9244 ms. Remains : 3202/3271 places, 3866/4071 transitions.
[2024-06-01 06:58:19] [INFO ] Flatten gal took : 102 ms
[2024-06-01 06:58:19] [INFO ] Flatten gal took : 121 ms
[2024-06-01 06:58:20] [INFO ] Input system was already deterministic with 3866 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3271/3271 places, 4071/4071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 607 transitions
Trivial Post-agglo rules discarded 607 transitions
Performed 607 trivial Post agglomeration. Transition count delta: 607
Iterating post reduction 0 with 607 rules applied. Total rules applied 607 place count 3270 transition count 3463
Reduce places removed 607 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 612 rules applied. Total rules applied 1219 place count 2663 transition count 3458
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1222 place count 2660 transition count 3458
Performed 875 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 875 Pre rules applied. Total rules applied 1222 place count 2660 transition count 2583
Deduced a syphon composed of 875 places in 8 ms
Ensure Unique test removed 83 places
Reduce places removed 958 places and 0 transitions.
Iterating global reduction 3 with 1833 rules applied. Total rules applied 3055 place count 1702 transition count 2583
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 3 with 60 rules applied. Total rules applied 3115 place count 1693 transition count 2532
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 52 rules applied. Total rules applied 3167 place count 1642 transition count 2531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3168 place count 1641 transition count 2531
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 3168 place count 1641 transition count 2498
Deduced a syphon composed of 33 places in 7 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 99 rules applied. Total rules applied 3267 place count 1575 transition count 2498
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3267 place count 1575 transition count 2466
Deduced a syphon composed of 32 places in 7 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 3331 place count 1543 transition count 2466
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 3350 place count 1524 transition count 2429
Iterating global reduction 6 with 19 rules applied. Total rules applied 3369 place count 1524 transition count 2429
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 3369 place count 1524 transition count 2421
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 3385 place count 1516 transition count 2421
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 3391 place count 1510 transition count 2403
Iterating global reduction 6 with 6 rules applied. Total rules applied 3397 place count 1510 transition count 2403
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 3400 place count 1507 transition count 2393
Iterating global reduction 6 with 3 rules applied. Total rules applied 3403 place count 1507 transition count 2393
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 3405 place count 1505 transition count 2384
Iterating global reduction 6 with 2 rules applied. Total rules applied 3407 place count 1505 transition count 2384
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 3409 place count 1503 transition count 2375
Iterating global reduction 6 with 2 rules applied. Total rules applied 3411 place count 1503 transition count 2375
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3412 place count 1502 transition count 2367
Iterating global reduction 6 with 1 rules applied. Total rules applied 3413 place count 1502 transition count 2367
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3414 place count 1501 transition count 2359
Iterating global reduction 6 with 1 rules applied. Total rules applied 3415 place count 1501 transition count 2359
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3416 place count 1500 transition count 2351
Iterating global reduction 6 with 1 rules applied. Total rules applied 3417 place count 1500 transition count 2351
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3418 place count 1499 transition count 2343
Iterating global reduction 6 with 1 rules applied. Total rules applied 3419 place count 1499 transition count 2343
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3420 place count 1498 transition count 2335
Iterating global reduction 6 with 1 rules applied. Total rules applied 3421 place count 1498 transition count 2335
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3422 place count 1497 transition count 2327
Iterating global reduction 6 with 1 rules applied. Total rules applied 3423 place count 1497 transition count 2327
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3424 place count 1496 transition count 2319
Iterating global reduction 6 with 1 rules applied. Total rules applied 3425 place count 1496 transition count 2319
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3426 place count 1495 transition count 2311
Iterating global reduction 6 with 1 rules applied. Total rules applied 3427 place count 1495 transition count 2311
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3428 place count 1494 transition count 2303
Iterating global reduction 6 with 1 rules applied. Total rules applied 3429 place count 1494 transition count 2303
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3430 place count 1493 transition count 2295
Iterating global reduction 6 with 1 rules applied. Total rules applied 3431 place count 1493 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3432 place count 1492 transition count 2287
Iterating global reduction 6 with 1 rules applied. Total rules applied 3433 place count 1492 transition count 2287
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3434 place count 1491 transition count 2279
Iterating global reduction 6 with 1 rules applied. Total rules applied 3435 place count 1491 transition count 2279
Performed 206 Post agglomeration using F-continuation condition.Transition count delta: 206
Deduced a syphon composed of 206 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 6 with 414 rules applied. Total rules applied 3849 place count 1283 transition count 2073
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3853 place count 1279 transition count 2069
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3858 place count 1278 transition count 2069
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 3859 place count 1278 transition count 2068
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3860 place count 1277 transition count 2068
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3860 place count 1277 transition count 2067
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3862 place count 1276 transition count 2067
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3864 place count 1274 transition count 2065
Iterating global reduction 8 with 2 rules applied. Total rules applied 3866 place count 1274 transition count 2065
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3868 place count 1274 transition count 2063
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3869 place count 1273 transition count 2063
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 3869 place count 1273 transition count 2062
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3871 place count 1272 transition count 2062
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3873 place count 1270 transition count 2060
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 24 rules applied. Total rules applied 3897 place count 1254 transition count 2052
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 3905 place count 1246 transition count 2052
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 32 Pre rules applied. Total rules applied 3905 place count 1246 transition count 2020
Deduced a syphon composed of 32 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 65 rules applied. Total rules applied 3970 place count 1213 transition count 2020
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 12 with 17 rules applied. Total rules applied 3987 place count 1196 transition count 2020
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3987 place count 1196 transition count 2019
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3989 place count 1195 transition count 2019
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 13 with 34 rules applied. Total rules applied 4023 place count 1178 transition count 2002
Discarding 16 places :
Symmetric choice reduction at 13 with 16 rule applications. Total rules 4039 place count 1162 transition count 1986
Iterating global reduction 13 with 16 rules applied. Total rules applied 4055 place count 1162 transition count 1986
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 4063 place count 1154 transition count 1978
Iterating global reduction 13 with 8 rules applied. Total rules applied 4071 place count 1154 transition count 1978
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 13 with 8 rules applied. Total rules applied 4079 place count 1154 transition count 1970
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 8 Pre rules applied. Total rules applied 4079 place count 1154 transition count 1962
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 13 with 16 rules applied. Total rules applied 4095 place count 1146 transition count 1962
Applied a total of 4095 rules in 2045 ms. Remains 1146 /3271 variables (removed 2125) and now considering 1962/4071 (removed 2109) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2045 ms. Remains : 1146/3271 places, 1962/4071 transitions.
[2024-06-01 06:58:22] [INFO ] Flatten gal took : 57 ms
[2024-06-01 06:58:22] [INFO ] Flatten gal took : 66 ms
[2024-06-01 06:58:22] [INFO ] Input system was already deterministic with 1962 transitions.
RANDOM walk for 40000 steps (325 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (48 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 172055 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 1
Probabilistic random walk after 172055 steps, saw 115923 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 1962 rows 1146 cols
[2024-06-01 06:58:25] [INFO ] Computed 182 invariants in 33 ms
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) 26/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/29 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 117/146 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/182 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/185 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 260/445 variables, 42/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 43/488 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/491 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 325/816 variables, 47/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/816 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/878 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/878 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/881 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/881 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 187/1068 variables, 28/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1068 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 34/1102 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1102 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 42/1144 variables, 10/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1144 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/1145 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1145 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1/1146 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1146 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1962/3108 variables, 1146/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3108 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/3108 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3108/3108 variables, and 1328 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2038 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 139/139 constraints, State Equation: 1146/1146 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) 26/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/29 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 117/146 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/182 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/185 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 260/445 variables, 42/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 43/488 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/491 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 325/816 variables, 47/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/816 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/878 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/878 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/881 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/881 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 187/1068 variables, 28/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1068 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 34/1102 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1102 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 42/1144 variables, 10/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1144 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/1145 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1145 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1/1146 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1146 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1962/3108 variables, 1146/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3108 variables, 1/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3108 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/3108 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3108/3108 variables, and 1329 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1801 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 139/139 constraints, State Equation: 1146/1146 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3889ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 1146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1146/1146 places, 1962/1962 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 1108 transition count 1924
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 1107 transition count 1929
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 95 place count 1107 transition count 1912
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 112 place count 1090 transition count 1912
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 119 place count 1090 transition count 1905
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 126 place count 1083 transition count 1905
Applied a total of 126 rules in 249 ms. Remains 1083 /1146 variables (removed 63) and now considering 1905/1962 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 1083/1146 places, 1905/1962 transitions.
RANDOM walk for 4000000 steps (41589 resets) in 19428 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (5108 resets) in 7277 ms. (549 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1254168 steps, run timeout after 18001 ms. (steps per millisecond=69 ) properties seen :0 out of 1
Probabilistic random walk after 1254168 steps, saw 239088 distinct states, run finished after 18001 ms. (steps per millisecond=69 ) properties seen :0
// Phase 1: matrix 1905 rows 1083 cols
[2024-06-01 06:58:54] [INFO ] Computed 182 invariants in 28 ms
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) 23/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 99/125 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/158 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/161 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/333 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 36/369 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/372 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 197/569 variables, 27/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/569 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/605 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/605 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/608 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 214/822 variables, 28/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/822 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 53/875 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/875 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/877 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/877 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 167/1044 variables, 30/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1044 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 3/1047 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1047 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 34/1081 variables, 11/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1081 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/1083 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1083 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1905/2988 variables, 1083/1265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 58 places in 362 ms of which 8 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/2988 variables, 1/1266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2988 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 0/2988 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2988/2988 variables, and 1266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2873 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 127/127 constraints, State Equation: 1083/1083 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 23/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 99/125 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/158 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/161 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/333 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 36/369 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/372 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 197/569 variables, 27/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/569 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/605 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/605 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/608 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 214/822 variables, 28/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/822 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 53/875 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/875 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/877 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/877 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 167/1044 variables, 30/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1044 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1044 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 3/1047 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1047 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 34/1081 variables, 11/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1081 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 2/1083 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1083 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 1905/2988 variables, 1083/1266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2988 variables, 1/1267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2988 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/2988 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2988/2988 variables, and 1267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1958 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 127/127 constraints, State Equation: 1083/1083 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 4873ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 1905/1905 transitions.
Applied a total of 0 rules in 55 ms. Remains 1083 /1083 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1083/1083 places, 1905/1905 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 1905/1905 transitions.
Applied a total of 0 rules in 80 ms. Remains 1083 /1083 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
[2024-06-01 06:58:59] [INFO ] Invariant cache hit.
[2024-06-01 06:59:01] [INFO ] Implicit Places using invariants in 1773 ms returned [1, 18, 19, 31, 48, 66, 86, 135, 144, 145, 147, 164, 182, 201, 251, 252, 263, 264, 266, 283, 301, 321, 370, 371, 382, 383, 385, 402, 420, 440, 489, 490, 501, 502, 504, 521, 539, 559, 608, 609, 620, 622, 624, 641, 659, 679, 728, 729, 740, 741, 743, 760, 778, 797, 847, 848, 859, 860, 862, 879, 897, 917, 966, 967, 970, 981, 982, 983, 1001, 1022, 1023, 1024, 1025]
[2024-06-01 06:59:01] [INFO ] Actually due to overlaps returned [1001, 983, 48, 164, 283, 402, 521, 641, 760, 879, 31, 144, 147, 263, 266, 382, 385, 501, 504, 620, 624, 740, 743, 859, 862, 981, 1022, 145, 264, 383, 502, 622, 741, 860, 982, 1023, 1, 18, 251, 252, 370, 371, 489, 490, 608, 609, 728, 729, 847, 848, 966, 967, 1024, 19, 66, 86, 182, 201, 301, 321, 420, 440, 539, 559, 659, 679, 778, 797, 897, 917, 970, 1025]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 1776 ms to find 72 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1011/1083 places, 1905/1905 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 1011 transition count 1781
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 255 place count 887 transition count 1774
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 255 place count 887 transition count 1735
Deduced a syphon composed of 39 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 334 place count 847 transition count 1735
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 346 place count 843 transition count 1727
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 354 place count 835 transition count 1727
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 357 place count 832 transition count 1724
Iterating global reduction 4 with 3 rules applied. Total rules applied 360 place count 832 transition count 1724
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 363 place count 832 transition count 1721
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 3 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 487 place count 770 transition count 1659
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 491 place count 768 transition count 1660
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 516 place count 768 transition count 1635
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 542 place count 742 transition count 1635
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 543 place count 742 transition count 1634
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 567 place count 742 transition count 1634
Applied a total of 567 rules in 363 ms. Remains 742 /1011 variables (removed 269) and now considering 1634/1905 (removed 271) transitions.
// Phase 1: matrix 1634 rows 742 cols
[2024-06-01 06:59:01] [INFO ] Computed 104 invariants in 31 ms
[2024-06-01 06:59:03] [INFO ] Implicit Places using invariants in 1779 ms returned [86, 92, 95, 97, 98, 101, 102, 168, 174, 177, 179, 184, 185, 251, 257, 260, 262, 267, 268, 334, 340, 343, 345, 350, 351, 417, 423, 426, 428, 433, 434, 501, 507, 510, 512, 517, 518, 584, 590, 593, 595, 600, 601, 667, 673, 676, 678]
[2024-06-01 06:59:03] [INFO ] Actually due to overlaps returned [101, 184, 267, 350, 433, 517, 600, 102, 185, 268, 351, 434, 518, 601, 86, 92, 97, 168, 174, 179, 251, 257, 262, 334, 340, 345, 417, 423, 428, 501, 507, 512, 584, 590, 595, 667, 673, 678, 98]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 1783 ms to find 39 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 703/1083 places, 1634/1905 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 671 transition count 1602
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 671 transition count 1602
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 72 place count 663 transition count 1594
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 663 transition count 1594
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 655 transition count 1586
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 120 place count 655 transition count 1562
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 144 place count 631 transition count 1562
Applied a total of 144 rules in 224 ms. Remains 631 /703 variables (removed 72) and now considering 1562/1634 (removed 72) transitions.
// Phase 1: matrix 1562 rows 631 cols
[2024-06-01 06:59:03] [INFO ] Computed 65 invariants in 26 ms
[2024-06-01 06:59:05] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2024-06-01 06:59:05] [INFO ] Invariant cache hit.
[2024-06-01 06:59:08] [INFO ] Implicit Places using invariants and state equation in 3385 ms returned []
Implicit Place search using SMT with State Equation took 4550 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 631/1083 places, 1562/1905 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8776 ms. Remains : 631/1083 places, 1562/1905 transitions.
RANDOM walk for 4000000 steps (67600 resets) in 14594 ms. (274 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (11303 resets) in 5323 ms. (751 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1708383 steps, run timeout after 15001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 1708383 steps, saw 300221 distinct states, run finished after 15001 ms. (steps per millisecond=113 ) properties seen :0
[2024-06-01 06:59:28] [INFO ] Invariant cache hit.
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) 77/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/83 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/313 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/321 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 212/533 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/577 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 54/631 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1251 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 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) 77/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/83 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/313 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/321 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 212/533 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/577 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 54/631 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2193 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1425 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2694ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 49 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 631/631 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 29 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2024-06-01 06:59:31] [INFO ] Invariant cache hit.
[2024-06-01 06:59:32] [INFO ] Implicit Places using invariants in 1287 ms returned []
[2024-06-01 06:59:32] [INFO ] Invariant cache hit.
[2024-06-01 06:59:36] [INFO ] Implicit Places using invariants and state equation in 3471 ms returned []
Implicit Place search using SMT with State Equation took 4762 ms to find 0 implicit places.
[2024-06-01 06:59:36] [INFO ] Redundant transitions in 208 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:59:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 0/0 constraints]
After SMT, in 61452ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61494ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66513 ms. Remains : 631/631 places, 1562/1562 transitions.
RANDOM walk for 400000 steps (6683 resets) in 3707 ms. (107 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-06-01 07:00:38] [INFO ] Invariant cache hit.
[2024-06-01 07:00:39] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 07:00:39] [INFO ] [Real]Absence check using 12 positive and 53 generalized place invariants in 33 ms returned sat
[2024-06-01 07:00:39] [INFO ] After 729ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:00:39] [INFO ] After 852ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:00:39] [INFO ] After 1021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:00:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 07:00:40] [INFO ] [Nat]Absence check using 12 positive and 53 generalized place invariants in 33 ms returned sat
[2024-06-01 07:00:40] [INFO ] After 714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:00:40] [INFO ] After 800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:00:40] [INFO ] After 944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (67744 resets) in 17777 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (11197 resets) in 4695 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1800315 steps, run timeout after 15001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 1800315 steps, saw 315646 distinct states, run finished after 15004 ms. (steps per millisecond=119 ) properties seen :0
[2024-06-01 07:01:01] [INFO ] Invariant cache hit.
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) 77/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/83 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/313 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/321 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 212/533 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/577 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 54/631 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 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) 77/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/83 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/313 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/321 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 212/533 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/577 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 54/631 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2193 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1198 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2192ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 31 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 631/631 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 32 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2024-06-01 07:01:04] [INFO ] Invariant cache hit.
[2024-06-01 07:01:04] [INFO ] Implicit Places using invariants in 891 ms returned []
[2024-06-01 07:01:05] [INFO ] Invariant cache hit.
[2024-06-01 07:01:07] [INFO ] Implicit Places using invariants and state equation in 2152 ms returned []
Implicit Place search using SMT with State Equation took 3049 ms to find 0 implicit places.
[2024-06-01 07:01:07] [INFO ] Redundant transitions in 47 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:01:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 0/0 constraints]
After SMT, in 60964ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 60982ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64121 ms. Remains : 631/631 places, 1562/1562 transitions.
RANDOM walk for 400000 steps (6712 resets) in 1905 ms. (209 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-06-01 07:02:08] [INFO ] Invariant cache hit.
[2024-06-01 07:02:08] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 07:02:09] [INFO ] [Real]Absence check using 12 positive and 53 generalized place invariants in 52 ms returned sat
[2024-06-01 07:02:10] [INFO ] After 1049ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:02:10] [INFO ] After 1194ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:02:10] [INFO ] After 1426ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:02:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 07:02:10] [INFO ] [Nat]Absence check using 12 positive and 53 generalized place invariants in 34 ms returned sat
[2024-06-01 07:02:11] [INFO ] After 631ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:02:11] [INFO ] After 748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:02:11] [INFO ] After 924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (694 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (108 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 254428 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 254428 steps, saw 56709 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-06-01 07:02:14] [INFO ] Invariant cache hit.
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) 77/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/83 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/313 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/321 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 212/533 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/577 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 54/631 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 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) 77/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/83 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/313 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/321 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 212/533 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/577 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 54/631 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2193 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1116 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2171ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 29 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 631/631 places, 1562/1562 transitions.
RANDOM walk for 40000 steps (691 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (107 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 271113 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 271113 steps, saw 59791 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2024-06-01 07:02:19] [INFO ] Invariant cache hit.
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) 77/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/83 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/313 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/321 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 212/533 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/577 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 54/631 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1229 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 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) 77/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/83 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/313 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/321 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 212/533 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/577 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 54/631 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2193 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1116 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2354ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 30 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 631/631 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 30 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2024-06-01 07:02:21] [INFO ] Invariant cache hit.
[2024-06-01 07:02:23] [INFO ] Implicit Places using invariants in 1163 ms returned []
[2024-06-01 07:02:23] [INFO ] Invariant cache hit.
[2024-06-01 07:02:25] [INFO ] Implicit Places using invariants and state equation in 2354 ms returned []
Implicit Place search using SMT with State Equation took 3526 ms to find 0 implicit places.
[2024-06-01 07:02:25] [INFO ] Redundant transitions in 28 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:02:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 0/0 constraints]
After SMT, in 61000ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61017ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64611 ms. Remains : 631/631 places, 1562/1562 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 48 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 07:03:26] [INFO ] Invariant cache hit.
[2024-06-01 07:03:26] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 07:03:26] [INFO ] [Real]Absence check using 12 positive and 53 generalized place invariants in 53 ms returned sat
[2024-06-01 07:03:27] [INFO ] After 1254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:03:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 07:03:28] [INFO ] [Nat]Absence check using 12 positive and 53 generalized place invariants in 46 ms returned sat
[2024-06-01 07:03:28] [INFO ] After 685ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:03:28] [INFO ] After 831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:03:29] [INFO ] After 1124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2451 ms.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 47 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 07:03:29] [INFO ] Invariant cache hit.
[2024-06-01 07:03:29] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 07:03:29] [INFO ] [Real]Absence check using 12 positive and 53 generalized place invariants in 50 ms returned sat
[2024-06-01 07:03:30] [INFO ] After 1213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:03:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 07:03:30] [INFO ] [Nat]Absence check using 12 positive and 53 generalized place invariants in 50 ms returned sat
[2024-06-01 07:03:31] [INFO ] After 740ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:03:31] [INFO ] After 837ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:03:31] [INFO ] After 1122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2402 ms.
Starting structural reductions in LTL mode, iteration 0 : 3271/3271 places, 4071/4071 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 3249 transition count 4031
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 3249 transition count 4031
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 3249 transition count 4030
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 3239 transition count 4015
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 3239 transition count 4015
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 3235 transition count 4004
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 3235 transition count 4004
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 3232 transition count 4001
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 3232 transition count 4001
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 3229 transition count 3991
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 3229 transition count 3991
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 3226 transition count 3981
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 3226 transition count 3981
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 3223 transition count 3978
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 3223 transition count 3978
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 3221 transition count 3969
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 3221 transition count 3969
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 3219 transition count 3960
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 3219 transition count 3960
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 3217 transition count 3958
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 3217 transition count 3958
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 3216 transition count 3950
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 3216 transition count 3950
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 3215 transition count 3942
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 3215 transition count 3942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 3214 transition count 3941
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 3214 transition count 3941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 3213 transition count 3933
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 3213 transition count 3933
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 3212 transition count 3925
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 3212 transition count 3925
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 3211 transition count 3924
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 3211 transition count 3924
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 3210 transition count 3916
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 3210 transition count 3916
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 3209 transition count 3908
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 3209 transition count 3908
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 3208 transition count 3907
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 3208 transition count 3907
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 3207 transition count 3899
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 3207 transition count 3899
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 3206 transition count 3891
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 3206 transition count 3891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 3205 transition count 3890
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 3205 transition count 3890
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 3204 transition count 3882
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 3204 transition count 3882
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 3203 transition count 3874
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 3203 transition count 3874
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 3202 transition count 3873
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 3202 transition count 3873
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 3201 transition count 3865
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 3201 transition count 3865
Applied a total of 141 rules in 9293 ms. Remains 3201 /3271 variables (removed 70) and now considering 3865/4071 (removed 206) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9297 ms. Remains : 3201/3271 places, 3865/4071 transitions.
[2024-06-01 07:03:40] [INFO ] Flatten gal took : 91 ms
[2024-06-01 07:03:40] [INFO ] Flatten gal took : 98 ms
[2024-06-01 07:03:41] [INFO ] Input system was already deterministic with 3865 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3271/3271 places, 4071/4071 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 3252 transition count 4034
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 3252 transition count 4034
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 3252 transition count 4033
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 3244 transition count 4025
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 3244 transition count 4025
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 3241 transition count 4015
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 3241 transition count 4015
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 3238 transition count 4012
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 3238 transition count 4012
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 3235 transition count 4002
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 3235 transition count 4002
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 3232 transition count 3992
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 3232 transition count 3992
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 3229 transition count 3989
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 3229 transition count 3989
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 3227 transition count 3980
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 3227 transition count 3980
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 3225 transition count 3971
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 3225 transition count 3971
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 3223 transition count 3969
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 3223 transition count 3969
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 3222 transition count 3961
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 3222 transition count 3961
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 3221 transition count 3953
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 3221 transition count 3953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 3220 transition count 3952
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 3220 transition count 3952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 3219 transition count 3944
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 3219 transition count 3944
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 3218 transition count 3936
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 3218 transition count 3936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 3217 transition count 3935
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 3217 transition count 3935
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 3216 transition count 3927
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 3216 transition count 3927
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 3215 transition count 3919
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 3215 transition count 3919
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 3214 transition count 3918
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 3214 transition count 3918
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 3213 transition count 3910
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 3213 transition count 3910
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 3212 transition count 3902
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 3212 transition count 3902
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 3211 transition count 3901
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 3211 transition count 3901
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 3210 transition count 3893
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 3210 transition count 3893
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 3209 transition count 3885
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 3209 transition count 3885
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 3208 transition count 3884
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 3208 transition count 3884
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 3207 transition count 3876
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 3207 transition count 3876
Applied a total of 129 rules in 9346 ms. Remains 3207 /3271 variables (removed 64) and now considering 3876/4071 (removed 195) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9346 ms. Remains : 3207/3271 places, 3876/4071 transitions.
[2024-06-01 07:03:50] [INFO ] Flatten gal took : 89 ms
[2024-06-01 07:03:50] [INFO ] Flatten gal took : 96 ms
[2024-06-01 07:03:50] [INFO ] Input system was already deterministic with 3876 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3271/3271 places, 4071/4071 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 3251 transition count 4033
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 3251 transition count 4033
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 3242 transition count 4024
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 3242 transition count 4024
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 3239 transition count 4014
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 3239 transition count 4014
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 3236 transition count 4011
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 3236 transition count 4011
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 3233 transition count 4001
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 3233 transition count 4001
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 3230 transition count 3991
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 3230 transition count 3991
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 3227 transition count 3988
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 3227 transition count 3988
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 3225 transition count 3979
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 3225 transition count 3979
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 3223 transition count 3970
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 3223 transition count 3970
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 3221 transition count 3968
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 3221 transition count 3968
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 3220 transition count 3960
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 3220 transition count 3960
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 3219 transition count 3952
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 3219 transition count 3952
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 3218 transition count 3951
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 3218 transition count 3951
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 3217 transition count 3943
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 3217 transition count 3943
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 3216 transition count 3935
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 3216 transition count 3935
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 3215 transition count 3934
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 3215 transition count 3934
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 3214 transition count 3926
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 3214 transition count 3926
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 3213 transition count 3918
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 3213 transition count 3918
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 3212 transition count 3917
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 3212 transition count 3917
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 3211 transition count 3909
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 3211 transition count 3909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 3210 transition count 3901
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 3210 transition count 3901
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 3209 transition count 3900
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 3209 transition count 3900
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 3208 transition count 3892
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 3208 transition count 3892
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 3207 transition count 3884
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 3207 transition count 3884
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 3206 transition count 3883
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 3206 transition count 3883
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 131 place count 3205 transition count 3875
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 3205 transition count 3875
Applied a total of 132 rules in 8810 ms. Remains 3205 /3271 variables (removed 66) and now considering 3875/4071 (removed 196) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8811 ms. Remains : 3205/3271 places, 3875/4071 transitions.
[2024-06-01 07:03:59] [INFO ] Flatten gal took : 91 ms
[2024-06-01 07:03:59] [INFO ] Flatten gal took : 98 ms
[2024-06-01 07:04:00] [INFO ] Input system was already deterministic with 3875 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3271/3271 places, 4071/4071 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 3249 transition count 4031
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 3249 transition count 4031
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 3249 transition count 4030
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 3239 transition count 4015
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 3239 transition count 4015
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 3235 transition count 4004
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 3235 transition count 4004
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 3232 transition count 4001
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 3232 transition count 4001
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 3229 transition count 3991
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 3229 transition count 3991
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 3226 transition count 3981
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 3226 transition count 3981
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 3223 transition count 3978
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 3223 transition count 3978
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 3221 transition count 3969
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 3221 transition count 3969
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 3219 transition count 3960
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 3219 transition count 3960
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 3217 transition count 3958
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 3217 transition count 3958
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 3216 transition count 3950
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 3216 transition count 3950
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 3215 transition count 3942
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 3215 transition count 3942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 3214 transition count 3941
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 3214 transition count 3941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 3213 transition count 3933
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 3213 transition count 3933
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 3212 transition count 3925
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 3212 transition count 3925
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 3211 transition count 3924
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 3211 transition count 3924
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 3210 transition count 3916
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 3210 transition count 3916
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 3209 transition count 3908
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 3209 transition count 3908
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 3208 transition count 3907
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 3208 transition count 3907
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 3207 transition count 3899
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 3207 transition count 3899
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 3206 transition count 3891
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 3206 transition count 3891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 3205 transition count 3890
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 3205 transition count 3890
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 3204 transition count 3882
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 3204 transition count 3882
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 3203 transition count 3874
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 3203 transition count 3874
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 138 place count 3202 transition count 3873
Iterating global reduction 1 with 1 rules applied. Total rules applied 139 place count 3202 transition count 3873
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 3201 transition count 3865
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 3201 transition count 3865
Applied a total of 141 rules in 9275 ms. Remains 3201 /3271 variables (removed 70) and now considering 3865/4071 (removed 206) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9277 ms. Remains : 3201/3271 places, 3865/4071 transitions.
[2024-06-01 07:04:09] [INFO ] Flatten gal took : 86 ms
[2024-06-01 07:04:09] [INFO ] Flatten gal took : 96 ms
[2024-06-01 07:04:09] [INFO ] Input system was already deterministic with 3865 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3271/3271 places, 4071/4071 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 3251 transition count 4033
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 3251 transition count 4033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 3251 transition count 4032
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 3242 transition count 4018
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 3242 transition count 4018
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 3239 transition count 4008
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 3239 transition count 4008
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 3237 transition count 4006
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 3237 transition count 4006
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 3235 transition count 3997
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 3235 transition count 3997
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 3233 transition count 3988
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 3233 transition count 3988
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 3231 transition count 3986
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 3231 transition count 3986
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 3230 transition count 3978
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 3230 transition count 3978
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 3229 transition count 3970
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 3229 transition count 3970
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 3228 transition count 3969
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 3228 transition count 3969
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 3227 transition count 3961
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 3227 transition count 3961
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 3226 transition count 3953
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 3226 transition count 3953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 3225 transition count 3952
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 3225 transition count 3952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 3224 transition count 3944
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 3224 transition count 3944
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 3223 transition count 3936
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 3223 transition count 3936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 3222 transition count 3935
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 3222 transition count 3935
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 3221 transition count 3927
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 3221 transition count 3927
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 3220 transition count 3919
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 3220 transition count 3919
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 3219 transition count 3918
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 3219 transition count 3918
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 3218 transition count 3910
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 3218 transition count 3910
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 3217 transition count 3902
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 3217 transition count 3902
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 3216 transition count 3901
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 3216 transition count 3901
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 3215 transition count 3893
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 3215 transition count 3893
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 3214 transition count 3885
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 3214 transition count 3885
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 3213 transition count 3884
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 3213 transition count 3884
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 3212 transition count 3876
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 3212 transition count 3876
Applied a total of 119 rules in 9530 ms. Remains 3212 /3271 variables (removed 59) and now considering 3876/4071 (removed 195) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9530 ms. Remains : 3212/3271 places, 3876/4071 transitions.
[2024-06-01 07:04:19] [INFO ] Flatten gal took : 91 ms
[2024-06-01 07:04:19] [INFO ] Flatten gal took : 96 ms
[2024-06-01 07:04:19] [INFO ] Input system was already deterministic with 3876 transitions.
[2024-06-01 07:04:19] [INFO ] Flatten gal took : 99 ms
[2024-06-01 07:04:19] [INFO ] Flatten gal took : 105 ms
[2024-06-01 07:04:19] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 07:04:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3271 places, 4071 transitions and 12668 arcs took 29 ms.
Total runtime 630498 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 : ASLink-PT-08b-CTLFireability-2024-00
Could not compute solution for formula : ASLink-PT-08b-CTLFireability-2024-01
Could not compute solution for formula : ASLink-PT-08b-CTLFireability-2024-02
Could not compute solution for formula : ASLink-PT-08b-CTLFireability-2024-03
Could not compute solution for formula : ASLink-PT-08b-CTLFireability-2024-08
Could not compute solution for formula : ASLink-PT-08b-CTLFireability-2024-10
Could not compute solution for formula : ASLink-PT-08b-CTLFireability-2024-11
Could not compute solution for formula : ASLink-PT-08b-CTLFireability-2023-12
Could not compute solution for formula : ASLink-PT-08b-CTLFireability-2023-13
Could not compute solution for formula : ASLink-PT-08b-CTLFireability-2023-14
Could not compute solution for formula : ASLink-PT-08b-CTLFireability-2023-15

BK_STOP 1717225460405

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ASLink-PT-08b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/796/ctl_0_
ctl formula name ASLink-PT-08b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/796/ctl_1_
ctl formula name ASLink-PT-08b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/796/ctl_2_
ctl formula name ASLink-PT-08b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/796/ctl_3_
ctl formula name ASLink-PT-08b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/796/ctl_4_
ctl formula name ASLink-PT-08b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/796/ctl_5_
ctl formula name ASLink-PT-08b-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/796/ctl_6_
ctl formula name ASLink-PT-08b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/796/ctl_7_
ctl formula name ASLink-PT-08b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/796/ctl_8_
ctl formula name ASLink-PT-08b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/796/ctl_9_
ctl formula name ASLink-PT-08b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/796/ctl_10_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-08b"
export BK_EXAMINATION="CTLFireability"
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 ASLink-PT-08b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117900130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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