fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r356-tall-171683760800298
Last Updated
July 7, 2024

About the Execution of ITS-Tools for ShieldIIPt-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16206.703 3339782.00 3634148.00 8641.50 ??????T?????TT?? normal

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.r356-tall-171683760800298.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 itstools
Input is ShieldIIPt-PT-030B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760800298
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716935619969

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 22:33:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 22:33:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:33:42] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2024-05-28 22:33:42] [INFO ] Transformed 2103 places.
[2024-05-28 22:33:42] [INFO ] Transformed 1953 transitions.
[2024-05-28 22:33:42] [INFO ] Found NUPN structural information;
[2024-05-28 22:33:42] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 350 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 156 ms.
Support contains 154 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 286 places :
Symmetric choice reduction at 0 with 286 rule applications. Total rules 286 place count 1817 transition count 1667
Iterating global reduction 0 with 286 rules applied. Total rules applied 572 place count 1817 transition count 1667
Applied a total of 572 rules in 1077 ms. Remains 1817 /2103 variables (removed 286) and now considering 1667/1953 (removed 286) transitions.
// Phase 1: matrix 1667 rows 1817 cols
[2024-05-28 22:33:43] [INFO ] Computed 271 invariants in 31 ms
[2024-05-28 22:33:44] [INFO ] Implicit Places using invariants in 1054 ms returned []
[2024-05-28 22:33:44] [INFO ] Invariant cache hit.
[2024-05-28 22:33:45] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 2463 ms to find 0 implicit places.
Running 1666 sub problems to find dead transitions.
[2024-05-28 22:33:46] [INFO ] Invariant cache hit.
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 1816/3484 variables, and 0 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1817 constraints, PredecessorRefiner: 1666/1666 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1666 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1816/3484 variables, and 0 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1817 constraints, PredecessorRefiner: 0/1666 constraints, Known Traps: 0/0 constraints]
After SMT, in 60550ms problems are : Problem set: 0 solved, 1666 unsolved
Search for dead transitions found 0 dead transitions in 60579ms
Starting structural reductions in LTL mode, iteration 1 : 1817/2103 places, 1667/1953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64151 ms. Remains : 1817/2103 places, 1667/1953 transitions.
Support contains 154 out of 1817 places after structural reductions.
[2024-05-28 22:34:46] [INFO ] Flatten gal took : 140 ms
[2024-05-28 22:34:46] [INFO ] Flatten gal took : 81 ms
[2024-05-28 22:34:47] [INFO ] Input system was already deterministic with 1667 transitions.
Support contains 147 out of 1817 places (down from 154) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2740 ms. (14 steps per ms) remains 36/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
[2024-05-28 22:34:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 442/496 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 1321/1817 variables, 218/271 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1817 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 1667/3484 variables, 1817/2088 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3484 variables, 0/2088 constraints. Problems are: Problem set: 0 solved, 36 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 3484/3484 variables, and 2088 constraints, problems are : Problem set: 0 solved, 36 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 1817/1817 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 442/496 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-28 22:34:53] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 13 ms to minimize.
[2024-05-28 22:34:54] [INFO ] Deduced a trap composed of 29 places in 324 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 1321/1817 variables, 218/273 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-28 22:34:55] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 4 ms to minimize.
[2024-05-28 22:34:55] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 5 ms to minimize.
[2024-05-28 22:34:55] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 4 ms to minimize.
[2024-05-28 22:34:55] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 4 ms to minimize.
[2024-05-28 22:34:55] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-05-28 22:34:56] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 4 ms to minimize.
[2024-05-28 22:34:56] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-28 22:34:56] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 3 ms to minimize.
[2024-05-28 22:34:56] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 3 ms to minimize.
[2024-05-28 22:34:56] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 3 ms to minimize.
[2024-05-28 22:34:56] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 3 ms to minimize.
[2024-05-28 22:34:57] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 3 ms to minimize.
[2024-05-28 22:34:57] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-05-28 22:34:57] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 3 ms to minimize.
[2024-05-28 22:34:57] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 3 ms to minimize.
[2024-05-28 22:34:57] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-28 22:34:57] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 3 ms to minimize.
[2024-05-28 22:34:57] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-28 22:34:57] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-28 22:34:57] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1817 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-28 22:34:58] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-28 22:34:58] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-28 22:34:58] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:34:58] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:34:58] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
SMT process timed out in 10073ms, After SMT, problems are : Problem set: 0 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 1817 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 1817 transition count 1319
Reduce places removed 348 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 356 rules applied. Total rules applied 704 place count 1469 transition count 1311
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 712 place count 1461 transition count 1311
Performed 213 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 213 Pre rules applied. Total rules applied 712 place count 1461 transition count 1098
Deduced a syphon composed of 213 places in 2 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 3 with 426 rules applied. Total rules applied 1138 place count 1248 transition count 1098
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1157 place count 1229 transition count 1079
Iterating global reduction 3 with 19 rules applied. Total rules applied 1176 place count 1229 transition count 1079
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1176 place count 1229 transition count 1069
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1196 place count 1219 transition count 1069
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 504
Deduced a syphon composed of 504 places in 5 ms
Reduce places removed 504 places and 0 transitions.
Iterating global reduction 3 with 1008 rules applied. Total rules applied 2204 place count 715 transition count 565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2205 place count 715 transition count 564
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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2207 place count 714 transition count 563
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 75 places in 7 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 2357 place count 639 transition count 603
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2358 place count 639 transition count 602
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 2365 place count 639 transition count 595
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 2372 place count 632 transition count 595
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 6 with 27 rules applied. Total rules applied 2399 place count 632 transition count 595
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2400 place count 631 transition count 594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2402 place count 629 transition count 594
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2402 place count 629 transition count 593
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2404 place count 628 transition count 593
Applied a total of 2404 rules in 474 ms. Remains 628 /1817 variables (removed 1189) and now considering 593/1667 (removed 1074) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 628/1817 places, 593/1667 transitions.
RANDOM walk for 40000 steps (8 resets) in 837 ms. (47 steps per ms) remains 31/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
// Phase 1: matrix 593 rows 628 cols
[2024-05-28 22:34:59] [INFO ] Computed 269 invariants in 3 ms
[2024-05-28 22:34:59] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 96/142 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 23/165 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 204/369 variables, 165/218 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 9/227 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 237/606 variables, 130/357 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 55/412 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/606 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 7/613 variables, 9/422 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/613 variables, 7/429 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/613 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (OVERLAPS) 8/621 variables, 4/433 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/621 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 17 (OVERLAPS) 146/767 variables, 84/517 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/767 variables, 34/551 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/767 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 20 (OVERLAPS) 3/770 variables, 4/555 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/770 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/770 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 23 (OVERLAPS) 2/772 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/772 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 25 (OVERLAPS) 128/900 variables, 60/619 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/900 variables, 21/640 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/900 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 28 (OVERLAPS) 7/907 variables, 8/648 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/907 variables, 7/655 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/907 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 31 (OVERLAPS) 12/919 variables, 6/661 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/919 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 33 (OVERLAPS) 89/1008 variables, 56/717 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1008 variables, 21/738 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1008 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 36 (OVERLAPS) 1/1009 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1009 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1009 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 39 (OVERLAPS) 81/1090 variables, 38/778 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1090 variables, 12/790 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1090 variables, 1/791 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1090 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 43 (OVERLAPS) 7/1097 variables, 7/798 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1097 variables, 4/802 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1097 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 46 (OVERLAPS) 9/1106 variables, 5/807 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1106 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1106 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 49 (OVERLAPS) 45/1151 variables, 35/843 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1151 variables, 11/854 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1151 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 52 (OVERLAPS) 2/1153 variables, 1/855 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1153 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 54 (OVERLAPS) 27/1180 variables, 12/867 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1180 variables, 4/871 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1180 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 57 (OVERLAPS) 1/1181 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1181 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1181 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 60 (OVERLAPS) 2/1183 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1183 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 62 (OVERLAPS) 28/1211 variables, 17/891 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1211 variables, 6/897 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1211 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 65 (OVERLAPS) 1/1212 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1212 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1212 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 68 (OVERLAPS) 2/1214 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1214 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 70 (OVERLAPS) 7/1221 variables, 6/906 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1221 variables, 2/908 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1221 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 73 (OVERLAPS) 0/1221 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1221/1221 variables, and 908 constraints, problems are : Problem set: 0 solved, 31 unsolved in 10819 ms.
Refiners :[Positive P Invariants (semi-flows): 269/269 constraints, State Equation: 628/628 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 96/142 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 23/165 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 204/369 variables, 165/218 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 9/227 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 24/251 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-28 22:35:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-28 22:35:10] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-28 22:35:10] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-28 22:35:10] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-28 22:35:10] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 5/256 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 237/606 variables, 130/386 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/606 variables, 55/441 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/606 variables, 7/449 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-28 22:35:11] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-28 22:35:11] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 9 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/606 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/606 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 16 (OVERLAPS) 7/613 variables, 9/460 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/613 variables, 7/467 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/613 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 19 (OVERLAPS) 8/621 variables, 4/471 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/621 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 21 (OVERLAPS) 146/767 variables, 84/555 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/767 variables, 34/589 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/767 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 24 (OVERLAPS) 3/770 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/770 variables, 3/596 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/770 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 27 (OVERLAPS) 2/772 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/772 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 29 (OVERLAPS) 128/900 variables, 60/657 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/900 variables, 21/678 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/900 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 32 (OVERLAPS) 7/907 variables, 8/686 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/907 variables, 7/693 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/907 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 35 (OVERLAPS) 12/919 variables, 6/699 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/919 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 37 (OVERLAPS) 89/1008 variables, 56/755 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1008 variables, 21/776 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1008 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 40 (OVERLAPS) 1/1009 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1009 variables, 1/778 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1009 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 43 (OVERLAPS) 81/1090 variables, 38/816 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1090 variables, 12/828 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1090 variables, 1/829 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1090 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 47 (OVERLAPS) 7/1097 variables, 7/836 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1097 variables, 4/840 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1097 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 50 (OVERLAPS) 9/1106 variables, 5/845 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1106 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1106 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 53 (OVERLAPS) 45/1151 variables, 35/881 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1151 variables, 11/892 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1151 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 56 (OVERLAPS) 2/1153 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1153 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 58 (OVERLAPS) 27/1180 variables, 12/905 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1180 variables, 4/909 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1180 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 61 (OVERLAPS) 1/1181 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1181 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1181 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 64 (OVERLAPS) 2/1183 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1183 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 66 (OVERLAPS) 28/1211 variables, 17/929 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1211 variables, 6/935 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1211 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 69 (OVERLAPS) 1/1212 variables, 1/936 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1212 variables, 1/937 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1212 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 72 (OVERLAPS) 2/1214 variables, 1/938 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1214 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 74 (OVERLAPS) 7/1221 variables, 6/944 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1221 variables, 2/946 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1221 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 77 (OVERLAPS) 0/1221 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1221/1221 variables, and 946 constraints, problems are : Problem set: 0 solved, 31 unsolved in 18963 ms.
Refiners :[Positive P Invariants (semi-flows): 269/269 constraints, State Equation: 628/628 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 7/7 constraints]
After SMT, in 29807ms problems are : Problem set: 0 solved, 31 unsolved
Fused 31 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 1756 ms.
Support contains 46 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 593/593 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 628 transition count 592
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 627 transition count 592
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 622 transition count 587
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 620 transition count 587
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 617 transition count 584
Applied a total of 19 rules in 58 ms. Remains 617 /628 variables (removed 11) and now considering 584/593 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 617/628 places, 584/593 transitions.
RANDOM walk for 40000 steps (8 resets) in 888 ms. (44 steps per ms) remains 17/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 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 4004 steps (8 resets) in 44 ms. (88 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 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 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 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 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
// Phase 1: matrix 584 rows 617 cols
[2024-05-28 22:35:31] [INFO ] Computed 269 invariants in 2 ms
[2024-05-28 22:35:31] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 57/81 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 23/104 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 137/241 variables, 104/138 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 9/147 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 196/437 variables, 104/251 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 43/294 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 8/445 variables, 7/302 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 6/308 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 4/449 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/449 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 170/619 variables, 91/401 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/619 variables, 35/436 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/619 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 7/626 variables, 7/443 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/626 variables, 5/448 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/626 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (OVERLAPS) 6/632 variables, 3/451 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/632 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 146/778 variables, 76/527 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/778 variables, 26/553 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/778 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (OVERLAPS) 12/790 variables, 8/561 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/790 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/790 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (OVERLAPS) 10/800 variables, 5/572 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/800 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (OVERLAPS) 101/901 variables, 62/634 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/901 variables, 20/654 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/901 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (OVERLAPS) 2/903 variables, 3/657 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/903 variables, 2/659 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/903 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 39 (OVERLAPS) 88/991 variables, 44/703 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/991 variables, 15/718 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/991 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 42 (OVERLAPS) 5/996 variables, 7/725 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/996 variables, 5/730 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/996 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 45 (OVERLAPS) 6/1002 variables, 3/733 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1002 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 47 (OVERLAPS) 58/1060 variables, 36/769 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1060 variables, 15/784 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1060 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 50 (OVERLAPS) 58/1118 variables, 26/810 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1118 variables, 9/819 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1118 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 53 (OVERLAPS) 3/1121 variables, 4/823 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1121 variables, 3/826 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1121 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 56 (OVERLAPS) 4/1125 variables, 2/828 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1125 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 58 (OVERLAPS) 41/1166 variables, 26/854 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1166 variables, 11/865 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1166 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 61 (OVERLAPS) 24/1190 variables, 12/877 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1190 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1190 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1190 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 65 (OVERLAPS) 2/1192 variables, 3/884 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1192 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1192 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 68 (OVERLAPS) 1/1193 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1193 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1193 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 71 (OVERLAPS) 8/1201 variables, 6/894 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1201 variables, 3/897 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1201 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 74 (OVERLAPS) 0/1201 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1201/1201 variables, and 897 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5361 ms.
Refiners :[Positive P Invariants (semi-flows): 269/269 constraints, State Equation: 617/617 constraints, ReadFeed: 11/11 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 57/81 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 23/104 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-28 22:35:37] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 137/241 variables, 104/139 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 9/148 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 13/161 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 196/437 variables, 104/265 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 43/308 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-28 22:35:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 8/445 variables, 7/321 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/445 variables, 6/327 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/445 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 4/449 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/449 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 170/619 variables, 91/420 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/619 variables, 35/455 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/619 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (OVERLAPS) 7/626 variables, 7/462 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/626 variables, 5/467 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/626 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (OVERLAPS) 6/632 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/632 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (OVERLAPS) 146/778 variables, 76/546 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/778 variables, 26/572 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/778 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (OVERLAPS) 12/790 variables, 8/580 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/790 variables, 6/586 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/790 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 35 (OVERLAPS) 10/800 variables, 5/591 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/800 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 37 (OVERLAPS) 101/901 variables, 62/653 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/901 variables, 20/673 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/901 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 40 (OVERLAPS) 2/903 variables, 3/676 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/903 variables, 2/678 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/903 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 43 (OVERLAPS) 88/991 variables, 44/722 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/991 variables, 15/737 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/991 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 46 (OVERLAPS) 5/996 variables, 7/744 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/996 variables, 5/749 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/996 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 49 (OVERLAPS) 6/1002 variables, 3/752 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1002 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 51 (OVERLAPS) 58/1060 variables, 36/788 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1060 variables, 15/803 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1060 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 54 (OVERLAPS) 58/1118 variables, 26/829 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1118 variables, 9/838 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1118 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 57 (OVERLAPS) 3/1121 variables, 4/842 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1121 variables, 3/845 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1121 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 60 (OVERLAPS) 4/1125 variables, 2/847 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1125 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 62 (OVERLAPS) 41/1166 variables, 26/873 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1166 variables, 11/884 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1166 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 65 (OVERLAPS) 24/1190 variables, 12/896 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1190 variables, 3/899 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1190 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1190 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 69 (OVERLAPS) 2/1192 variables, 3/903 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1192 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1192 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 72 (OVERLAPS) 1/1193 variables, 1/906 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1193 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1193 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 75 (OVERLAPS) 8/1201 variables, 6/913 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1201 variables, 3/916 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1201 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 78 (OVERLAPS) 0/1201 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1201/1201 variables, and 916 constraints, problems are : Problem set: 0 solved, 17 unsolved in 7638 ms.
Refiners :[Positive P Invariants (semi-flows): 269/269 constraints, State Equation: 617/617 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 2/2 constraints]
After SMT, in 13021ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 695 ms.
Support contains 24 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 584/584 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 617 transition count 578
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 611 transition count 578
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 12 place count 611 transition count 573
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 606 transition count 573
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 36 place count 599 transition count 566
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 594 transition count 571
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 593 transition count 570
Applied a total of 47 rules in 77 ms. Remains 593 /617 variables (removed 24) and now considering 570/584 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 593/617 places, 570/584 transitions.
RANDOM walk for 40000 steps (8 resets) in 562 ms. (71 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 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 4004 steps (8 resets) in 26 ms. (148 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 21 ms. (182 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 21 ms. (181 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 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 126888 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 17
Probabilistic random walk after 126888 steps, saw 85126 distinct states, run finished after 3013 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 570 rows 593 cols
[2024-05-28 22:35:48] [INFO ] Computed 269 invariants in 4 ms
[2024-05-28 22:35:48] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 54/78 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 17/95 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-28 22:35:49] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 126/221 variables, 95/128 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 9/137 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 185/406 variables, 101/238 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 47/285 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 2/408 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 4/412 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 168/580 variables, 84/376 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/580 variables, 37/413 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/580 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 2/582 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/582 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/582 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (OVERLAPS) 2/584 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/584 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (OVERLAPS) 153/737 variables, 74/493 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/737 variables, 29/522 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/737 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (OVERLAPS) 7/744 variables, 7/529 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/744 variables, 7/536 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/744 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (OVERLAPS) 14/758 variables, 7/543 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/758 variables, 2/545 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/758 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 35 (OVERLAPS) 106/864 variables, 64/609 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/864 variables, 24/633 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/864 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 38 (OVERLAPS) 1/865 variables, 2/635 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/865 variables, 1/636 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/865 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 41 (OVERLAPS) 88/953 variables, 44/680 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/953 variables, 15/695 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/953 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 44 (OVERLAPS) 5/958 variables, 7/702 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/958 variables, 5/707 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/958 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 47 (OVERLAPS) 6/964 variables, 3/710 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/964 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 49 (OVERLAPS) 58/1022 variables, 36/746 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1022 variables, 15/761 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1022 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 52 (OVERLAPS) 58/1080 variables, 26/787 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1080 variables, 9/796 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1080 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 55 (OVERLAPS) 3/1083 variables, 4/800 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1083 variables, 3/803 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1083 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 58 (OVERLAPS) 4/1087 variables, 2/805 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1087 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 60 (OVERLAPS) 41/1128 variables, 26/831 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1128 variables, 11/842 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1128 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 63 (OVERLAPS) 24/1152 variables, 12/854 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1152 variables, 3/857 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1152 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1152 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 67 (OVERLAPS) 2/1154 variables, 3/861 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1154 variables, 2/863 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1154 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 70 (OVERLAPS) 1/1155 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1155 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1155 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 73 (OVERLAPS) 8/1163 variables, 6/871 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1163 variables, 3/874 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1163 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 76 (OVERLAPS) 0/1163 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 874 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5335 ms.
Refiners :[Positive P Invariants (semi-flows): 269/269 constraints, State Equation: 593/593 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 54/78 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 17/95 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 126/221 variables, 95/128 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 9/137 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 13/150 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-28 22:35:54] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-28 22:35:54] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 185/406 variables, 101/253 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 47/300 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-28 22:35:54] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/406 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 2/408 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/408 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/408 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 4/412 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/412 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 168/580 variables, 84/396 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/580 variables, 37/433 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/580 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 2/582 variables, 3/436 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/582 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/582 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (OVERLAPS) 2/584 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/584 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (OVERLAPS) 153/737 variables, 74/513 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/737 variables, 29/542 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/737 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (OVERLAPS) 7/744 variables, 7/549 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/744 variables, 7/556 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/744 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (OVERLAPS) 14/758 variables, 7/563 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/758 variables, 2/565 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/758 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 39 (OVERLAPS) 106/864 variables, 64/629 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/864 variables, 24/653 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/864 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 42 (OVERLAPS) 1/865 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/865 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/865 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 45 (OVERLAPS) 88/953 variables, 44/700 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/953 variables, 15/715 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/953 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 48 (OVERLAPS) 5/958 variables, 7/722 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/958 variables, 5/727 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/958 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 51 (OVERLAPS) 6/964 variables, 3/730 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/964 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 53 (OVERLAPS) 58/1022 variables, 36/766 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1022 variables, 15/781 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1022 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 56 (OVERLAPS) 58/1080 variables, 26/807 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1080 variables, 9/816 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1080 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 59 (OVERLAPS) 3/1083 variables, 4/820 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1083 variables, 3/823 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1083 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 62 (OVERLAPS) 4/1087 variables, 2/825 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1087 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 64 (OVERLAPS) 41/1128 variables, 26/851 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1128 variables, 11/862 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1128 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 67 (OVERLAPS) 24/1152 variables, 12/874 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1152 variables, 3/877 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1152 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1152 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 71 (OVERLAPS) 2/1154 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1154 variables, 2/883 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1154 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 74 (OVERLAPS) 1/1155 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1155 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1155 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 77 (OVERLAPS) 8/1163 variables, 6/891 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1163 variables, 3/894 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1163 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 80 (OVERLAPS) 0/1163 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 894 constraints, problems are : Problem set: 0 solved, 17 unsolved in 7916 ms.
Refiners :[Positive P Invariants (semi-flows): 269/269 constraints, State Equation: 593/593 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 4/4 constraints]
After SMT, in 13264ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 798 ms.
Support contains 24 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 570/570 transitions.
Applied a total of 0 rules in 17 ms. Remains 593 /593 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 593/593 places, 570/570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 570/570 transitions.
Applied a total of 0 rules in 15 ms. Remains 593 /593 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-28 22:36:03] [INFO ] Invariant cache hit.
[2024-05-28 22:36:03] [INFO ] Implicit Places using invariants in 329 ms returned [582]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 331 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 592/593 places, 570/570 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 591 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 591 transition count 569
Applied a total of 2 rules in 25 ms. Remains 591 /592 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 591 cols
[2024-05-28 22:36:03] [INFO ] Computed 268 invariants in 5 ms
[2024-05-28 22:36:03] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-28 22:36:03] [INFO ] Invariant cache hit.
[2024-05-28 22:36:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-28 22:36:04] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 591/593 places, 569/570 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1378 ms. Remains : 591/593 places, 569/570 transitions.
RANDOM walk for 40000 steps (8 resets) in 633 ms. (63 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
[2024-05-28 22:36:04] [INFO ] Invariant cache hit.
[2024-05-28 22:36:04] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 45/66 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 15/81 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 110/191 variables, 81/108 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 9/117 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 180/371 variables, 95/212 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 43/255 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 4/375 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/375 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 8/383 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 186/569 variables, 96/361 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/569 variables, 38/399 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/569 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 4/573 variables, 5/404 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/573 variables, 4/408 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/573 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (OVERLAPS) 2/575 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/575 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 162/737 variables, 80/489 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/737 variables, 32/521 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/737 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (OVERLAPS) 7/744 variables, 7/528 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/744 variables, 7/535 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/744 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (OVERLAPS) 14/758 variables, 7/542 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/758 variables, 2/544 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/758 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 34 (OVERLAPS) 106/864 variables, 64/608 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/864 variables, 24/632 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/864 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 37 (OVERLAPS) 1/865 variables, 2/634 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/865 variables, 1/635 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/865 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 40 (OVERLAPS) 88/953 variables, 44/679 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/953 variables, 15/694 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/953 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 43 (OVERLAPS) 5/958 variables, 7/701 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/958 variables, 5/706 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/958 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 46 (OVERLAPS) 6/964 variables, 3/709 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/964 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 48 (OVERLAPS) 58/1022 variables, 36/745 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1022 variables, 15/760 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1022 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 51 (OVERLAPS) 58/1080 variables, 26/786 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1080 variables, 9/795 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1080 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 54 (OVERLAPS) 3/1083 variables, 4/799 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1083 variables, 3/802 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1083 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 57 (OVERLAPS) 4/1087 variables, 2/804 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1087 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 59 (OVERLAPS) 41/1128 variables, 26/830 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1128 variables, 11/841 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1128 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 62 (OVERLAPS) 23/1151 variables, 12/853 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1151 variables, 4/857 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1151 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 65 (OVERLAPS) 1/1152 variables, 2/859 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1152 variables, 1/860 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1152 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 68 (OVERLAPS) 8/1160 variables, 6/866 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1160 variables, 3/869 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1160 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 71 (OVERLAPS) 0/1160 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1160/1160 variables, and 869 constraints, problems are : Problem set: 0 solved, 15 unsolved in 4199 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 591/591 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 45/66 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 15/81 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-28 22:36:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 110/191 variables, 81/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 9/118 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 10/128 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 180/371 variables, 95/223 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 43/266 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 5/272 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-28 22:36:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/371 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/371 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 4/375 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/375 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 8/383 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (OVERLAPS) 186/569 variables, 96/378 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/569 variables, 38/416 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/569 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (OVERLAPS) 4/573 variables, 5/421 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/573 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/573 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (OVERLAPS) 2/575 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/575 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (OVERLAPS) 162/737 variables, 80/506 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/737 variables, 32/538 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/737 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 32 (OVERLAPS) 7/744 variables, 7/545 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/744 variables, 7/552 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/744 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 35 (OVERLAPS) 14/758 variables, 7/559 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/758 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/758 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 38 (OVERLAPS) 106/864 variables, 64/625 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/864 variables, 24/649 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/864 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 41 (OVERLAPS) 1/865 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/865 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/865 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 44 (OVERLAPS) 88/953 variables, 44/696 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/953 variables, 15/711 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/953 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 47 (OVERLAPS) 5/958 variables, 7/718 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/958 variables, 5/723 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/958 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 50 (OVERLAPS) 6/964 variables, 3/726 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/964 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 52 (OVERLAPS) 58/1022 variables, 36/762 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1022 variables, 15/777 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1022 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 55 (OVERLAPS) 58/1080 variables, 26/803 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1080 variables, 9/812 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1080 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 58 (OVERLAPS) 3/1083 variables, 4/816 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1083 variables, 3/819 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1083 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 61 (OVERLAPS) 4/1087 variables, 2/821 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1087 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 63 (OVERLAPS) 41/1128 variables, 26/847 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1128 variables, 11/858 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1128 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 66 (OVERLAPS) 23/1151 variables, 12/870 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1151 variables, 4/874 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1151 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 69 (OVERLAPS) 1/1152 variables, 2/876 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1152 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1152 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 72 (OVERLAPS) 8/1160 variables, 6/883 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1160 variables, 3/886 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1160 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 75 (OVERLAPS) 0/1160 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1160/1160 variables, and 886 constraints, problems are : Problem set: 0 solved, 15 unsolved in 6098 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 591/591 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints]
After SMT, in 10317ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2785 ms.
Support contains 21 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 569/569 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 591 transition count 568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 590 transition count 568
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 590 transition count 567
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 589 transition count 567
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 589 transition count 567
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 588 transition count 566
Applied a total of 6 rules in 45 ms. Remains 588 /591 variables (removed 3) and now considering 566/569 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 588/591 places, 566/569 transitions.
RANDOM walk for 40000 steps (8 resets) in 483 ms. (82 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 122712 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 15
Probabilistic random walk after 122712 steps, saw 82692 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 566 rows 588 cols
[2024-05-28 22:36:21] [INFO ] Computed 268 invariants in 6 ms
[2024-05-28 22:36:21] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 45/66 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 15/81 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 110/191 variables, 81/108 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 9/117 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 180/371 variables, 95/212 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 43/255 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 3/374 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 6/380 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/380 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 185/565 variables, 94/359 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/565 variables, 41/400 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/565 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 2/567 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/567 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/567 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (OVERLAPS) 2/569 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/569 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 162/731 variables, 80/486 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/731 variables, 32/518 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/731 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (OVERLAPS) 7/738 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/738 variables, 7/532 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/738 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (OVERLAPS) 14/752 variables, 7/539 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/752 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/752 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 34 (OVERLAPS) 106/858 variables, 64/605 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/858 variables, 24/629 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/858 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 37 (OVERLAPS) 1/859 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/859 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/859 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 40 (OVERLAPS) 88/947 variables, 44/676 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/947 variables, 15/691 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/947 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 43 (OVERLAPS) 5/952 variables, 7/698 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/952 variables, 5/703 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/952 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 46 (OVERLAPS) 6/958 variables, 3/706 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/958 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 48 (OVERLAPS) 58/1016 variables, 36/742 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1016 variables, 15/757 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1016 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 51 (OVERLAPS) 58/1074 variables, 26/783 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1074 variables, 9/792 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1074 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 54 (OVERLAPS) 3/1077 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1077 variables, 3/799 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1077 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 57 (OVERLAPS) 4/1081 variables, 2/801 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1081 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 59 (OVERLAPS) 41/1122 variables, 26/827 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1122 variables, 11/838 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1122 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 62 (OVERLAPS) 23/1145 variables, 12/850 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1145 variables, 4/854 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1145 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 65 (OVERLAPS) 1/1146 variables, 2/856 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1146 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1146 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 68 (OVERLAPS) 8/1154 variables, 6/863 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1154 variables, 3/866 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1154 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 71 (OVERLAPS) 0/1154 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1154/1154 variables, and 866 constraints, problems are : Problem set: 0 solved, 15 unsolved in 4157 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 588/588 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 45/66 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 15/81 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-28 22:36:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 110/191 variables, 81/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 9/118 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 10/128 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-28 22:36:25] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 180/371 variables, 95/224 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 43/267 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/371 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-28 22:36:25] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/371 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/371 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 3/374 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/374 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/374 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 6/380 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/380 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 185/565 variables, 94/377 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/565 variables, 41/418 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/565 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 2/567 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/567 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/567 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (OVERLAPS) 2/569 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/569 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (OVERLAPS) 162/731 variables, 80/504 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/731 variables, 32/536 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/731 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 33 (OVERLAPS) 7/738 variables, 7/543 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/738 variables, 7/550 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/738 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 36 (OVERLAPS) 14/752 variables, 7/557 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/752 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/752 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 39 (OVERLAPS) 106/858 variables, 64/623 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/858 variables, 24/647 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/858 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 42 (OVERLAPS) 1/859 variables, 2/649 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/859 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/859 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 45 (OVERLAPS) 88/947 variables, 44/694 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/947 variables, 15/709 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/947 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 48 (OVERLAPS) 5/952 variables, 7/716 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/952 variables, 5/721 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/952 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 51 (OVERLAPS) 6/958 variables, 3/724 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/958 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 53 (OVERLAPS) 58/1016 variables, 36/760 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1016 variables, 15/775 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1016 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 56 (OVERLAPS) 58/1074 variables, 26/801 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1074 variables, 9/810 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1074 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 59 (OVERLAPS) 3/1077 variables, 4/814 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1077 variables, 3/817 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1077 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 62 (OVERLAPS) 4/1081 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1081 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 64 (OVERLAPS) 41/1122 variables, 26/845 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1122 variables, 11/856 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1122 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 67 (OVERLAPS) 23/1145 variables, 12/868 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1145 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1145 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 70 (OVERLAPS) 1/1146 variables, 2/874 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1146 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1146 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 73 (OVERLAPS) 8/1154 variables, 6/881 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1154 variables, 3/884 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1154 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 76 (OVERLAPS) 0/1154 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1154/1154 variables, and 884 constraints, problems are : Problem set: 0 solved, 15 unsolved in 6164 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 588/588 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 3/3 constraints]
After SMT, in 10356ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 5991 ms.
Support contains 21 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 566/566 transitions.
Applied a total of 0 rules in 20 ms. Remains 588 /588 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 588/588 places, 566/566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 566/566 transitions.
Applied a total of 0 rules in 11 ms. Remains 588 /588 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2024-05-28 22:36:37] [INFO ] Invariant cache hit.
[2024-05-28 22:36:37] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-28 22:36:37] [INFO ] Invariant cache hit.
[2024-05-28 22:36:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-28 22:36:38] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2024-05-28 22:36:38] [INFO ] Redundant transitions in 29 ms returned []
Running 562 sub problems to find dead transitions.
[2024-05-28 22:36:38] [INFO ] Invariant cache hit.
[2024-05-28 22:36:38] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 259/259 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 22:36:46] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/587 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (OVERLAPS) 1/588 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-28 22:36:57] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 6 (OVERLAPS) 566/1154 variables, 588/858 constraints. Problems are: Problem set: 0 solved, 562 unsolved
SMT process timed out in 30108ms, After SMT, problems are : Problem set: 0 solved, 562 unsolved
Search for dead transitions found 0 dead transitions in 30114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30978 ms. Remains : 588/588 places, 566/566 transitions.
[2024-05-28 22:37:08] [INFO ] Flatten gal took : 53 ms
[2024-05-28 22:37:08] [INFO ] Flatten gal took : 49 ms
[2024-05-28 22:37:08] [INFO ] Input system was already deterministic with 1667 transitions.
Computed a total of 492 stabilizing places and 492 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 363 transitions
Trivial Post-agglo rules discarded 363 transitions
Performed 363 trivial Post agglomeration. Transition count delta: 363
Iterating post reduction 0 with 363 rules applied. Total rules applied 363 place count 1816 transition count 1303
Reduce places removed 363 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 365 rules applied. Total rules applied 728 place count 1453 transition count 1301
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 730 place count 1451 transition count 1301
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 217 Pre rules applied. Total rules applied 730 place count 1451 transition count 1084
Deduced a syphon composed of 217 places in 1 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 3 with 434 rules applied. Total rules applied 1164 place count 1234 transition count 1084
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1191 place count 1207 transition count 1057
Iterating global reduction 3 with 27 rules applied. Total rules applied 1218 place count 1207 transition count 1057
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 1218 place count 1207 transition count 1039
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 1254 place count 1189 transition count 1039
Performed 475 Post agglomeration using F-continuation condition.Transition count delta: 475
Deduced a syphon composed of 475 places in 1 ms
Reduce places removed 475 places and 0 transitions.
Iterating global reduction 3 with 950 rules applied. Total rules applied 2204 place count 714 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2205 place count 714 transition count 563
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 2207 place count 713 transition count 562
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2208 place count 713 transition count 562
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2210 place count 711 transition count 560
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2212 place count 709 transition count 560
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2212 place count 709 transition count 559
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2214 place count 708 transition count 559
Applied a total of 2214 rules in 238 ms. Remains 708 /1817 variables (removed 1109) and now considering 559/1667 (removed 1108) transitions.
// Phase 1: matrix 559 rows 708 cols
[2024-05-28 22:37:08] [INFO ] Computed 269 invariants in 3 ms
[2024-05-28 22:37:09] [INFO ] Implicit Places using invariants in 305 ms returned [694]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 307 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 707/1817 places, 559/1667 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 706 transition count 558
Applied a total of 2 rules in 23 ms. Remains 706 /707 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 706 cols
[2024-05-28 22:37:09] [INFO ] Computed 268 invariants in 4 ms
[2024-05-28 22:37:09] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-28 22:37:09] [INFO ] Invariant cache hit.
[2024-05-28 22:37:10] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 706/1817 places, 558/1667 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1470 ms. Remains : 706/1817 places, 558/1667 transitions.
[2024-05-28 22:37:10] [INFO ] Flatten gal took : 18 ms
[2024-05-28 22:37:10] [INFO ] Flatten gal took : 18 ms
[2024-05-28 22:37:10] [INFO ] Input system was already deterministic with 558 transitions.
[2024-05-28 22:37:10] [INFO ] Flatten gal took : 17 ms
[2024-05-28 22:37:10] [INFO ] Flatten gal took : 17 ms
[2024-05-28 22:37:10] [INFO ] Time to serialize gal into /tmp/CTLFireability7657868637977776997.gal : 13 ms
[2024-05-28 22:37:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9526860622707168043.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7657868637977776997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9526860622707168043.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.86732e+105,1.67349,58784,2,3203,5,221296,6,0,3379,355171,0


Converting to forward existential form...Done !
original formula: AF(EG((((((p826==1)||(p1757==1)) + (E((p507==1) U (p885==1)) + EF((p322==1)))) * (EG(((p675==0)||(p773==0))) + (p573==1))) + ((p158==1) *...272
=> equivalent forward existential formula: [FwdG(Init,!(EG((((((p826==1)||(p1757==1)) + (E((p507==1) U (p885==1)) + E(TRUE U (p322==1)))) * (EG(((p675==0)|...329
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...950
Detected timeout of ITS tools.
[2024-05-28 22:37:40] [INFO ] Flatten gal took : 16 ms
[2024-05-28 22:37:40] [INFO ] Applying decomposition
[2024-05-28 22:37:40] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7396905731010620688.txt' '-o' '/tmp/graph7396905731010620688.bin' '-w' '/tmp/graph7396905731010620688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7396905731010620688.bin' '-l' '-1' '-v' '-w' '/tmp/graph7396905731010620688.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:37:40] [INFO ] Decomposing Gal with order
[2024-05-28 22:37:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:37:40] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-28 22:37:40] [INFO ] Flatten gal took : 66 ms
[2024-05-28 22:37:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-28 22:37:40] [INFO ] Time to serialize gal into /tmp/CTLFireability7871930406831365493.gal : 9 ms
[2024-05-28 22:37:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10954560301280800550.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7871930406831365493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10954560301280800550.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.86732e+105,1.68881,73036,352,32,138270,265,709,410724,64,1197,0


Converting to forward existential form...Done !
original formula: AF(EG((((((i11.u99.p826==1)||(i24.u207.p1757==1)) + (E((i6.u59.p507==1) U (i11.u107.p885==1)) + EF((i4.u37.p322==1)))) * (EG(((i9.u80.p67...409
=> equivalent forward existential formula: [FwdG(Init,!(EG((((((i11.u99.p826==1)||(i24.u207.p1757==1)) + (E((i6.u59.p507==1) U (i11.u107.p885==1)) + E(TRUE...466
Reverse transition relation is NOT exact ! Due to transitions t434, t458, t462, t469, t478, t486, t536, i0.u2.t0, i0.u6.t137, i0.u7.t139, i0.u5.t134, i0.u8...2043
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 376 transitions
Trivial Post-agglo rules discarded 376 transitions
Performed 376 trivial Post agglomeration. Transition count delta: 376
Iterating post reduction 0 with 376 rules applied. Total rules applied 376 place count 1816 transition count 1290
Reduce places removed 376 places and 0 transitions.
Iterating post reduction 1 with 376 rules applied. Total rules applied 752 place count 1440 transition count 1290
Performed 218 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 218 Pre rules applied. Total rules applied 752 place count 1440 transition count 1072
Deduced a syphon composed of 218 places in 1 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 2 with 436 rules applied. Total rules applied 1188 place count 1222 transition count 1072
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1216 place count 1194 transition count 1044
Iterating global reduction 2 with 28 rules applied. Total rules applied 1244 place count 1194 transition count 1044
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 1244 place count 1194 transition count 1026
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 1280 place count 1176 transition count 1026
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 482
Deduced a syphon composed of 482 places in 1 ms
Reduce places removed 482 places and 0 transitions.
Iterating global reduction 2 with 964 rules applied. Total rules applied 2244 place count 694 transition count 544
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2245 place count 694 transition count 543
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 2247 place count 693 transition count 542
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2249 place count 691 transition count 540
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2251 place count 689 transition count 540
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2251 place count 689 transition count 539
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 2253 place count 688 transition count 539
Applied a total of 2253 rules in 255 ms. Remains 688 /1817 variables (removed 1129) and now considering 539/1667 (removed 1128) transitions.
// Phase 1: matrix 539 rows 688 cols
[2024-05-28 22:38:11] [INFO ] Computed 269 invariants in 1 ms
[2024-05-28 22:38:11] [INFO ] Implicit Places using invariants in 295 ms returned [674]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 297 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 687/1817 places, 539/1667 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 686 transition count 538
Applied a total of 2 rules in 20 ms. Remains 686 /687 variables (removed 1) and now considering 538/539 (removed 1) transitions.
// Phase 1: matrix 538 rows 686 cols
[2024-05-28 22:38:11] [INFO ] Computed 268 invariants in 6 ms
[2024-05-28 22:38:11] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-28 22:38:11] [INFO ] Invariant cache hit.
[2024-05-28 22:38:12] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 686/1817 places, 538/1667 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1353 ms. Remains : 686/1817 places, 538/1667 transitions.
[2024-05-28 22:38:12] [INFO ] Flatten gal took : 15 ms
[2024-05-28 22:38:12] [INFO ] Flatten gal took : 15 ms
[2024-05-28 22:38:12] [INFO ] Input system was already deterministic with 538 transitions.
[2024-05-28 22:38:12] [INFO ] Flatten gal took : 15 ms
[2024-05-28 22:38:12] [INFO ] Flatten gal took : 14 ms
[2024-05-28 22:38:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11485200854557730023.gal : 2 ms
[2024-05-28 22:38:12] [INFO ] Time to serialize properties into /tmp/CTLFireability18245028759856611609.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11485200854557730023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18245028759856611609.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.91096e+104,0.65211,25780,2,2272,5,93499,6,0,3285,122796,0


Converting to forward existential form...Done !
original formula: A(EF((p610==1)) U (p991==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p991==1))))) * !(E(!((p991==1)) U (!(E(TRUE U (p610==1))) * !((p991==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 536/0/2
Detected timeout of ITS tools.
[2024-05-28 22:38:42] [INFO ] Flatten gal took : 14 ms
[2024-05-28 22:38:42] [INFO ] Applying decomposition
[2024-05-28 22:38:42] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6374743911655117746.txt' '-o' '/tmp/graph6374743911655117746.bin' '-w' '/tmp/graph6374743911655117746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6374743911655117746.bin' '-l' '-1' '-v' '-w' '/tmp/graph6374743911655117746.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:38:42] [INFO ] Decomposing Gal with order
[2024-05-28 22:38:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:38:42] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-28 22:38:42] [INFO ] Flatten gal took : 25 ms
[2024-05-28 22:38:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 22:38:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4514442333661345245.gal : 5 ms
[2024-05-28 22:38:42] [INFO ] Time to serialize properties into /tmp/CTLFireability10863342220687162878.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4514442333661345245.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10863342220687162878.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.91096e+104,0.215362,10848,65,15,13268,151,506,20688,47,597,0


Converting to forward existential form...Done !
original formula: A(EF((i7.u69.p610==1)) U (i13.u112.p991==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i13.u112.p991==1))))) * !(E(!((i13.u112.p991==1)) U (!(E(TRUE U (i7.u69.p610==1))) * !((i13.u1...181
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 1777 transition count 1627
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 1777 transition count 1627
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1776 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1776 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1775 transition count 1625
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1775 transition count 1625
Applied a total of 84 rules in 246 ms. Remains 1775 /1817 variables (removed 42) and now considering 1625/1667 (removed 42) transitions.
// Phase 1: matrix 1625 rows 1775 cols
[2024-05-28 22:39:12] [INFO ] Computed 271 invariants in 9 ms
[2024-05-28 22:39:13] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-28 22:39:13] [INFO ] Invariant cache hit.
[2024-05-28 22:39:14] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
Running 1624 sub problems to find dead transitions.
[2024-05-28 22:39:14] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1774/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1624 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1775 constraints, PredecessorRefiner: 1624/1624 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1774/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1624 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1775 constraints, PredecessorRefiner: 0/1624 constraints, Known Traps: 0/0 constraints]
After SMT, in 60354ms problems are : Problem set: 0 solved, 1624 unsolved
Search for dead transitions found 0 dead transitions in 60368ms
Starting structural reductions in LTL mode, iteration 1 : 1775/1817 places, 1625/1667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62338 ms. Remains : 1775/1817 places, 1625/1667 transitions.
[2024-05-28 22:40:14] [INFO ] Flatten gal took : 36 ms
[2024-05-28 22:40:14] [INFO ] Flatten gal took : 39 ms
[2024-05-28 22:40:15] [INFO ] Input system was already deterministic with 1625 transitions.
[2024-05-28 22:40:15] [INFO ] Flatten gal took : 30 ms
[2024-05-28 22:40:15] [INFO ] Flatten gal took : 30 ms
[2024-05-28 22:40:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10665262949450240903.gal : 11 ms
[2024-05-28 22:40:15] [INFO ] Time to serialize properties into /tmp/CTLFireability10708058198512883784.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10665262949450240903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10708058198512883784.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:40:45] [INFO ] Flatten gal took : 30 ms
[2024-05-28 22:40:45] [INFO ] Applying decomposition
[2024-05-28 22:40:45] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10730138823309347665.txt' '-o' '/tmp/graph10730138823309347665.bin' '-w' '/tmp/graph10730138823309347665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10730138823309347665.bin' '-l' '-1' '-v' '-w' '/tmp/graph10730138823309347665.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:40:45] [INFO ] Decomposing Gal with order
[2024-05-28 22:40:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:40:45] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-28 22:40:45] [INFO ] Flatten gal took : 73 ms
[2024-05-28 22:40:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-28 22:40:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17040057188498507418.gal : 14 ms
[2024-05-28 22:40:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6683578274193111153.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17040057188498507418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6683578274193111153.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 1773 transition count 1623
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 1773 transition count 1623
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 1772 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 1772 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 1771 transition count 1621
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1771 transition count 1621
Applied a total of 92 rules in 249 ms. Remains 1771 /1817 variables (removed 46) and now considering 1621/1667 (removed 46) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2024-05-28 22:41:16] [INFO ] Computed 271 invariants in 11 ms
[2024-05-28 22:41:16] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-28 22:41:16] [INFO ] Invariant cache hit.
[2024-05-28 22:41:17] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 1728 ms to find 0 implicit places.
Running 1620 sub problems to find dead transitions.
[2024-05-28 22:41:17] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1770/3392 variables, and 0 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1771 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1770/3392 variables, and 0 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1771 constraints, PredecessorRefiner: 0/1620 constraints, Known Traps: 0/0 constraints]
After SMT, in 60335ms problems are : Problem set: 0 solved, 1620 unsolved
Search for dead transitions found 0 dead transitions in 60348ms
Starting structural reductions in LTL mode, iteration 1 : 1771/1817 places, 1621/1667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62329 ms. Remains : 1771/1817 places, 1621/1667 transitions.
[2024-05-28 22:42:18] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:42:18] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:42:18] [INFO ] Input system was already deterministic with 1621 transitions.
[2024-05-28 22:42:18] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:42:18] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:42:18] [INFO ] Time to serialize gal into /tmp/CTLFireability3991346190812853842.gal : 6 ms
[2024-05-28 22:42:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11600701838628911638.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3991346190812853842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11600701838628911638.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:42:48] [INFO ] Flatten gal took : 32 ms
[2024-05-28 22:42:48] [INFO ] Applying decomposition
[2024-05-28 22:42:48] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3071505459649483352.txt' '-o' '/tmp/graph3071505459649483352.bin' '-w' '/tmp/graph3071505459649483352.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3071505459649483352.bin' '-l' '-1' '-v' '-w' '/tmp/graph3071505459649483352.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:42:48] [INFO ] Decomposing Gal with order
[2024-05-28 22:42:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:42:48] [INFO ] Removed a total of 301 redundant transitions.
[2024-05-28 22:42:48] [INFO ] Flatten gal took : 57 ms
[2024-05-28 22:42:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-28 22:42:48] [INFO ] Time to serialize gal into /tmp/CTLFireability1338878292402796976.gal : 10 ms
[2024-05-28 22:42:48] [INFO ] Time to serialize properties into /tmp/CTLFireability649102330861447977.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1338878292402796976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability649102330861447977.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1776 transition count 1626
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1776 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1775 transition count 1625
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1775 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1774 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1774 transition count 1624
Applied a total of 86 rules in 247 ms. Remains 1774 /1817 variables (removed 43) and now considering 1624/1667 (removed 43) transitions.
// Phase 1: matrix 1624 rows 1774 cols
[2024-05-28 22:43:19] [INFO ] Computed 271 invariants in 10 ms
[2024-05-28 22:43:19] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-28 22:43:19] [INFO ] Invariant cache hit.
[2024-05-28 22:43:20] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
Running 1623 sub problems to find dead transitions.
[2024-05-28 22:43:20] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1774 constraints, PredecessorRefiner: 1623/1623 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1774 constraints, PredecessorRefiner: 0/1623 constraints, Known Traps: 0/0 constraints]
After SMT, in 60331ms problems are : Problem set: 0 solved, 1623 unsolved
Search for dead transitions found 0 dead transitions in 60346ms
Starting structural reductions in LTL mode, iteration 1 : 1774/1817 places, 1624/1667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62352 ms. Remains : 1774/1817 places, 1624/1667 transitions.
[2024-05-28 22:44:21] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:44:21] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:44:21] [INFO ] Input system was already deterministic with 1624 transitions.
[2024-05-28 22:44:21] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:44:21] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:44:21] [INFO ] Time to serialize gal into /tmp/CTLFireability173976237211223176.gal : 7 ms
[2024-05-28 22:44:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7773581471151017191.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability173976237211223176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7773581471151017191.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:44:51] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:44:51] [INFO ] Applying decomposition
[2024-05-28 22:44:51] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12931178733155235013.txt' '-o' '/tmp/graph12931178733155235013.bin' '-w' '/tmp/graph12931178733155235013.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12931178733155235013.bin' '-l' '-1' '-v' '-w' '/tmp/graph12931178733155235013.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:44:51] [INFO ] Decomposing Gal with order
[2024-05-28 22:44:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:44:51] [INFO ] Removed a total of 293 redundant transitions.
[2024-05-28 22:44:51] [INFO ] Flatten gal took : 55 ms
[2024-05-28 22:44:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-28 22:44:51] [INFO ] Time to serialize gal into /tmp/CTLFireability12286724377246914619.gal : 14 ms
[2024-05-28 22:44:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6337327926255537994.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12286724377246914619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6337327926255537994.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1776 transition count 1626
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1776 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1775 transition count 1625
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1775 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1774 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1774 transition count 1624
Applied a total of 86 rules in 237 ms. Remains 1774 /1817 variables (removed 43) and now considering 1624/1667 (removed 43) transitions.
// Phase 1: matrix 1624 rows 1774 cols
[2024-05-28 22:45:22] [INFO ] Computed 271 invariants in 11 ms
[2024-05-28 22:45:22] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-28 22:45:22] [INFO ] Invariant cache hit.
[2024-05-28 22:45:23] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1652 ms to find 0 implicit places.
Running 1623 sub problems to find dead transitions.
[2024-05-28 22:45:23] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1774 constraints, PredecessorRefiner: 1623/1623 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1774 constraints, PredecessorRefiner: 0/1623 constraints, Known Traps: 0/0 constraints]
After SMT, in 60339ms problems are : Problem set: 0 solved, 1623 unsolved
Search for dead transitions found 0 dead transitions in 60358ms
Starting structural reductions in LTL mode, iteration 1 : 1774/1817 places, 1624/1667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62251 ms. Remains : 1774/1817 places, 1624/1667 transitions.
[2024-05-28 22:46:24] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:46:24] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:46:24] [INFO ] Input system was already deterministic with 1624 transitions.
[2024-05-28 22:46:24] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:46:24] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:46:24] [INFO ] Time to serialize gal into /tmp/CTLFireability8281115926433944904.gal : 5 ms
[2024-05-28 22:46:24] [INFO ] Time to serialize properties into /tmp/CTLFireability5853527600024798283.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8281115926433944904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5853527600024798283.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:46:54] [INFO ] Flatten gal took : 30 ms
[2024-05-28 22:46:54] [INFO ] Applying decomposition
[2024-05-28 22:46:54] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11259529544310194184.txt' '-o' '/tmp/graph11259529544310194184.bin' '-w' '/tmp/graph11259529544310194184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11259529544310194184.bin' '-l' '-1' '-v' '-w' '/tmp/graph11259529544310194184.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:46:54] [INFO ] Decomposing Gal with order
[2024-05-28 22:46:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:46:54] [INFO ] Removed a total of 298 redundant transitions.
[2024-05-28 22:46:54] [INFO ] Flatten gal took : 65 ms
[2024-05-28 22:46:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-28 22:46:54] [INFO ] Time to serialize gal into /tmp/CTLFireability10292340044504177283.gal : 14 ms
[2024-05-28 22:46:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17709631669077892401.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10292340044504177283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17709631669077892401.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 376 transitions
Trivial Post-agglo rules discarded 376 transitions
Performed 376 trivial Post agglomeration. Transition count delta: 376
Iterating post reduction 0 with 376 rules applied. Total rules applied 376 place count 1816 transition count 1290
Reduce places removed 376 places and 0 transitions.
Iterating post reduction 1 with 376 rules applied. Total rules applied 752 place count 1440 transition count 1290
Performed 218 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 218 Pre rules applied. Total rules applied 752 place count 1440 transition count 1072
Deduced a syphon composed of 218 places in 1 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 2 with 436 rules applied. Total rules applied 1188 place count 1222 transition count 1072
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1217 place count 1193 transition count 1043
Iterating global reduction 2 with 29 rules applied. Total rules applied 1246 place count 1193 transition count 1043
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 1246 place count 1193 transition count 1024
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 1284 place count 1174 transition count 1024
Performed 481 Post agglomeration using F-continuation condition.Transition count delta: 481
Deduced a syphon composed of 481 places in 1 ms
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 2 with 962 rules applied. Total rules applied 2246 place count 693 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2247 place count 693 transition count 542
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2249 place count 692 transition count 541
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2251 place count 690 transition count 539
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2253 place count 688 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2253 place count 688 transition count 538
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2255 place count 687 transition count 538
Applied a total of 2255 rules in 214 ms. Remains 687 /1817 variables (removed 1130) and now considering 538/1667 (removed 1129) transitions.
// Phase 1: matrix 538 rows 687 cols
[2024-05-28 22:47:24] [INFO ] Computed 269 invariants in 3 ms
[2024-05-28 22:47:25] [INFO ] Implicit Places using invariants in 292 ms returned [673]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 293 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 686/1817 places, 538/1667 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 685 transition count 537
Applied a total of 2 rules in 26 ms. Remains 685 /686 variables (removed 1) and now considering 537/538 (removed 1) transitions.
// Phase 1: matrix 537 rows 685 cols
[2024-05-28 22:47:25] [INFO ] Computed 268 invariants in 2 ms
[2024-05-28 22:47:25] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-28 22:47:25] [INFO ] Invariant cache hit.
[2024-05-28 22:47:26] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 685/1817 places, 537/1667 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1307 ms. Remains : 685/1817 places, 537/1667 transitions.
[2024-05-28 22:47:26] [INFO ] Flatten gal took : 11 ms
[2024-05-28 22:47:26] [INFO ] Flatten gal took : 13 ms
[2024-05-28 22:47:26] [INFO ] Input system was already deterministic with 537 transitions.
[2024-05-28 22:47:26] [INFO ] Flatten gal took : 24 ms
[2024-05-28 22:47:26] [INFO ] Flatten gal took : 24 ms
[2024-05-28 22:47:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5613518522044013572.gal : 3 ms
[2024-05-28 22:47:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9134461494009920850.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5613518522044013572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9134461494009920850.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 32958 steps (6 resets) in 366 ms. (89 steps per ms) remains 0/1 properties
FORMULA ShieldIIPt-PT-030B-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 1777 transition count 1627
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 1777 transition count 1627
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1776 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1776 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1775 transition count 1625
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1775 transition count 1625
Applied a total of 84 rules in 240 ms. Remains 1775 /1817 variables (removed 42) and now considering 1625/1667 (removed 42) transitions.
// Phase 1: matrix 1625 rows 1775 cols
[2024-05-28 22:47:26] [INFO ] Computed 271 invariants in 12 ms
[2024-05-28 22:47:26] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-28 22:47:26] [INFO ] Invariant cache hit.
[2024-05-28 22:47:28] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
Running 1624 sub problems to find dead transitions.
[2024-05-28 22:47:28] [INFO ] Invariant cache hit.
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 1774/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1624 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1775 constraints, PredecessorRefiner: 1624/1624 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1624 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 1774/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1624 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1775 constraints, PredecessorRefiner: 0/1624 constraints, Known Traps: 0/0 constraints]
After SMT, in 60338ms problems are : Problem set: 0 solved, 1624 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Starting structural reductions in LTL mode, iteration 1 : 1775/1817 places, 1625/1667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62455 ms. Remains : 1775/1817 places, 1625/1667 transitions.
[2024-05-28 22:48:28] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:48:28] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:48:28] [INFO ] Input system was already deterministic with 1625 transitions.
[2024-05-28 22:48:28] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:48:28] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:48:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11376007711305491913.gal : 5 ms
[2024-05-28 22:48:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3521871720005803607.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11376007711305491913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3521871720005803607.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:48:59] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:48:59] [INFO ] Applying decomposition
[2024-05-28 22:48:59] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11101167091455543667.txt' '-o' '/tmp/graph11101167091455543667.bin' '-w' '/tmp/graph11101167091455543667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11101167091455543667.bin' '-l' '-1' '-v' '-w' '/tmp/graph11101167091455543667.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:48:59] [INFO ] Decomposing Gal with order
[2024-05-28 22:48:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:48:59] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-28 22:48:59] [INFO ] Flatten gal took : 59 ms
[2024-05-28 22:48:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 22:48:59] [INFO ] Time to serialize gal into /tmp/CTLFireability12802681249602155443.gal : 11 ms
[2024-05-28 22:48:59] [INFO ] Time to serialize properties into /tmp/CTLFireability6670446411844030832.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12802681249602155443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6670446411844030832.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 1777 transition count 1627
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 1777 transition count 1627
Applied a total of 80 rules in 129 ms. Remains 1777 /1817 variables (removed 40) and now considering 1627/1667 (removed 40) transitions.
// Phase 1: matrix 1627 rows 1777 cols
[2024-05-28 22:49:29] [INFO ] Computed 271 invariants in 4 ms
[2024-05-28 22:49:29] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-28 22:49:29] [INFO ] Invariant cache hit.
[2024-05-28 22:49:31] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-28 22:49:31] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1776/3404 variables, and 0 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1777 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1776/3404 variables, and 0 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1777 constraints, PredecessorRefiner: 0/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Starting structural reductions in LTL mode, iteration 1 : 1777/1817 places, 1627/1667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62361 ms. Remains : 1777/1817 places, 1627/1667 transitions.
[2024-05-28 22:50:31] [INFO ] Flatten gal took : 27 ms
[2024-05-28 22:50:31] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:50:31] [INFO ] Input system was already deterministic with 1627 transitions.
[2024-05-28 22:50:31] [INFO ] Flatten gal took : 27 ms
[2024-05-28 22:50:31] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:50:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15825115472546323411.gal : 5 ms
[2024-05-28 22:50:31] [INFO ] Time to serialize properties into /tmp/CTLFireability4476617945949188642.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15825115472546323411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4476617945949188642.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:51:02] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:51:02] [INFO ] Applying decomposition
[2024-05-28 22:51:02] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16477409552489997589.txt' '-o' '/tmp/graph16477409552489997589.bin' '-w' '/tmp/graph16477409552489997589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16477409552489997589.bin' '-l' '-1' '-v' '-w' '/tmp/graph16477409552489997589.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:51:02] [INFO ] Decomposing Gal with order
[2024-05-28 22:51:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:51:02] [INFO ] Removed a total of 297 redundant transitions.
[2024-05-28 22:51:02] [INFO ] Flatten gal took : 51 ms
[2024-05-28 22:51:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 22:51:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12502359700605236956.gal : 13 ms
[2024-05-28 22:51:02] [INFO ] Time to serialize properties into /tmp/CTLFireability3971363737187089685.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12502359700605236956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3971363737187089685.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 372 transitions
Trivial Post-agglo rules discarded 372 transitions
Performed 372 trivial Post agglomeration. Transition count delta: 372
Iterating post reduction 0 with 372 rules applied. Total rules applied 372 place count 1816 transition count 1294
Reduce places removed 372 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 373 rules applied. Total rules applied 745 place count 1444 transition count 1293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 746 place count 1443 transition count 1293
Performed 218 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 218 Pre rules applied. Total rules applied 746 place count 1443 transition count 1075
Deduced a syphon composed of 218 places in 1 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 3 with 436 rules applied. Total rules applied 1182 place count 1225 transition count 1075
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1212 place count 1195 transition count 1045
Iterating global reduction 3 with 30 rules applied. Total rules applied 1242 place count 1195 transition count 1045
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1242 place count 1195 transition count 1025
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1282 place count 1175 transition count 1025
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 478
Deduced a syphon composed of 478 places in 0 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 3 with 956 rules applied. Total rules applied 2238 place count 697 transition count 547
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2239 place count 697 transition count 546
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2241 place count 695 transition count 544
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2242 place count 694 transition count 544
Applied a total of 2242 rules in 169 ms. Remains 694 /1817 variables (removed 1123) and now considering 544/1667 (removed 1123) transitions.
// Phase 1: matrix 544 rows 694 cols
[2024-05-28 22:51:32] [INFO ] Computed 270 invariants in 2 ms
[2024-05-28 22:51:32] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-28 22:51:32] [INFO ] Invariant cache hit.
[2024-05-28 22:51:33] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2024-05-28 22:51:33] [INFO ] Redundant transitions in 11 ms returned []
Running 541 sub problems to find dead transitions.
[2024-05-28 22:51:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/692 variables, 260/260 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/692 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 2/694 variables, 10/270 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 22:51:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-28 22:51:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 544/1238 variables, 694/967 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1238/1238 variables, and 967 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 694/694 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/692 variables, 260/260 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/692 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/692 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (OVERLAPS) 2/694 variables, 10/273 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 544/1238 variables, 694/967 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1238 variables, 541/1508 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1238/1238 variables, and 1508 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 694/694 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 3/3 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in SI_CTL mode, iteration 1 : 694/1817 places, 544/1667 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61081 ms. Remains : 694/1817 places, 544/1667 transitions.
[2024-05-28 22:52:33] [INFO ] Flatten gal took : 12 ms
[2024-05-28 22:52:33] [INFO ] Flatten gal took : 12 ms
[2024-05-28 22:52:33] [INFO ] Input system was already deterministic with 544 transitions.
[2024-05-28 22:52:33] [INFO ] Flatten gal took : 12 ms
[2024-05-28 22:52:33] [INFO ] Flatten gal took : 12 ms
[2024-05-28 22:52:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16629455853919240568.gal : 3 ms
[2024-05-28 22:52:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7711331833862762655.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16629455853919240568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7711331833862762655.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.34805e+105,0.811903,30040,2,2511,5,111170,6,0,3321,150262,0


Converting to forward existential form...Done !
original formula: AF(((p2064==1) * (AF((p699!=1)) + (p379!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((p2064==1) * (!(EG(!((p699!=1)))) + (p379!=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t9, t31, t117, t120, t122, t124, t127, t130, t132, t133, t136, t138, t141...323
Detected timeout of ITS tools.
[2024-05-28 22:53:03] [INFO ] Flatten gal took : 17 ms
[2024-05-28 22:53:03] [INFO ] Applying decomposition
[2024-05-28 22:53:03] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1176061857142064498.txt' '-o' '/tmp/graph1176061857142064498.bin' '-w' '/tmp/graph1176061857142064498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1176061857142064498.bin' '-l' '-1' '-v' '-w' '/tmp/graph1176061857142064498.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:53:03] [INFO ] Decomposing Gal with order
[2024-05-28 22:53:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:53:03] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-28 22:53:03] [INFO ] Flatten gal took : 19 ms
[2024-05-28 22:53:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 22:53:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10788563183071257855.gal : 3 ms
[2024-05-28 22:53:03] [INFO ] Time to serialize properties into /tmp/CTLFireability1985226265467147512.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10788563183071257855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1985226265467147512.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.34805e+105,0.56161,26428,167,22,47589,174,717,102870,41,753,0


Converting to forward existential form...Done !
original formula: AF(((i29.i0.u238.p2064==1) * (AF((i9.i1.u79.p699!=1)) + (i5.u41.p379!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((i29.i0.u238.p2064==1) * (!(EG(!((i9.i1.u79.p699!=1)))) + (i5.u41.p379!=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t438, i0.i0.u2.t0, i0.i0.u5.t117, i0.i0.u6.t120, i0.i0.u7.t122, i0.i0.u8.t124, i1.i0.u14.t130...587
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1776 transition count 1626
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1776 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1775 transition count 1625
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1775 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1774 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1774 transition count 1624
Applied a total of 86 rules in 250 ms. Remains 1774 /1817 variables (removed 43) and now considering 1624/1667 (removed 43) transitions.
// Phase 1: matrix 1624 rows 1774 cols
[2024-05-28 22:53:34] [INFO ] Computed 271 invariants in 12 ms
[2024-05-28 22:53:34] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-28 22:53:34] [INFO ] Invariant cache hit.
[2024-05-28 22:53:35] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
Running 1623 sub problems to find dead transitions.
[2024-05-28 22:53:35] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1774 constraints, PredecessorRefiner: 1623/1623 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1623 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1774 constraints, PredecessorRefiner: 0/1623 constraints, Known Traps: 0/0 constraints]
After SMT, in 60357ms problems are : Problem set: 0 solved, 1623 unsolved
Search for dead transitions found 0 dead transitions in 60371ms
Starting structural reductions in LTL mode, iteration 1 : 1774/1817 places, 1624/1667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62200 ms. Remains : 1774/1817 places, 1624/1667 transitions.
[2024-05-28 22:54:36] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:54:36] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:54:36] [INFO ] Input system was already deterministic with 1624 transitions.
[2024-05-28 22:54:36] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:54:36] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:54:36] [INFO ] Time to serialize gal into /tmp/CTLFireability8982980723453102525.gal : 5 ms
[2024-05-28 22:54:36] [INFO ] Time to serialize properties into /tmp/CTLFireability1341134052475564024.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8982980723453102525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1341134052475564024.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:55:06] [INFO ] Flatten gal took : 30 ms
[2024-05-28 22:55:06] [INFO ] Applying decomposition
[2024-05-28 22:55:06] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17982209311970055867.txt' '-o' '/tmp/graph17982209311970055867.bin' '-w' '/tmp/graph17982209311970055867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17982209311970055867.bin' '-l' '-1' '-v' '-w' '/tmp/graph17982209311970055867.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:55:06] [INFO ] Decomposing Gal with order
[2024-05-28 22:55:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:55:06] [INFO ] Removed a total of 298 redundant transitions.
[2024-05-28 22:55:06] [INFO ] Flatten gal took : 48 ms
[2024-05-28 22:55:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 22:55:06] [INFO ] Time to serialize gal into /tmp/CTLFireability3370273504488210418.gal : 8 ms
[2024-05-28 22:55:06] [INFO ] Time to serialize properties into /tmp/CTLFireability8978446517586140789.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3370273504488210418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8978446517586140789.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1776 transition count 1626
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1776 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1775 transition count 1625
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1775 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1774 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1774 transition count 1624
Applied a total of 86 rules in 249 ms. Remains 1774 /1817 variables (removed 43) and now considering 1624/1667 (removed 43) transitions.
// Phase 1: matrix 1624 rows 1774 cols
[2024-05-28 22:55:36] [INFO ] Computed 271 invariants in 6 ms
[2024-05-28 22:55:37] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-28 22:55:37] [INFO ] Invariant cache hit.
[2024-05-28 22:55:38] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
Running 1623 sub problems to find dead transitions.
[2024-05-28 22:55:38] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1774 constraints, PredecessorRefiner: 1623/1623 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1774 constraints, PredecessorRefiner: 0/1623 constraints, Known Traps: 0/0 constraints]
After SMT, in 60358ms problems are : Problem set: 0 solved, 1623 unsolved
Search for dead transitions found 0 dead transitions in 60376ms
Starting structural reductions in LTL mode, iteration 1 : 1774/1817 places, 1624/1667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62432 ms. Remains : 1774/1817 places, 1624/1667 transitions.
[2024-05-28 22:56:39] [INFO ] Flatten gal took : 26 ms
[2024-05-28 22:56:39] [INFO ] Flatten gal took : 27 ms
[2024-05-28 22:56:39] [INFO ] Input system was already deterministic with 1624 transitions.
[2024-05-28 22:56:39] [INFO ] Flatten gal took : 27 ms
[2024-05-28 22:56:39] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:56:39] [INFO ] Time to serialize gal into /tmp/CTLFireability11272064306363308720.gal : 5 ms
[2024-05-28 22:56:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7409093722467276415.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11272064306363308720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7409093722467276415.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:57:09] [INFO ] Flatten gal took : 33 ms
[2024-05-28 22:57:09] [INFO ] Applying decomposition
[2024-05-28 22:57:09] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8872820077091563914.txt' '-o' '/tmp/graph8872820077091563914.bin' '-w' '/tmp/graph8872820077091563914.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8872820077091563914.bin' '-l' '-1' '-v' '-w' '/tmp/graph8872820077091563914.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:57:09] [INFO ] Decomposing Gal with order
[2024-05-28 22:57:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:57:09] [INFO ] Removed a total of 296 redundant transitions.
[2024-05-28 22:57:09] [INFO ] Flatten gal took : 47 ms
[2024-05-28 22:57:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 22:57:09] [INFO ] Time to serialize gal into /tmp/CTLFireability15924449885795726255.gal : 9 ms
[2024-05-28 22:57:09] [INFO ] Time to serialize properties into /tmp/CTLFireability10458872266822779304.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15924449885795726255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10458872266822779304.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 376 transitions
Trivial Post-agglo rules discarded 376 transitions
Performed 376 trivial Post agglomeration. Transition count delta: 376
Iterating post reduction 0 with 376 rules applied. Total rules applied 376 place count 1816 transition count 1290
Reduce places removed 376 places and 0 transitions.
Iterating post reduction 1 with 376 rules applied. Total rules applied 752 place count 1440 transition count 1290
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 217 Pre rules applied. Total rules applied 752 place count 1440 transition count 1073
Deduced a syphon composed of 217 places in 1 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 2 with 434 rules applied. Total rules applied 1186 place count 1223 transition count 1073
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1215 place count 1194 transition count 1044
Iterating global reduction 2 with 29 rules applied. Total rules applied 1244 place count 1194 transition count 1044
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 1244 place count 1194 transition count 1024
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 1284 place count 1174 transition count 1024
Performed 481 Post agglomeration using F-continuation condition.Transition count delta: 481
Deduced a syphon composed of 481 places in 1 ms
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 2 with 962 rules applied. Total rules applied 2246 place count 693 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2247 place count 693 transition count 542
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2249 place count 692 transition count 541
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2251 place count 690 transition count 539
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2253 place count 688 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2253 place count 688 transition count 538
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2255 place count 687 transition count 538
Applied a total of 2255 rules in 188 ms. Remains 687 /1817 variables (removed 1130) and now considering 538/1667 (removed 1129) transitions.
// Phase 1: matrix 538 rows 687 cols
[2024-05-28 22:57:39] [INFO ] Computed 269 invariants in 2 ms
[2024-05-28 22:57:40] [INFO ] Implicit Places using invariants in 272 ms returned [673]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 273 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 686/1817 places, 538/1667 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 685 transition count 537
Applied a total of 2 rules in 19 ms. Remains 685 /686 variables (removed 1) and now considering 537/538 (removed 1) transitions.
// Phase 1: matrix 537 rows 685 cols
[2024-05-28 22:57:40] [INFO ] Computed 268 invariants in 2 ms
[2024-05-28 22:57:40] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-28 22:57:40] [INFO ] Invariant cache hit.
[2024-05-28 22:57:40] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 685/1817 places, 537/1667 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1307 ms. Remains : 685/1817 places, 537/1667 transitions.
[2024-05-28 22:57:41] [INFO ] Flatten gal took : 20 ms
[2024-05-28 22:57:41] [INFO ] Flatten gal took : 12 ms
[2024-05-28 22:57:41] [INFO ] Input system was already deterministic with 537 transitions.
[2024-05-28 22:57:41] [INFO ] Flatten gal took : 19 ms
[2024-05-28 22:57:41] [INFO ] Flatten gal took : 13 ms
[2024-05-28 22:57:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3122261918764959172.gal : 3 ms
[2024-05-28 22:57:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6609944073515112549.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3122261918764959172.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6609944073515112549.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 25559 steps (5 resets) in 180 ms. (141 steps per ms) remains 0/1 properties
FORMULA ShieldIIPt-PT-030B-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 375 transitions
Trivial Post-agglo rules discarded 375 transitions
Performed 375 trivial Post agglomeration. Transition count delta: 375
Iterating post reduction 0 with 375 rules applied. Total rules applied 375 place count 1817 transition count 1292
Reduce places removed 375 places and 0 transitions.
Iterating post reduction 1 with 375 rules applied. Total rules applied 750 place count 1442 transition count 1292
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 217 Pre rules applied. Total rules applied 750 place count 1442 transition count 1075
Deduced a syphon composed of 217 places in 1 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 2 with 434 rules applied. Total rules applied 1184 place count 1225 transition count 1075
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 1214 place count 1195 transition count 1045
Iterating global reduction 2 with 30 rules applied. Total rules applied 1244 place count 1195 transition count 1045
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 1244 place count 1195 transition count 1025
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 1284 place count 1175 transition count 1025
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 1 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 2 with 960 rules applied. Total rules applied 2244 place count 695 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2245 place count 695 transition count 544
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2247 place count 694 transition count 543
Applied a total of 2247 rules in 157 ms. Remains 694 /1817 variables (removed 1123) and now considering 543/1667 (removed 1124) transitions.
// Phase 1: matrix 543 rows 694 cols
[2024-05-28 22:57:41] [INFO ] Computed 271 invariants in 1 ms
[2024-05-28 22:57:41] [INFO ] Implicit Places using invariants in 290 ms returned [683, 684]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 291 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 692/1817 places, 543/1667 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 692 transition count 542
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 691 transition count 542
Applied a total of 2 rules in 20 ms. Remains 691 /692 variables (removed 1) and now considering 542/543 (removed 1) transitions.
// Phase 1: matrix 542 rows 691 cols
[2024-05-28 22:57:41] [INFO ] Computed 269 invariants in 1 ms
[2024-05-28 22:57:41] [INFO ] Implicit Places using invariants in 277 ms returned [677]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 279 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 690/1817 places, 542/1667 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 689 transition count 541
Applied a total of 2 rules in 20 ms. Remains 689 /690 variables (removed 1) and now considering 541/542 (removed 1) transitions.
// Phase 1: matrix 541 rows 689 cols
[2024-05-28 22:57:41] [INFO ] Computed 268 invariants in 2 ms
[2024-05-28 22:57:42] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-28 22:57:42] [INFO ] Invariant cache hit.
[2024-05-28 22:57:42] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 689/1817 places, 541/1667 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1587 ms. Remains : 689/1817 places, 541/1667 transitions.
[2024-05-28 22:57:42] [INFO ] Flatten gal took : 17 ms
[2024-05-28 22:57:42] [INFO ] Flatten gal took : 17 ms
[2024-05-28 22:57:42] [INFO ] Input system was already deterministic with 541 transitions.
[2024-05-28 22:57:42] [INFO ] Flatten gal took : 17 ms
[2024-05-28 22:57:42] [INFO ] Flatten gal took : 17 ms
[2024-05-28 22:57:42] [INFO ] Time to serialize gal into /tmp/CTLFireability6883269051057852870.gal : 3 ms
[2024-05-28 22:57:42] [INFO ] Time to serialize properties into /tmp/CTLFireability11486089187359552389.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6883269051057852870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11486089187359552389.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.38008e+104,1.66711,55768,2,1896,5,194262,6,0,3299,349172,0


Converting to forward existential form...Done !
original formula: EF((E((p0==1) U ((p1009==1)&&(p1042==1))) + ((p1234==1)&&(p1293==1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),(p0==1)) * ((p1009==1)&&(p1042==1)))] != FALSE + [(FwdU(Init,TRUE) * ((p1234==1)&&(p1293...172
Hit Full ! (commute/partial/dont) 540/0/1
(forward)formula 0,1,1.75532,55768,1,0,7,194262,15,1,4764,349172,4
FORMULA ShieldIIPt-PT-030B-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1776 transition count 1626
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1776 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1775 transition count 1625
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1775 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1774 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1774 transition count 1624
Applied a total of 86 rules in 235 ms. Remains 1774 /1817 variables (removed 43) and now considering 1624/1667 (removed 43) transitions.
// Phase 1: matrix 1624 rows 1774 cols
[2024-05-28 22:57:44] [INFO ] Computed 271 invariants in 10 ms
[2024-05-28 22:57:45] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-28 22:57:45] [INFO ] Invariant cache hit.
[2024-05-28 22:57:46] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1719 ms to find 0 implicit places.
Running 1623 sub problems to find dead transitions.
[2024-05-28 22:57:46] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1774 constraints, PredecessorRefiner: 1623/1623 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1623 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1774 constraints, PredecessorRefiner: 0/1623 constraints, Known Traps: 0/0 constraints]
After SMT, in 60324ms problems are : Problem set: 0 solved, 1623 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Starting structural reductions in LTL mode, iteration 1 : 1774/1817 places, 1624/1667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62295 ms. Remains : 1774/1817 places, 1624/1667 transitions.
[2024-05-28 22:58:46] [INFO ] Flatten gal took : 27 ms
[2024-05-28 22:58:46] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:58:47] [INFO ] Input system was already deterministic with 1624 transitions.
[2024-05-28 22:58:47] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:58:47] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:58:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14583614606250122156.gal : 5 ms
[2024-05-28 22:58:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6093767516566293925.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14583614606250122156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6093767516566293925.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:59:17] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:59:17] [INFO ] Applying decomposition
[2024-05-28 22:59:17] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10029225839038575018.txt' '-o' '/tmp/graph10029225839038575018.bin' '-w' '/tmp/graph10029225839038575018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10029225839038575018.bin' '-l' '-1' '-v' '-w' '/tmp/graph10029225839038575018.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:59:17] [INFO ] Decomposing Gal with order
[2024-05-28 22:59:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:59:17] [INFO ] Removed a total of 298 redundant transitions.
[2024-05-28 22:59:17] [INFO ] Flatten gal took : 60 ms
[2024-05-28 22:59:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 22:59:17] [INFO ] Time to serialize gal into /tmp/CTLFireability7303686246304752336.gal : 10 ms
[2024-05-28 22:59:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4494468882634787241.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7303686246304752336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4494468882634787241.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1817/1817 places, 1667/1667 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 1777 transition count 1627
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 1777 transition count 1627
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1776 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1776 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1775 transition count 1625
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1775 transition count 1625
Applied a total of 84 rules in 236 ms. Remains 1775 /1817 variables (removed 42) and now considering 1625/1667 (removed 42) transitions.
// Phase 1: matrix 1625 rows 1775 cols
[2024-05-28 22:59:47] [INFO ] Computed 271 invariants in 15 ms
[2024-05-28 22:59:48] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-28 22:59:48] [INFO ] Invariant cache hit.
[2024-05-28 22:59:49] [INFO ] Implicit Places using invariants and state equation in 1269 ms returned []
Implicit Place search using SMT with State Equation took 1714 ms to find 0 implicit places.
Running 1624 sub problems to find dead transitions.
[2024-05-28 22:59:49] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1774/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1624 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1775 constraints, PredecessorRefiner: 1624/1624 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1624 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 1774/3400 variables, and 0 constraints, problems are : Problem set: 0 solved, 1624 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1775 constraints, PredecessorRefiner: 0/1624 constraints, Known Traps: 0/0 constraints]
After SMT, in 60315ms problems are : Problem set: 0 solved, 1624 unsolved
Search for dead transitions found 0 dead transitions in 60330ms
Starting structural reductions in LTL mode, iteration 1 : 1775/1817 places, 1625/1667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62285 ms. Remains : 1775/1817 places, 1625/1667 transitions.
[2024-05-28 23:00:49] [INFO ] Flatten gal took : 27 ms
[2024-05-28 23:00:49] [INFO ] Flatten gal took : 28 ms
[2024-05-28 23:00:49] [INFO ] Input system was already deterministic with 1625 transitions.
[2024-05-28 23:00:49] [INFO ] Flatten gal took : 27 ms
[2024-05-28 23:00:49] [INFO ] Flatten gal took : 27 ms
[2024-05-28 23:00:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16910152594145440197.gal : 5 ms
[2024-05-28 23:00:49] [INFO ] Time to serialize properties into /tmp/CTLFireability8125278452691318621.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16910152594145440197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8125278452691318621.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 23:01:20] [INFO ] Flatten gal took : 31 ms
[2024-05-28 23:01:20] [INFO ] Applying decomposition
[2024-05-28 23:01:20] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8241746433469405617.txt' '-o' '/tmp/graph8241746433469405617.bin' '-w' '/tmp/graph8241746433469405617.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8241746433469405617.bin' '-l' '-1' '-v' '-w' '/tmp/graph8241746433469405617.weights' '-q' '0' '-e' '0.001'
[2024-05-28 23:01:20] [INFO ] Decomposing Gal with order
[2024-05-28 23:01:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 23:01:20] [INFO ] Removed a total of 298 redundant transitions.
[2024-05-28 23:01:20] [INFO ] Flatten gal took : 48 ms
[2024-05-28 23:01:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 23:01:20] [INFO ] Time to serialize gal into /tmp/CTLFireability9720063889982573119.gal : 11 ms
[2024-05-28 23:01:20] [INFO ] Time to serialize properties into /tmp/CTLFireability11378918349065268005.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9720063889982573119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11378918349065268005.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 23:01:50] [INFO ] Flatten gal took : 32 ms
[2024-05-28 23:01:50] [INFO ] Flatten gal took : 29 ms
[2024-05-28 23:01:50] [INFO ] Applying decomposition
[2024-05-28 23:01:50] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10701697706321053016.txt' '-o' '/tmp/graph10701697706321053016.bin' '-w' '/tmp/graph10701697706321053016.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10701697706321053016.bin' '-l' '-1' '-v' '-w' '/tmp/graph10701697706321053016.weights' '-q' '0' '-e' '0.001'
[2024-05-28 23:01:50] [INFO ] Decomposing Gal with order
[2024-05-28 23:01:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 23:01:50] [INFO ] Removed a total of 275 redundant transitions.
[2024-05-28 23:01:50] [INFO ] Flatten gal took : 50 ms
[2024-05-28 23:01:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 23:01:50] [INFO ] Time to serialize gal into /tmp/CTLFireability8783859821477276273.gal : 9 ms
[2024-05-28 23:01:50] [INFO ] Time to serialize properties into /tmp/CTLFireability12980586468234645199.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8783859821477276273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12980586468234645199.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 23:09:59] [INFO ] Applying decomposition
[2024-05-28 23:09:59] [INFO ] Flatten gal took : 29 ms
[2024-05-28 23:09:59] [INFO ] Decomposing Gal with order
[2024-05-28 23:09:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 23:09:59] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-28 23:09:59] [INFO ] Flatten gal took : 44 ms
[2024-05-28 23:09:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 23:09:59] [INFO ] Time to serialize gal into /tmp/CTLFireability9951308708600434321.gal : 18 ms
[2024-05-28 23:09:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2489203565200962095.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9951308708600434321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2489203565200962095.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 23:19:23] [INFO ] Flatten gal took : 31 ms
[2024-05-28 23:19:23] [INFO ] Input system was already deterministic with 1667 transitions.
[2024-05-28 23:19:23] [INFO ] Transformed 1817 places.
[2024-05-28 23:19:23] [INFO ] Transformed 1667 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 23:19:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13043039579425681324.gal : 5 ms
[2024-05-28 23:19:23] [INFO ] Time to serialize properties into /tmp/CTLFireability8769995600336923886.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13043039579425681324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8769995600336923886.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3337873 ms.

BK_STOP 1716938959751

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

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

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