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.r355-tall-171683759300665.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 greatspnxred
Input is ShieldPPPt-PT-040B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759300665
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 762K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717022662213

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 22:44:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 22:44:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 22:44:23] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-05-29 22:44:23] [INFO ] Transformed 3123 places.
[2024-05-29 22:44:23] [INFO ] Transformed 2843 transitions.
[2024-05-29 22:44:23] [INFO ] Found NUPN structural information;
[2024-05-29 22:44:23] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 481 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
FORMULA ShieldPPPt-PT-040B-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 109 out of 3123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Discarding 419 places :
Symmetric choice reduction at 0 with 419 rule applications. Total rules 419 place count 2704 transition count 2424
Iterating global reduction 0 with 419 rules applied. Total rules applied 838 place count 2704 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 839 place count 2703 transition count 2423
Iterating global reduction 0 with 1 rules applied. Total rules applied 840 place count 2703 transition count 2423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 841 place count 2702 transition count 2422
Iterating global reduction 0 with 1 rules applied. Total rules applied 842 place count 2702 transition count 2422
Applied a total of 842 rules in 1232 ms. Remains 2702 /3123 variables (removed 421) and now considering 2422/2843 (removed 421) transitions.
// Phase 1: matrix 2422 rows 2702 cols
[2024-05-29 22:44:25] [INFO ] Computed 441 invariants in 41 ms
[2024-05-29 22:44:26] [INFO ] Implicit Places using invariants in 1127 ms returned []
[2024-05-29 22:44:26] [INFO ] Invariant cache hit.
[2024-05-29 22:44:28] [INFO ] Implicit Places using invariants and state equation in 2102 ms returned []
Implicit Place search using SMT with State Equation took 3255 ms to find 0 implicit places.
Running 2421 sub problems to find dead transitions.
[2024-05-29 22:44:28] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2701/5124 variables, and 0 constraints, problems are : Problem set: 0 solved, 2421 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2702 constraints, PredecessorRefiner: 2421/2421 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2701/5124 variables, and 0 constraints, problems are : Problem set: 0 solved, 2421 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/441 constraints, State Equation: 0/2702 constraints, PredecessorRefiner: 0/2421 constraints, Known Traps: 0/0 constraints]
After SMT, in 61029ms problems are : Problem set: 0 solved, 2421 unsolved
Search for dead transitions found 0 dead transitions in 61069ms
Starting structural reductions in LTL mode, iteration 1 : 2702/3123 places, 2422/2843 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65590 ms. Remains : 2702/3123 places, 2422/2843 transitions.
Support contains 109 out of 2702 places after structural reductions.
[2024-05-29 22:45:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 22:45:30] [INFO ] Flatten gal took : 175 ms
[2024-05-29 22:45:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldPPPt-PT-040B-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 22:45:30] [INFO ] Flatten gal took : 100 ms
[2024-05-29 22:45:30] [INFO ] Input system was already deterministic with 2422 transitions.
Support contains 84 out of 2702 places (down from 109) after GAL structural reductions.
FORMULA ShieldPPPt-PT-040B-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2727 ms. (14 steps per ms) remains 18/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
[2024-05-29 22:45:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 402/434 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2268/2702 variables, 402/441 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2702 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2422/5124 variables, 2702/3143 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5124 variables, 0/3143 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/5124 variables, 0/3143 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5124/5124 variables, and 3143 constraints, problems are : Problem set: 0 solved, 18 unsolved in 4692 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 2702/2702 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 402/434 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2268/2702 variables, 402/441 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-29 22:45:37] [INFO ] Deduced a trap composed of 25 places in 401 ms of which 69 ms to minimize.
[2024-05-29 22:45:37] [INFO ] Deduced a trap composed of 17 places in 347 ms of which 7 ms to minimize.
[2024-05-29 22:45:38] [INFO ] Deduced a trap composed of 21 places in 313 ms of which 6 ms to minimize.
[2024-05-29 22:45:38] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 6 ms to minimize.
[2024-05-29 22:45:38] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 5 ms to minimize.
[2024-05-29 22:45:39] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 5 ms to minimize.
[2024-05-29 22:45:39] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 6 ms to minimize.
[2024-05-29 22:45:39] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 6 ms to minimize.
[2024-05-29 22:45:40] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 5 ms to minimize.
[2024-05-29 22:45:40] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 5 ms to minimize.
[2024-05-29 22:45:40] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 5 ms to minimize.
[2024-05-29 22:45:40] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 5 ms to minimize.
[2024-05-29 22:45:41] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 5 ms to minimize.
[2024-05-29 22:45:41] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 4 ms to minimize.
SMT process timed out in 9920ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 2702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2702/2702 places, 2422/2422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 542 transitions
Trivial Post-agglo rules discarded 542 transitions
Performed 542 trivial Post agglomeration. Transition count delta: 542
Iterating post reduction 0 with 542 rules applied. Total rules applied 542 place count 2702 transition count 1880
Reduce places removed 542 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 547 rules applied. Total rules applied 1089 place count 2160 transition count 1875
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1094 place count 2155 transition count 1875
Performed 302 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 302 Pre rules applied. Total rules applied 1094 place count 2155 transition count 1573
Deduced a syphon composed of 302 places in 3 ms
Reduce places removed 302 places and 0 transitions.
Iterating global reduction 3 with 604 rules applied. Total rules applied 1698 place count 1853 transition count 1573
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1711 place count 1840 transition count 1560
Iterating global reduction 3 with 13 rules applied. Total rules applied 1724 place count 1840 transition count 1560
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1724 place count 1840 transition count 1550
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1744 place count 1830 transition count 1550
Performed 675 Post agglomeration using F-continuation condition.Transition count delta: 675
Deduced a syphon composed of 675 places in 3 ms
Reduce places removed 675 places and 0 transitions.
Iterating global reduction 3 with 1350 rules applied. Total rules applied 3094 place count 1155 transition count 875
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3296 place count 1054 transition count 875
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 3314 place count 1045 transition count 875
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3315 place count 1045 transition count 874
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3316 place count 1045 transition count 873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3317 place count 1044 transition count 873
Partial Free-agglomeration rule applied 118 times.
Drop transitions (Partial Free agglomeration) removed 118 transitions
Iterating global reduction 4 with 118 rules applied. Total rules applied 3435 place count 1044 transition count 873
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3436 place count 1043 transition count 872
Applied a total of 3436 rules in 603 ms. Remains 1043 /2702 variables (removed 1659) and now considering 872/2422 (removed 1550) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 603 ms. Remains : 1043/2702 places, 872/2422 transitions.
RANDOM walk for 40000 steps (8 resets) in 748 ms. (53 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 88202 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 17
Probabilistic random walk after 88202 steps, saw 73896 distinct states, run finished after 3004 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 872 rows 1043 cols
[2024-05-29 22:45:45] [INFO ] Computed 441 invariants in 3 ms
[2024-05-29 22:45:45] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 95/125 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 17/142 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 199/341 variables, 142/188 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 5/193 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 381/722 variables, 206/399 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/722 variables, 62/461 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/722 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/722 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 29/751 variables, 32/494 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/751 variables, 29/523 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/751 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 52/803 variables, 26/549 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/803 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 376/1179 variables, 227/776 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1179 variables, 67/843 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1179 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 13/1192 variables, 18/861 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1192 variables, 13/874 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1192 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (OVERLAPS) 16/1208 variables, 8/882 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1208 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 342/1550 variables, 198/1080 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1550 variables, 67/1147 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1550 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (OVERLAPS) 18/1568 variables, 19/1166 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1568 variables, 18/1184 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1568 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (OVERLAPS) 34/1602 variables, 17/1201 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1602 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (OVERLAPS) 210/1812 variables, 140/1341 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1812 variables, 34/1375 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1812 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (OVERLAPS) 9/1821 variables, 17/1392 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1821 variables, 9/1401 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1821 variables, 0/1401 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 39 (OVERLAPS) 65/1886 variables, 41/1442 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1886 variables, 15/1457 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1886 variables, 0/1457 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 42 (OVERLAPS) 3/1889 variables, 5/1462 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1889 variables, 3/1465 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1889 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 45 (OVERLAPS) 2/1891 variables, 1/1466 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1891 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 47 (OVERLAPS) 21/1912 variables, 15/1481 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1912 variables, 6/1487 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1912 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 50 (OVERLAPS) 3/1915 variables, 2/1489 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1915 variables, 1/1490 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1915 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 53 (OVERLAPS) 0/1915 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1915/1915 variables, and 1490 constraints, problems are : Problem set: 0 solved, 17 unsolved in 7258 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1043/1043 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 95/125 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 17/142 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 199/341 variables, 142/188 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 5/193 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 381/722 variables, 206/405 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/722 variables, 62/467 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/722 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/722 variables, 11/479 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:45:53] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2024-05-29 22:45:53] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 22:45:53] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
[2024-05-29 22:45:53] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-29 22:45:53] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/722 variables, 5/484 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:45:53] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:45:54] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-29 22:45:54] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2024-05-29 22:45:54] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/722 variables, 3/488 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/722 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 29/751 variables, 32/520 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/751 variables, 29/549 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:45:54] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-29 22:45:55] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 52/803 variables, 26/577 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/803 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (OVERLAPS) 376/1179 variables, 227/804 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1179 variables, 67/871 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1179 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (OVERLAPS) 13/1192 variables, 18/889 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1192 variables, 13/902 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:45:56] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1192 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1192 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (OVERLAPS) 16/1208 variables, 8/911 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1208 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (OVERLAPS) 342/1550 variables, 198/1109 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1550 variables, 67/1176 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1550 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 35 (OVERLAPS) 18/1568 variables, 19/1195 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1568 variables, 18/1213 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1568 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 38 (OVERLAPS) 34/1602 variables, 17/1230 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:45:58] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/1602 variables, 1/1231 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1602 variables, 0/1231 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 41 (OVERLAPS) 210/1812 variables, 140/1371 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1812 variables, 34/1405 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:46:00] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-29 22:46:00] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1812 variables, 2/1407 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1812 variables, 0/1407 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 45 (OVERLAPS) 9/1821 variables, 17/1424 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1821 variables, 9/1433 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1821 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 48 (OVERLAPS) 65/1886 variables, 41/1474 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1886 variables, 15/1489 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:46:01] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/1886 variables, 1/1490 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1886 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 52 (OVERLAPS) 3/1889 variables, 5/1495 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1889 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1889 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 55 (OVERLAPS) 2/1891 variables, 1/1499 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1891 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 57 (OVERLAPS) 21/1912 variables, 15/1514 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1912 variables, 6/1520 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1912 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 60 (OVERLAPS) 3/1915 variables, 2/1522 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1915 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1915 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 63 (OVERLAPS) 0/1915 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1915/1915 variables, and 1523 constraints, problems are : Problem set: 0 solved, 17 unsolved in 13855 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1043/1043 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 16/16 constraints]
After SMT, in 21128ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 1096 ms.
Support contains 30 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 872/872 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1043 transition count 871
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1042 transition count 871
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1041 transition count 870
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1041 transition count 870
Applied a total of 5 rules in 81 ms. Remains 1041 /1043 variables (removed 2) and now considering 870/872 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1041/1043 places, 870/872 transitions.
RANDOM walk for 40000 steps (8 resets) in 584 ms. (68 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 86046 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 17
Probabilistic random walk after 86046 steps, saw 72093 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 870 rows 1041 cols
[2024-05-29 22:46:11] [INFO ] Computed 441 invariants in 3 ms
[2024-05-29 22:46:11] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 95/125 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 17/142 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 199/341 variables, 142/188 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 5/193 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 381/722 variables, 206/399 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/722 variables, 62/461 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/722 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/722 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 29/751 variables, 32/494 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/751 variables, 29/523 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/751 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 52/803 variables, 26/549 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/803 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 376/1179 variables, 227/776 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1179 variables, 67/843 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1179 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 13/1192 variables, 18/861 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1192 variables, 13/874 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1192 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (OVERLAPS) 16/1208 variables, 8/882 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1208 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 343/1551 variables, 198/1080 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1551 variables, 67/1147 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1551 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (OVERLAPS) 18/1569 variables, 19/1166 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1569 variables, 18/1184 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1569 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (OVERLAPS) 34/1603 variables, 17/1201 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1603 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (OVERLAPS) 206/1809 variables, 139/1340 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1809 variables, 35/1375 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1809 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (OVERLAPS) 8/1817 variables, 16/1391 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1817 variables, 8/1399 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1817 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 39 (OVERLAPS) 65/1882 variables, 41/1440 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1882 variables, 15/1455 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1882 variables, 0/1455 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 42 (OVERLAPS) 3/1885 variables, 5/1460 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1885 variables, 3/1463 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1885 variables, 0/1463 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 45 (OVERLAPS) 2/1887 variables, 1/1464 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1887 variables, 0/1464 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 47 (OVERLAPS) 21/1908 variables, 15/1479 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1908 variables, 6/1485 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1908 variables, 0/1485 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 50 (OVERLAPS) 3/1911 variables, 2/1487 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1911 variables, 1/1488 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1911 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 53 (OVERLAPS) 0/1911 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1911/1911 variables, and 1488 constraints, problems are : Problem set: 0 solved, 17 unsolved in 7585 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1041/1041 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 95/125 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 17/142 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:46:18] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 199/341 variables, 142/189 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 6/200 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:46:19] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 381/722 variables, 206/407 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/722 variables, 62/469 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/722 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 11/481 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:46:19] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-05-29 22:46:19] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2024-05-29 22:46:19] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-05-29 22:46:19] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-29 22:46:20] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/722 variables, 5/486 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:46:20] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/722 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/722 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 29/751 variables, 32/519 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 29/548 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 52/803 variables, 26/574 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/803 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (OVERLAPS) 376/1179 variables, 227/801 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1179 variables, 67/868 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1179 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (OVERLAPS) 13/1192 variables, 18/886 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1192 variables, 13/899 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1192 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (OVERLAPS) 16/1208 variables, 8/907 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:46:22] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1208 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1208 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (OVERLAPS) 343/1551 variables, 198/1106 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1551 variables, 67/1173 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:46:23] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 3 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1551 variables, 1/1174 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:46:23] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1551 variables, 1/1175 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1551 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 37 (OVERLAPS) 18/1569 variables, 19/1194 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1569 variables, 18/1212 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1569 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 40 (OVERLAPS) 34/1603 variables, 17/1229 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1603 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 42 (OVERLAPS) 206/1809 variables, 139/1368 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1809 variables, 35/1403 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 22:46:26] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/1809 variables, 1/1404 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1809 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 46 (OVERLAPS) 8/1817 variables, 16/1420 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1817 variables, 8/1428 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1817 variables, 0/1428 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 49 (OVERLAPS) 65/1882 variables, 41/1469 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1882 variables, 15/1484 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1882 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 52 (OVERLAPS) 3/1885 variables, 5/1489 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1885 variables, 3/1492 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1885 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 55 (OVERLAPS) 2/1887 variables, 1/1493 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1887 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 57 (OVERLAPS) 21/1908 variables, 15/1508 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1908 variables, 6/1514 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1908 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 60 (OVERLAPS) 3/1911 variables, 2/1516 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1911 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1911 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 63 (OVERLAPS) 0/1911 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1911/1911 variables, and 1517 constraints, problems are : Problem set: 0 solved, 17 unsolved in 13189 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1041/1041 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 12/12 constraints]
After SMT, in 20790ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 1197 ms.
Support contains 30 out of 1041 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1041/1041 places, 870/870 transitions.
Applied a total of 0 rules in 32 ms. Remains 1041 /1041 variables (removed 0) and now considering 870/870 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1041/1041 places, 870/870 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1041/1041 places, 870/870 transitions.
Applied a total of 0 rules in 24 ms. Remains 1041 /1041 variables (removed 0) and now considering 870/870 (removed 0) transitions.
[2024-05-29 22:46:33] [INFO ] Invariant cache hit.
[2024-05-29 22:46:33] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-29 22:46:33] [INFO ] Invariant cache hit.
[2024-05-29 22:46:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-29 22:46:34] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2024-05-29 22:46:34] [INFO ] Redundant transitions in 46 ms returned []
Running 863 sub problems to find dead transitions.
[2024-05-29 22:46:34] [INFO ] Invariant cache hit.
[2024-05-29 22:46:34] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1036 variables, 425/425 constraints. Problems are: Problem set: 0 solved, 863 unsolved
[2024-05-29 22:46:49] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 22:46:49] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 22:46:49] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 22:46:52] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 4 ms to minimize.
[2024-05-29 22:46:52] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 4 ms to minimize.
[2024-05-29 22:46:53] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 4 ms to minimize.
[2024-05-29 22:46:53] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 4 ms to minimize.
[2024-05-29 22:46:53] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 4 ms to minimize.
[2024-05-29 22:46:53] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 4 ms to minimize.
[2024-05-29 22:46:54] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 4 ms to minimize.
[2024-05-29 22:46:54] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 4 ms to minimize.
[2024-05-29 22:46:54] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 4 ms to minimize.
[2024-05-29 22:46:54] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 4 ms to minimize.
[2024-05-29 22:46:54] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 13 ms to minimize.
[2024-05-29 22:46:55] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 4 ms to minimize.
[2024-05-29 22:46:55] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 3 ms to minimize.
[2024-05-29 22:46:55] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 3 ms to minimize.
[2024-05-29 22:46:55] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 4 ms to minimize.
[2024-05-29 22:46:56] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 4 ms to minimize.
[2024-05-29 22:46:56] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1036 variables, 20/445 constraints. Problems are: Problem set: 0 solved, 863 unsolved
[2024-05-29 22:46:58] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-29 22:46:58] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
[2024-05-29 22:46:58] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-29 22:46:58] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-29 22:46:58] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-29 22:46:58] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 22:47:01] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 3 ms to minimize.
[2024-05-29 22:47:02] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 4 ms to minimize.
[2024-05-29 22:47:02] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 3 ms to minimize.
[2024-05-29 22:47:02] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 3 ms to minimize.
[2024-05-29 22:47:02] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 4 ms to minimize.
[2024-05-29 22:47:02] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 3 ms to minimize.
[2024-05-29 22:47:03] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 4 ms to minimize.
[2024-05-29 22:47:03] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 3 ms to minimize.
[2024-05-29 22:47:03] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 4 ms to minimize.
[2024-05-29 22:47:03] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 4 ms to minimize.
[2024-05-29 22:47:03] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 4 ms to minimize.
[2024-05-29 22:47:03] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 4 ms to minimize.
[2024-05-29 22:47:04] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 3 ms to minimize.
[2024-05-29 22:47:04] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1036 variables, 20/465 constraints. Problems are: Problem set: 0 solved, 863 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1036/1911 variables, and 465 constraints, problems are : Problem set: 0 solved, 863 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 425/441 constraints, State Equation: 0/1041 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 863/863 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 863 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1036 variables, 425/425 constraints. Problems are: Problem set: 0 solved, 863 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1036 variables, 40/465 constraints. Problems are: Problem set: 0 solved, 863 unsolved
[2024-05-29 22:47:07] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 22:47:07] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 22:47:07] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 22:47:07] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-29 22:47:07] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-29 22:47:08] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 22:47:08] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-29 22:47:08] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-29 22:47:08] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-29 22:47:08] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 22:47:08] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 22:47:08] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-29 22:47:08] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-29 22:47:08] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-29 22:47:08] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 22:47:09] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-29 22:47:09] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-29 22:47:09] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 22:47:09] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-29 22:47:09] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1036 variables, 20/485 constraints. Problems are: Problem set: 0 solved, 863 unsolved
[2024-05-29 22:47:12] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 22:47:12] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-29 22:47:12] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-29 22:47:12] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 22:47:12] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
[2024-05-29 22:47:13] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-29 22:47:13] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-29 22:47:13] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:47:13] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-05-29 22:47:13] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-29 22:47:13] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-29 22:47:13] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-05-29 22:47:13] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
[2024-05-29 22:47:13] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-29 22:47:14] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-05-29 22:47:14] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-29 22:47:14] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-29 22:47:14] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-05-29 22:47:14] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-29 22:47:14] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1036 variables, 20/505 constraints. Problems are: Problem set: 0 solved, 863 unsolved
[2024-05-29 22:47:17] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-29 22:47:17] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-29 22:47:19] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-29 22:47:19] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-05-29 22:47:19] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-05-29 22:47:19] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-05-29 22:47:19] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-29 22:47:19] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-29 22:47:19] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-05-29 22:47:20] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-29 22:47:20] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-29 22:47:20] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-29 22:47:20] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-29 22:47:20] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 3 ms to minimize.
[2024-05-29 22:47:20] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-29 22:47:20] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-29 22:47:21] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-29 22:47:21] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-29 22:47:21] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-29 22:47:21] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1036 variables, 20/525 constraints. Problems are: Problem set: 0 solved, 863 unsolved
[2024-05-29 22:47:23] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-29 22:47:23] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-29 22:47:24] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-29 22:47:24] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-29 22:47:24] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 22:47:25] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-29 22:47:25] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-29 22:47:25] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-05-29 22:47:25] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 22:47:26] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-05-29 22:47:26] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-29 22:47:26] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-05-29 22:47:27] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-29 22:47:27] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 3 ms to minimize.
[2024-05-29 22:47:27] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-29 22:47:28] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-05-29 22:47:28] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 3 ms to minimize.
[2024-05-29 22:47:32] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-05-29 22:47:33] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 2 ms to minimize.
[2024-05-29 22:47:33] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1036 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 863 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1036/1911 variables, and 545 constraints, problems are : Problem set: 0 solved, 863 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 425/441 constraints, State Equation: 0/1041 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/863 constraints, Known Traps: 120/120 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 863 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61760 ms. Remains : 1041/1041 places, 870/870 transitions.
[2024-05-29 22:47:35] [INFO ] Flatten gal took : 72 ms
[2024-05-29 22:47:35] [INFO ] Flatten gal took : 86 ms
[2024-05-29 22:47:35] [INFO ] Input system was already deterministic with 2422 transitions.
Computed a total of 644 stabilizing places and 644 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2702/2702 places, 2422/2422 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2683 transition count 2403
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2683 transition count 2403
Applied a total of 38 rules in 299 ms. Remains 2683 /2702 variables (removed 19) and now considering 2403/2422 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 2683/2702 places, 2403/2422 transitions.
[2024-05-29 22:47:35] [INFO ] Flatten gal took : 55 ms
[2024-05-29 22:47:35] [INFO ] Flatten gal took : 58 ms
[2024-05-29 22:47:35] [INFO ] Input system was already deterministic with 2403 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2702/2702 places, 2422/2422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 2701 transition count 1861
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 2141 transition count 1861
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 1120 place count 2141 transition count 1551
Deduced a syphon composed of 310 places in 2 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 1740 place count 1831 transition count 1551
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1759 place count 1812 transition count 1532
Iterating global reduction 2 with 19 rules applied. Total rules applied 1778 place count 1812 transition count 1532
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 1778 place count 1812 transition count 1516
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1810 place count 1796 transition count 1516
Performed 633 Post agglomeration using F-continuation condition.Transition count delta: 633
Deduced a syphon composed of 633 places in 1 ms
Reduce places removed 633 places and 0 transitions.
Iterating global reduction 2 with 1266 rules applied. Total rules applied 3076 place count 1163 transition count 883
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3077 place count 1163 transition count 882
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3079 place count 1162 transition count 881
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3081 place count 1160 transition count 879
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3082 place count 1159 transition count 879
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3082 place count 1159 transition count 877
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3086 place count 1157 transition count 877
Applied a total of 3086 rules in 468 ms. Remains 1157 /2702 variables (removed 1545) and now considering 877/2422 (removed 1545) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 468 ms. Remains : 1157/2702 places, 877/2422 transitions.
[2024-05-29 22:47:36] [INFO ] Flatten gal took : 24 ms
[2024-05-29 22:47:36] [INFO ] Flatten gal took : 24 ms
[2024-05-29 22:47:36] [INFO ] Input system was already deterministic with 877 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2702/2702 places, 2422/2422 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2683 transition count 2403
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2683 transition count 2403
Applied a total of 38 rules in 285 ms. Remains 2683 /2702 variables (removed 19) and now considering 2403/2422 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 2683/2702 places, 2403/2422 transitions.
[2024-05-29 22:47:36] [INFO ] Flatten gal took : 50 ms
[2024-05-29 22:47:36] [INFO ] Flatten gal took : 54 ms
[2024-05-29 22:47:37] [INFO ] Input system was already deterministic with 2403 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2702/2702 places, 2422/2422 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2683 transition count 2403
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2683 transition count 2403
Applied a total of 38 rules in 290 ms. Remains 2683 /2702 variables (removed 19) and now considering 2403/2422 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 2683/2702 places, 2403/2422 transitions.
[2024-05-29 22:47:37] [INFO ] Flatten gal took : 49 ms
[2024-05-29 22:47:37] [INFO ] Flatten gal took : 51 ms
[2024-05-29 22:47:37] [INFO ] Input system was already deterministic with 2403 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2702/2702 places, 2422/2422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 552 transitions
Trivial Post-agglo rules discarded 552 transitions
Performed 552 trivial Post agglomeration. Transition count delta: 552
Iterating post reduction 0 with 552 rules applied. Total rules applied 552 place count 2701 transition count 1869
Reduce places removed 552 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 556 rules applied. Total rules applied 1108 place count 2149 transition count 1865
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1112 place count 2145 transition count 1865
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 307 Pre rules applied. Total rules applied 1112 place count 2145 transition count 1558
Deduced a syphon composed of 307 places in 3 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 3 with 614 rules applied. Total rules applied 1726 place count 1838 transition count 1558
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1739 place count 1825 transition count 1545
Iterating global reduction 3 with 13 rules applied. Total rules applied 1752 place count 1825 transition count 1545
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1752 place count 1825 transition count 1534
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1774 place count 1814 transition count 1534
Performed 631 Post agglomeration using F-continuation condition.Transition count delta: 631
Deduced a syphon composed of 631 places in 1 ms
Reduce places removed 631 places and 0 transitions.
Iterating global reduction 3 with 1262 rules applied. Total rules applied 3036 place count 1183 transition count 903
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3037 place count 1183 transition count 902
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3039 place count 1182 transition count 901
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3041 place count 1180 transition count 899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3042 place count 1179 transition count 899
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3042 place count 1179 transition count 897
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3046 place count 1177 transition count 897
Applied a total of 3046 rules in 449 ms. Remains 1177 /2702 variables (removed 1525) and now considering 897/2422 (removed 1525) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 449 ms. Remains : 1177/2702 places, 897/2422 transitions.
[2024-05-29 22:47:38] [INFO ] Flatten gal took : 56 ms
[2024-05-29 22:47:38] [INFO ] Flatten gal took : 42 ms
[2024-05-29 22:47:38] [INFO ] Input system was already deterministic with 897 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2702/2702 places, 2422/2422 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2683 transition count 2403
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2683 transition count 2403
Applied a total of 38 rules in 343 ms. Remains 2683 /2702 variables (removed 19) and now considering 2403/2422 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 2683/2702 places, 2403/2422 transitions.
[2024-05-29 22:47:38] [INFO ] Flatten gal took : 50 ms
[2024-05-29 22:47:38] [INFO ] Flatten gal took : 52 ms
[2024-05-29 22:47:38] [INFO ] Input system was already deterministic with 2403 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2702/2702 places, 2422/2422 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2681 transition count 2401
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2681 transition count 2401
Applied a total of 42 rules in 290 ms. Remains 2681 /2702 variables (removed 21) and now considering 2401/2422 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 2681/2702 places, 2401/2422 transitions.
[2024-05-29 22:47:39] [INFO ] Flatten gal took : 45 ms
[2024-05-29 22:47:39] [INFO ] Flatten gal took : 49 ms
[2024-05-29 22:47:39] [INFO ] Input system was already deterministic with 2401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2702/2702 places, 2422/2422 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2682 transition count 2402
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2682 transition count 2402
Applied a total of 40 rules in 291 ms. Remains 2682 /2702 variables (removed 20) and now considering 2402/2422 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 2682/2702 places, 2402/2422 transitions.
[2024-05-29 22:47:39] [INFO ] Flatten gal took : 46 ms
[2024-05-29 22:47:39] [INFO ] Flatten gal took : 48 ms
[2024-05-29 22:47:39] [INFO ] Input system was already deterministic with 2402 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2702/2702 places, 2422/2422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 2701 transition count 1860
Reduce places removed 561 places and 0 transitions.
Iterating post reduction 1 with 561 rules applied. Total rules applied 1122 place count 2140 transition count 1860
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 1122 place count 2140 transition count 1551
Deduced a syphon composed of 309 places in 2 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 1740 place count 1831 transition count 1551
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1758 place count 1813 transition count 1533
Iterating global reduction 2 with 18 rules applied. Total rules applied 1776 place count 1813 transition count 1533
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 1776 place count 1813 transition count 1517
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1808 place count 1797 transition count 1517
Performed 634 Post agglomeration using F-continuation condition.Transition count delta: 634
Deduced a syphon composed of 634 places in 1 ms
Reduce places removed 634 places and 0 transitions.
Iterating global reduction 2 with 1268 rules applied. Total rules applied 3076 place count 1163 transition count 883
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3077 place count 1163 transition count 882
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3079 place count 1162 transition count 881
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3081 place count 1160 transition count 879
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3082 place count 1159 transition count 879
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3082 place count 1159 transition count 877
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3086 place count 1157 transition count 877
Applied a total of 3086 rules in 309 ms. Remains 1157 /2702 variables (removed 1545) and now considering 877/2422 (removed 1545) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 309 ms. Remains : 1157/2702 places, 877/2422 transitions.
[2024-05-29 22:47:40] [INFO ] Flatten gal took : 20 ms
[2024-05-29 22:47:40] [INFO ] Flatten gal took : 22 ms
[2024-05-29 22:47:40] [INFO ] Input system was already deterministic with 877 transitions.
RANDOM walk for 30633 steps (6 resets) in 460 ms. (66 steps per ms) remains 0/1 properties
FORMULA ShieldPPPt-PT-040B-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 2702/2702 places, 2422/2422 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2682 transition count 2402
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2682 transition count 2402
Applied a total of 40 rules in 357 ms. Remains 2682 /2702 variables (removed 20) and now considering 2402/2422 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 2682/2702 places, 2402/2422 transitions.
[2024-05-29 22:47:40] [INFO ] Flatten gal took : 42 ms
[2024-05-29 22:47:40] [INFO ] Flatten gal took : 46 ms
[2024-05-29 22:47:40] [INFO ] Input system was already deterministic with 2402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2702/2702 places, 2422/2422 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2682 transition count 2402
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2682 transition count 2402
Applied a total of 40 rules in 293 ms. Remains 2682 /2702 variables (removed 20) and now considering 2402/2422 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 2682/2702 places, 2402/2422 transitions.
[2024-05-29 22:47:41] [INFO ] Flatten gal took : 43 ms
[2024-05-29 22:47:41] [INFO ] Flatten gal took : 46 ms
[2024-05-29 22:47:41] [INFO ] Input system was already deterministic with 2402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2702/2702 places, 2422/2422 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2681 transition count 2401
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2681 transition count 2401
Applied a total of 42 rules in 294 ms. Remains 2681 /2702 variables (removed 21) and now considering 2401/2422 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 2681/2702 places, 2401/2422 transitions.
[2024-05-29 22:47:41] [INFO ] Flatten gal took : 44 ms
[2024-05-29 22:47:41] [INFO ] Flatten gal took : 46 ms
[2024-05-29 22:47:41] [INFO ] Input system was already deterministic with 2401 transitions.
[2024-05-29 22:47:41] [INFO ] Flatten gal took : 46 ms
[2024-05-29 22:47:41] [INFO ] Flatten gal took : 47 ms
[2024-05-29 22:47:41] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-29 22:47:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2702 places, 2422 transitions and 6284 arcs took 13 ms.
Total runtime 198627 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPt-PT-040B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2702
TRANSITIONS: 2422
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.034s, Sys 0.007s]


SAVING FILE /home/mcc/execution/403/model (.net / .def) ...
EXPORT TIME: [User 0.008s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1087
MODEL NAME: /home/mcc/execution/403/model
2702 places, 2422 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

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="ShieldPPPt-PT-040B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldPPPt-PT-040B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683759300665"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;