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-171683762301001.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 ShieldRVt-PT-030B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762301001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 364K 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 ShieldRVt-PT-030B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717080958208

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 14:55:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 14:55:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 14:55:59] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-30 14:55:59] [INFO ] Transformed 1503 places.
[2024-05-30 14:55:59] [INFO ] Transformed 1503 transitions.
[2024-05-30 14:55:59] [INFO ] Found NUPN structural information;
[2024-05-30 14:55:59] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 123 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 288 place count 1215 transition count 1215
Iterating global reduction 0 with 288 rules applied. Total rules applied 576 place count 1215 transition count 1215
Applied a total of 576 rules in 269 ms. Remains 1215 /1503 variables (removed 288) and now considering 1215/1503 (removed 288) transitions.
// Phase 1: matrix 1215 rows 1215 cols
[2024-05-30 14:56:00] [INFO ] Computed 121 invariants in 26 ms
[2024-05-30 14:56:00] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-30 14:56:00] [INFO ] Invariant cache hit.
[2024-05-30 14:56:01] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
Running 1214 sub problems to find dead transitions.
[2024-05-30 14:56:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 30299ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 30336ms
Starting structural reductions in LTL mode, iteration 1 : 1215/1503 places, 1215/1503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31912 ms. Remains : 1215/1503 places, 1215/1503 transitions.
Support contains 123 out of 1215 places after structural reductions.
[2024-05-30 14:56:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 14:56:31] [INFO ] Flatten gal took : 91 ms
[2024-05-30 14:56:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVt-PT-030B-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 14:56:31] [INFO ] Flatten gal took : 49 ms
[2024-05-30 14:56:32] [INFO ] Input system was already deterministic with 1215 transitions.
Support contains 86 out of 1215 places (down from 123) after GAL structural reductions.
FORMULA ShieldRVt-PT-030B-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1873 ms. (21 steps per ms) remains 25/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
[2024-05-30 14:56:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 916/972 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 243/1215 variables, 28/121 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1215 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1215/2430 variables, 1215/1336 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2430 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/2430 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2430/2430 variables, and 1336 constraints, problems are : Problem set: 0 solved, 25 unsolved in 2888 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1215/1215 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 916/972 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-30 14:56:36] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 30 ms to minimize.
[2024-05-30 14:56:36] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
[2024-05-30 14:56:36] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 3 ms to minimize.
[2024-05-30 14:56:36] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 3 ms to minimize.
[2024-05-30 14:56:36] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 3 ms to minimize.
[2024-05-30 14:56:36] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 3 ms to minimize.
[2024-05-30 14:56:36] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 3 ms to minimize.
[2024-05-30 14:56:37] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 3 ms to minimize.
[2024-05-30 14:56:37] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 3 ms to minimize.
[2024-05-30 14:56:37] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
[2024-05-30 14:56:37] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:56:37] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-30 14:56:37] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
[2024-05-30 14:56:37] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:56:37] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-30 14:56:37] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-30 14:56:38] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-05-30 14:56:38] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-05-30 14:56:38] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2024-05-30 14:56:38] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2024-05-30 14:56:38] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-05-30 14:56:39] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
[2024-05-30 14:56:39] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
[2024-05-30 14:56:39] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-05-30 14:56:39] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-30 14:56:39] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-05-30 14:56:39] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 243/1215 variables, 28/148 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-30 14:56:40] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-30 14:56:40] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1215/2430 variables, and 150 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 0/1215 constraints, PredecessorRefiner: 0/25 constraints, Known Traps: 29/29 constraints]
After SMT, in 7922ms problems are : Problem set: 0 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 1215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 296 rules applied. Total rules applied 296 place count 1215 transition count 919
Reduce places removed 296 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 302 rules applied. Total rules applied 598 place count 919 transition count 913
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 604 place count 913 transition count 913
Performed 209 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 209 Pre rules applied. Total rules applied 604 place count 913 transition count 704
Deduced a syphon composed of 209 places in 1 ms
Reduce places removed 209 places and 0 transitions.
Iterating global reduction 3 with 418 rules applied. Total rules applied 1022 place count 704 transition count 704
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1041 place count 685 transition count 685
Iterating global reduction 3 with 19 rules applied. Total rules applied 1060 place count 685 transition count 685
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 1060 place count 685 transition count 667
Deduced a syphon composed of 18 places in 7 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 1096 place count 667 transition count 667
Performed 261 Post agglomeration using F-continuation condition.Transition count delta: 261
Deduced a syphon composed of 261 places in 2 ms
Reduce places removed 261 places and 0 transitions.
Iterating global reduction 3 with 522 rules applied. Total rules applied 1618 place count 406 transition count 406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1619 place count 406 transition count 405
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1621 place count 405 transition count 404
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 1773 place count 329 transition count 461
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 1774 place count 329 transition count 460
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 1779 place count 329 transition count 455
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1784 place count 324 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1787 place count 324 transition count 452
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1788 place count 324 transition count 452
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1789 place count 323 transition count 451
Applied a total of 1789 rules in 253 ms. Remains 323 /1215 variables (removed 892) and now considering 451/1215 (removed 764) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 323/1215 places, 451/1215 transitions.
RANDOM walk for 40000 steps (10 resets) in 724 ms. (55 steps per ms) remains 11/25 properties
BEST_FIRST walk for 40004 steps (10 resets) in 175 ms. (227 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (10 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
// Phase 1: matrix 451 rows 323 cols
[2024-05-30 14:56:41] [INFO ] Computed 121 invariants in 2 ms
[2024-05-30 14:56:41] [INFO ] State equation strengthened by 166 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 203/231 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 22/253 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 373/626 variables, 253/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 143/486 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 127/753 variables, 57/543 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 24/567 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/753 variables, 17/584 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 4/757 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/757 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/757 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 4/761 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/761 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 13/774 variables, 11/602 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/774 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/774 variables, 6/610 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/774 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/774 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 610 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1191 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 323/323 constraints, ReadFeed: 166/166 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 203/231 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 22/253 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 373/626 variables, 253/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 143/486 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 8/494 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 127/753 variables, 57/551 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/753 variables, 24/575 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 17/592 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/753 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-30 14:56:43] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/753 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/753 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 4/757 variables, 3/598 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/757 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/757 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 4/761 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/761 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 13/774 variables, 11/613 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/774 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/774 variables, 6/621 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/774 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 0/774 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 621 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2198 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 323/323 constraints, ReadFeed: 166/166 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 3412ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1101 ms.
Support contains 28 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 451/451 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 323 transition count 444
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 316 transition count 444
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 14 place count 316 transition count 436
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 308 transition count 436
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 293 transition count 421
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 74 place count 286 transition count 429
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 286 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 285 transition count 428
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 282 transition count 425
Applied a total of 79 rules in 50 ms. Remains 282 /323 variables (removed 41) and now considering 425/451 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 282/323 places, 425/451 transitions.
RANDOM walk for 40000 steps (11 resets) in 328 ms. (121 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (9 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
// Phase 1: matrix 425 rows 282 cols
[2024-05-30 14:56:46] [INFO ] Computed 121 invariants in 2 ms
[2024-05-30 14:56:46] [INFO ] State equation strengthened by 176 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 179/204 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/218 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 354/572 variables, 218/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 163/470 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 121/693 variables, 56/526 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/693 variables, 28/554 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/693 variables, 13/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/693 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 14/707 variables, 8/575 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/707 variables, 4/579 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/707 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/707 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 579 constraints, problems are : Problem set: 0 solved, 8 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 282/282 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 179/204 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/218 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 354/572 variables, 218/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 163/470 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 6/476 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 121/693 variables, 56/532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/693 variables, 28/560 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/693 variables, 13/573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/693 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 14:56:48] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/693 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/693 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 14/707 variables, 8/584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/707 variables, 4/588 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/707 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/707 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 707/707 variables, and 588 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1549 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 282/282 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 2233ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1296 ms.
Support contains 25 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 425/425 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 423
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 280 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 279 transition count 422
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8 place count 278 transition count 422
Applied a total of 8 rules in 29 ms. Remains 278 /282 variables (removed 4) and now considering 422/425 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 278/282 places, 422/425 transitions.
RANDOM walk for 40000 steps (12 resets) in 278 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 472729 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :7 out of 8
Probabilistic random walk after 472729 steps, saw 293646 distinct states, run finished after 3012 ms. (steps per millisecond=156 ) properties seen :7
// Phase 1: matrix 422 rows 278 cols
[2024-05-30 14:56:53] [INFO ] Computed 121 invariants in 4 ms
[2024-05-30 14:56:53] [INFO ] State equation strengthened by 178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 158/173 variables, 71/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 269/442 variables, 173/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 148/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/505 variables, 22/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 10/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/506 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/506 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/576 variables, 24/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/576 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/576 variables, 6/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/576 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/581 variables, 3/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/581 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/581 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/583 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/583 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 65/648 variables, 28/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/648 variables, 7/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/648 variables, 10/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/648 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/652 variables, 4/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/652 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/654 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/654 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 32/686 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/686 variables, 6/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/686 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/686 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 1/687 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/687 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/687 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 3/690 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/690 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 6/696 variables, 5/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/696 variables, 3/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/696 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 1/697 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/697 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/697 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 2/699 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/699 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 1/700 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/700 variables, 4/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/700 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 0/700 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 700/700 variables, and 577 constraints, problems are : Problem set: 0 solved, 1 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 278/278 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 158/173 variables, 71/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 269/442 variables, 173/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 148/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/505 variables, 22/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 10/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/505 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/506 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/506 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 70/576 variables, 24/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/576 variables, 9/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/576 variables, 6/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/576 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/581 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/581 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/581 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/583 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/583 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 65/648 variables, 28/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/648 variables, 7/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/648 variables, 10/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/648 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/652 variables, 4/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/652 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/654 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/654 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 32/686 variables, 20/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/686 variables, 6/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/686 variables, 6/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/686 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1/687 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/687 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/687 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 3/690 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/690 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 6/696 variables, 5/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/696 variables, 3/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/696 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 1/697 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/697 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/697 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 2/699 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/699 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 1/700 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/700 variables, 4/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/700 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/700 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 700/700 variables, and 578 constraints, problems are : Problem set: 0 solved, 1 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 278/278 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 920ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 422/422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 278 transition count 414
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 270 transition count 414
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 16 place count 270 transition count 407
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 30 place count 263 transition count 407
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 44 place count 256 transition count 400
Renaming transitions due to excessive name length > 1024 char.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 252 transition count 405
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 246 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 245 transition count 399
Applied a total of 59 rules in 26 ms. Remains 245 /278 variables (removed 33) and now considering 399/422 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 245/278 places, 399/422 transitions.
RANDOM walk for 40000 steps (14 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 614531 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 1
Probabilistic random walk after 614531 steps, saw 391785 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
// Phase 1: matrix 399 rows 245 cols
[2024-05-30 14:56:57] [INFO ] Computed 120 invariants in 5 ms
[2024-05-30 14:56:57] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/47 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 123/170 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 166/336 variables, 64/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 136/472 variables, 52/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 26/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 93/565 variables, 40/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 20/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/565 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 55/620 variables, 24/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/620 variables, 12/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/620 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 24/644 variables, 12/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/644 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/644 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/644 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 245/245 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/47 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 123/170 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 166/336 variables, 64/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 136/472 variables, 52/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 26/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 93/565 variables, 40/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/565 variables, 20/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/565 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 55/620 variables, 24/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/620 variables, 12/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/620 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 24/644 variables, 12/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/644 variables, 6/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/644 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/644 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 367 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 245/245 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 371ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 399/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 245 /245 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 245/245 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 399/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 245 /245 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-30 14:56:58] [INFO ] Invariant cache hit.
[2024-05-30 14:56:58] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-30 14:56:58] [INFO ] Invariant cache hit.
[2024-05-30 14:56:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 14:56:58] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-30 14:56:58] [INFO ] Redundant transitions in 24 ms returned []
Running 396 sub problems to find dead transitions.
[2024-05-30 14:56:58] [INFO ] Invariant cache hit.
[2024-05-30 14:56:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 399/644 variables, 245/365 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/644 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/644 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 0/644 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 396 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 366 constraints, problems are : Problem set: 0 solved, 396 unsolved in 10478 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 245/245 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 399/644 variables, 245/365 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/644 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/644 variables, 396/762 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (OVERLAPS) 0/644 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 396 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 762 constraints, problems are : Problem set: 0 solved, 396 unsolved in 11914 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 245/245 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 0/0 constraints]
After SMT, in 22519ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 22526ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22927 ms. Remains : 245/245 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 245 vertex of which 4 / 245 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 828 edges and 243 vertex of which 241 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 105 edges and 239 vertex of which 4 / 239 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 237 transition count 390
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 104 edges and 235 vertex of which 6 / 235 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 232 transition count 381
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 102 edges and 229 vertex of which 8 / 229 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 225 transition count 370
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 98 edges and 221 vertex of which 6 / 221 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 218 transition count 356
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 95 edges and 215 vertex of which 6 / 215 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 16 rules applied. Total rules applied 70 place count 212 transition count 344
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 93 edges and 209 vertex of which 8 / 209 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 15 rules applied. Total rules applied 85 place count 205 transition count 333
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 90 edges and 201 vertex of which 10 / 201 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 104 place count 196 transition count 319
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (trivial) has 84 edges and 191 vertex of which 8 / 191 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 23 rules applied. Total rules applied 127 place count 187 transition count 302
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 80 edges and 183 vertex of which 8 / 183 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 146 place count 179 transition count 288
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 77 edges and 175 vertex of which 8 / 175 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 18 rules applied. Total rules applied 164 place count 171 transition count 275
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 73 edges and 167 vertex of which 6 / 167 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 10 with 17 rules applied. Total rules applied 181 place count 164 transition count 263
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 70 edges and 161 vertex of which 2 / 161 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 14 rules applied. Total rules applied 195 place count 160 transition count 253
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 69 edges and 159 vertex of which 2 / 159 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 12 with 7 rules applied. Total rules applied 202 place count 158 transition count 248
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 206 place count 157 transition count 245
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 3 Pre rules applied. Total rules applied 206 place count 157 transition count 242
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 214 place count 152 transition count 242
Graph (trivial) has 67 edges and 152 vertex of which 4 / 152 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 216 place count 149 transition count 242
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 64 edges and 149 vertex of which 2 / 149 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 222 place count 148 transition count 237
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 227 place count 147 transition count 233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 227 place count 147 transition count 232
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 230 place count 145 transition count 232
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 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 233 place count 143 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 61 edges and 143 vertex of which 2 / 143 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 16 with 4 rules applied. Total rules applied 237 place count 142 transition count 228
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 61 edges and 141 vertex of which 2 / 141 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 17 with 4 rules applied. Total rules applied 241 place count 140 transition count 226
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Remove reverse transitions (loop back) rule discarded transition t181.t367 and 2 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 245 place count 137 transition count 221
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 2 places and 0 transitions.
Iterating global reduction 19 with 3 rules applied. Total rules applied 248 place count 135 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 252 place count 135 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 254 place count 135 transition count 214
Applied a total of 254 rules in 64 ms. Remains 135 /245 variables (removed 110) and now considering 214/399 (removed 185) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 214 rows 135 cols
[2024-05-30 14:57:21] [INFO ] Computed 66 invariants in 1 ms
[2024-05-30 14:57:21] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 14:57:21] [INFO ] [Nat]Absence check using 66 positive place invariants in 7 ms returned sat
[2024-05-30 14:57:21] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 14:57:21] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 14:57:21] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 206 ms.
[2024-05-30 14:57:21] [INFO ] Flatten gal took : 39 ms
[2024-05-30 14:57:21] [INFO ] Flatten gal took : 39 ms
[2024-05-30 14:57:21] [INFO ] Input system was already deterministic with 1215 transitions.
Computed a total of 370 stabilizing places and 370 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1174 transition count 1174
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1172 transition count 1172
Applied a total of 86 rules in 134 ms. Remains 1172 /1215 variables (removed 43) and now considering 1172/1215 (removed 43) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2024-05-30 14:57:21] [INFO ] Computed 121 invariants in 12 ms
[2024-05-30 14:57:21] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-30 14:57:21] [INFO ] Invariant cache hit.
[2024-05-30 14:57:22] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
Running 1171 sub problems to find dead transitions.
[2024-05-30 14:57:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1171 unsolved
SMT process timed out in 30162ms, After SMT, problems are : Problem set: 0 solved, 1171 unsolved
Search for dead transitions found 0 dead transitions in 30172ms
Starting structural reductions in LTL mode, iteration 1 : 1172/1215 places, 1172/1215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31303 ms. Remains : 1172/1215 places, 1172/1215 transitions.
[2024-05-30 14:57:52] [INFO ] Flatten gal took : 30 ms
[2024-05-30 14:57:52] [INFO ] Flatten gal took : 30 ms
[2024-05-30 14:57:52] [INFO ] Input system was already deterministic with 1172 transitions.
[2024-05-30 14:57:52] [INFO ] Flatten gal took : 26 ms
[2024-05-30 14:57:52] [INFO ] Flatten gal took : 26 ms
[2024-05-30 14:57:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality8410872855053219650.gal : 16 ms
[2024-05-30 14:57:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality6169271897476737763.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/CTLCardinality8410872855053219650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6169271897476737763.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-30 14:58:23] [INFO ] Flatten gal took : 26 ms
[2024-05-30 14:58:23] [INFO ] Applying decomposition
[2024-05-30 14:58:23] [INFO ] Flatten gal took : 26 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/graph12175077761695593892.txt' '-o' '/tmp/graph12175077761695593892.bin' '-w' '/tmp/graph12175077761695593892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12175077761695593892.bin' '-l' '-1' '-v' '-w' '/tmp/graph12175077761695593892.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:58:23] [INFO ] Decomposing Gal with order
[2024-05-30 14:58:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:58:23] [INFO ] Removed a total of 302 redundant transitions.
[2024-05-30 14:58:23] [INFO ] Flatten gal took : 93 ms
[2024-05-30 14:58:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-30 14:58:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality12417564442142501315.gal : 19 ms
[2024-05-30 14:58:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality9157255658000858540.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/CTLCardinality12417564442142501315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9157255658000858540.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 : 1215/1215 places, 1215/1215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 1214 transition count 884
Reduce places removed 330 places and 0 transitions.
Iterating post reduction 1 with 330 rules applied. Total rules applied 660 place count 884 transition count 884
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 220 Pre rules applied. Total rules applied 660 place count 884 transition count 664
Deduced a syphon composed of 220 places in 1 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 2 with 440 rules applied. Total rules applied 1100 place count 664 transition count 664
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 1131 place count 633 transition count 633
Iterating global reduction 2 with 31 rules applied. Total rules applied 1162 place count 633 transition count 633
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 1162 place count 633 transition count 607
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 1214 place count 607 transition count 607
Performed 236 Post agglomeration using F-continuation condition.Transition count delta: 236
Deduced a syphon composed of 236 places in 0 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1686 place count 371 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1687 place count 371 transition count 370
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 1689 place count 370 transition count 369
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1691 place count 368 transition count 367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1692 place count 367 transition count 367
Applied a total of 1692 rules in 96 ms. Remains 367 /1215 variables (removed 848) and now considering 367/1215 (removed 848) transitions.
// Phase 1: matrix 367 rows 367 cols
[2024-05-30 14:58:53] [INFO ] Computed 120 invariants in 1 ms
[2024-05-30 14:58:53] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-30 14:58:53] [INFO ] Invariant cache hit.
[2024-05-30 14:58:54] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-05-30 14:58:54] [INFO ] Redundant transitions in 2 ms returned []
Running 364 sub problems to find dead transitions.
[2024-05-30 14:58:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 2/367 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 367/734 variables, 367/487 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/734 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (OVERLAPS) 0/734 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/734 variables, and 487 constraints, problems are : Problem set: 0 solved, 364 unsolved in 17734 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 2/367 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 367/734 variables, 367/487 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/734 variables, 364/851 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (OVERLAPS) 0/734 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Int declared 734/734 variables, and 851 constraints, problems are : Problem set: 0 solved, 364 unsolved in 20100 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints]
After SMT, in 37874ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 37878ms
Starting structural reductions in SI_CTL mode, iteration 1 : 367/1215 places, 367/1215 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38379 ms. Remains : 367/1215 places, 367/1215 transitions.
[2024-05-30 14:59:32] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:59:32] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:59:32] [INFO ] Input system was already deterministic with 367 transitions.
[2024-05-30 14:59:32] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:59:32] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:59:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality4881804893404694436.gal : 2 ms
[2024-05-30 14:59:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality15495845169045159224.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/CTLCardinality4881804893404694436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15495845169045159224.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,3.78629e+57,0.211033,11008,2,1221,5,29283,6,0,1836,38615,0


Converting to forward existential form...Done !
original formula: !(E(((((p622==0) + EF((p465==1))) + ((p1315==0)||(p1113==1))) * (p795==0)) U AF((p1191!=0))))
=> equivalent forward existential formula: [(FwdU(Init,((((p622==0) + E(TRUE U (p465==1))) + ((p1315==0)||(p1113==1))) * (p795==0))) * !(EG(!((p1191!=0))))...165
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t8, t10, t13, t16, t19, t21, t24, t27, t30, t32, t36, t39, t41, t44, t46, t49, t51, t...676
Detected timeout of ITS tools.
[2024-05-30 15:00:02] [INFO ] Flatten gal took : 10 ms
[2024-05-30 15:00:02] [INFO ] Applying decomposition
[2024-05-30 15:00:02] [INFO ] Flatten gal took : 9 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/graph16696943757299903418.txt' '-o' '/tmp/graph16696943757299903418.bin' '-w' '/tmp/graph16696943757299903418.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16696943757299903418.bin' '-l' '-1' '-v' '-w' '/tmp/graph16696943757299903418.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:00:02] [INFO ] Decomposing Gal with order
[2024-05-30 15:00:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:00:02] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-30 15:00:02] [INFO ] Flatten gal took : 15 ms
[2024-05-30 15:00:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 15:00:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality2161576145107526521.gal : 3 ms
[2024-05-30 15:00:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality16062361733631181278.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/CTLCardinality2161576145107526521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16062361733631181278.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,3.78629e+57,0.097542,6984,215,21,5979,107,446,12169,41,240,0


Converting to forward existential form...Done !
original formula: !(E(((((i7.u49.p622==0) + EF((i4.u36.p465==1))) + ((i16.i0.u109.p1315==0)||(i14.u90.p1113==1))) * (i9.i0.u64.p795==0)) U AF((i13.i1.u98.p...166
=> equivalent forward existential formula: [(FwdU(Init,((((i7.u49.p622==0) + E(TRUE U (i4.u36.p465==1))) + ((i16.i0.u109.p1315==0)||(i14.u90.p1113==1))) * ...220
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u1.t8, i0.i0.u2.t10, i0.i0.u3.t13, i0.i0.u4.t16, i0.i1.u5.t19, i0.i1.u6.t21, i0.i1.u7.t...1544
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 334 place count 1214 transition count 880
Reduce places removed 334 places and 0 transitions.
Iterating post reduction 1 with 334 rules applied. Total rules applied 668 place count 880 transition count 880
Performed 219 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 219 Pre rules applied. Total rules applied 668 place count 880 transition count 661
Deduced a syphon composed of 219 places in 0 ms
Reduce places removed 219 places and 0 transitions.
Iterating global reduction 2 with 438 rules applied. Total rules applied 1106 place count 661 transition count 661
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 1138 place count 629 transition count 629
Iterating global reduction 2 with 32 rules applied. Total rules applied 1170 place count 629 transition count 629
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 1170 place count 629 transition count 602
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 1224 place count 602 transition count 602
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1700 place count 364 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1701 place count 364 transition count 363
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 1703 place count 363 transition count 362
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1705 place count 361 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1706 place count 360 transition count 360
Applied a total of 1706 rules in 76 ms. Remains 360 /1215 variables (removed 855) and now considering 360/1215 (removed 855) transitions.
// Phase 1: matrix 360 rows 360 cols
[2024-05-30 15:00:32] [INFO ] Computed 120 invariants in 1 ms
[2024-05-30 15:00:32] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-30 15:00:32] [INFO ] Invariant cache hit.
[2024-05-30 15:00:32] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-30 15:00:32] [INFO ] Redundant transitions in 2 ms returned []
Running 359 sub problems to find dead transitions.
[2024-05-30 15:00:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 360/720 variables, 360/480 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/720 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (OVERLAPS) 0/720 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 359 unsolved
No progress, stopping.
After SMT solving in domain Real declared 720/720 variables, and 480 constraints, problems are : Problem set: 0 solved, 359 unsolved in 13277 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 360/720 variables, 360/480 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/720 variables, 359/839 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/720 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 0/720 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 359 unsolved
No progress, stopping.
After SMT solving in domain Int declared 720/720 variables, and 839 constraints, problems are : Problem set: 0 solved, 359 unsolved in 17130 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 0/0 constraints]
After SMT, in 30447ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 30451ms
Starting structural reductions in SI_CTL mode, iteration 1 : 360/1215 places, 360/1215 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30909 ms. Remains : 360/1215 places, 360/1215 transitions.
[2024-05-30 15:01:03] [INFO ] Flatten gal took : 13 ms
[2024-05-30 15:01:03] [INFO ] Flatten gal took : 9 ms
[2024-05-30 15:01:03] [INFO ] Input system was already deterministic with 360 transitions.
[2024-05-30 15:01:03] [INFO ] Flatten gal took : 8 ms
[2024-05-30 15:01:03] [INFO ] Flatten gal took : 20 ms
[2024-05-30 15:01:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7184557467245621483.gal : 2 ms
[2024-05-30 15:01:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3325993630662886099.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7184557467245621483.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3325993630662886099.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 40000 steps (11 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality3325993630662886099.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 37
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :37 after 71
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :71 after 271
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :271 after 12822
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :12822 after 8.59092e+07
Finished probabilistic random walk after 9196 steps, run visited all 1 properties in 46 ms. (steps per millisecond=199 )
Probabilistic random walk after 9196 steps, saw 7109 distinct states, run finished after 49 ms. (steps per millisecond=187 ) properties seen :1
FORMULA ShieldRVt-PT-030B-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 : 1215/1215 places, 1215/1215 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 1173 transition count 1173
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1171 transition count 1171
Applied a total of 88 rules in 124 ms. Remains 1171 /1215 variables (removed 44) and now considering 1171/1215 (removed 44) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2024-05-30 15:01:03] [INFO ] Computed 121 invariants in 9 ms
[2024-05-30 15:01:03] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-30 15:01:03] [INFO ] Invariant cache hit.
[2024-05-30 15:01:04] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
Running 1170 sub problems to find dead transitions.
[2024-05-30 15:01:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
SMT process timed out in 30177ms, After SMT, problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 30194ms
Starting structural reductions in LTL mode, iteration 1 : 1171/1215 places, 1171/1215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31264 ms. Remains : 1171/1215 places, 1171/1215 transitions.
[2024-05-30 15:01:34] [INFO ] Flatten gal took : 22 ms
[2024-05-30 15:01:34] [INFO ] Flatten gal took : 25 ms
[2024-05-30 15:01:34] [INFO ] Input system was already deterministic with 1171 transitions.
[2024-05-30 15:01:34] [INFO ] Flatten gal took : 21 ms
[2024-05-30 15:01:34] [INFO ] Flatten gal took : 21 ms
[2024-05-30 15:01:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality14476859946008791639.gal : 4 ms
[2024-05-30 15:01:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality11716337882566564346.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/CTLCardinality14476859946008791639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11716337882566564346.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-30 15:02:05] [INFO ] Flatten gal took : 21 ms
[2024-05-30 15:02:05] [INFO ] Applying decomposition
[2024-05-30 15:02:05] [INFO ] Flatten gal took : 20 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/graph16492453679023125892.txt' '-o' '/tmp/graph16492453679023125892.bin' '-w' '/tmp/graph16492453679023125892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16492453679023125892.bin' '-l' '-1' '-v' '-w' '/tmp/graph16492453679023125892.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:02:05] [INFO ] Decomposing Gal with order
[2024-05-30 15:02:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:02:05] [INFO ] Removed a total of 302 redundant transitions.
[2024-05-30 15:02:05] [INFO ] Flatten gal took : 44 ms
[2024-05-30 15:02:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-30 15:02:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality6932840878311765425.gal : 9 ms
[2024-05-30 15:02:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15171108335238920733.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/CTLCardinality6932840878311765425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15171108335238920733.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 : 1215/1215 places, 1215/1215 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1176 transition count 1176
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1176 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1175 transition count 1175
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1175 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1174 transition count 1174
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1174 transition count 1174
Applied a total of 82 rules in 130 ms. Remains 1174 /1215 variables (removed 41) and now considering 1174/1215 (removed 41) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2024-05-30 15:02:35] [INFO ] Computed 121 invariants in 10 ms
[2024-05-30 15:02:35] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-30 15:02:35] [INFO ] Invariant cache hit.
[2024-05-30 15:02:36] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
Running 1173 sub problems to find dead transitions.
[2024-05-30 15:02:36] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1173 unsolved
SMT process timed out in 30173ms, After SMT, problems are : Problem set: 0 solved, 1173 unsolved
Search for dead transitions found 0 dead transitions in 30186ms
Starting structural reductions in LTL mode, iteration 1 : 1174/1215 places, 1174/1215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31254 ms. Remains : 1174/1215 places, 1174/1215 transitions.
[2024-05-30 15:03:06] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:03:06] [INFO ] Flatten gal took : 20 ms
[2024-05-30 15:03:06] [INFO ] Input system was already deterministic with 1174 transitions.
[2024-05-30 15:03:06] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:03:06] [INFO ] Flatten gal took : 23 ms
[2024-05-30 15:03:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality16910838713905098188.gal : 6 ms
[2024-05-30 15:03:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality15346966962565129733.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/CTLCardinality16910838713905098188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15346966962565129733.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-30 15:03:36] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:03:36] [INFO ] Applying decomposition
[2024-05-30 15:03:36] [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/graph48221092286512086.txt' '-o' '/tmp/graph48221092286512086.bin' '-w' '/tmp/graph48221092286512086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph48221092286512086.bin' '-l' '-1' '-v' '-w' '/tmp/graph48221092286512086.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:03:36] [INFO ] Decomposing Gal with order
[2024-05-30 15:03:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:03:36] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-30 15:03:36] [INFO ] Flatten gal took : 41 ms
[2024-05-30 15:03:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 15:03:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality1887467798476904441.gal : 9 ms
[2024-05-30 15:03:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality5619222492780377654.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/CTLCardinality1887467798476904441.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5619222492780377654.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 SI_CTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 1214 transition count 879
Reduce places removed 335 places and 0 transitions.
Iterating post reduction 1 with 335 rules applied. Total rules applied 670 place count 879 transition count 879
Performed 219 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 219 Pre rules applied. Total rules applied 670 place count 879 transition count 660
Deduced a syphon composed of 219 places in 1 ms
Reduce places removed 219 places and 0 transitions.
Iterating global reduction 2 with 438 rules applied. Total rules applied 1108 place count 660 transition count 660
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 1139 place count 629 transition count 629
Iterating global reduction 2 with 31 rules applied. Total rules applied 1170 place count 629 transition count 629
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 1170 place count 629 transition count 603
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 1222 place count 603 transition count 603
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 239
Deduced a syphon composed of 239 places in 0 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1700 place count 364 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1701 place count 364 transition count 363
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 1703 place count 363 transition count 362
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1705 place count 361 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1706 place count 360 transition count 360
Applied a total of 1706 rules in 83 ms. Remains 360 /1215 variables (removed 855) and now considering 360/1215 (removed 855) transitions.
// Phase 1: matrix 360 rows 360 cols
[2024-05-30 15:04:07] [INFO ] Computed 120 invariants in 2 ms
[2024-05-30 15:04:07] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-30 15:04:07] [INFO ] Invariant cache hit.
[2024-05-30 15:04:07] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-30 15:04:07] [INFO ] Redundant transitions in 2 ms returned []
Running 359 sub problems to find dead transitions.
[2024-05-30 15:04:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 360/720 variables, 360/480 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/720 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (OVERLAPS) 0/720 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 359 unsolved
No progress, stopping.
After SMT solving in domain Real declared 720/720 variables, and 480 constraints, problems are : Problem set: 0 solved, 359 unsolved in 13019 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 360/720 variables, 360/480 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/720 variables, 359/839 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/720 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 0/720 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 359 unsolved
No progress, stopping.
After SMT solving in domain Int declared 720/720 variables, and 839 constraints, problems are : Problem set: 0 solved, 359 unsolved in 14680 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 0/0 constraints]
After SMT, in 27735ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 27738ms
Starting structural reductions in SI_CTL mode, iteration 1 : 360/1215 places, 360/1215 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28232 ms. Remains : 360/1215 places, 360/1215 transitions.
[2024-05-30 15:04:35] [INFO ] Flatten gal took : 13 ms
[2024-05-30 15:04:35] [INFO ] Flatten gal took : 8 ms
[2024-05-30 15:04:35] [INFO ] Input system was already deterministic with 360 transitions.
[2024-05-30 15:04:35] [INFO ] Flatten gal took : 7 ms
[2024-05-30 15:04:35] [INFO ] Flatten gal took : 7 ms
[2024-05-30 15:04:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality16707702111683794714.gal : 2 ms
[2024-05-30 15:04:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality2587334088364032153.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/CTLCardinality16707702111683794714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2587334088364032153.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,1.59734e+57,0.178691,9660,2,601,5,24408,6,0,1803,30570,0


Converting to forward existential form...Done !
original formula: EG((p1165==0))
=> equivalent forward existential formula: [FwdG(Init,(p1165==0))] != FALSE
Hit Full ! (commute/partial/dont) 358/0/2
(forward)formula 0,1,0.656951,25900,1,0,8,142045,19,4,9096,53490,8
FORMULA ShieldRVt-PT-030B-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 1173 transition count 1173
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1171 transition count 1171
Applied a total of 88 rules in 127 ms. Remains 1171 /1215 variables (removed 44) and now considering 1171/1215 (removed 44) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2024-05-30 15:04:36] [INFO ] Computed 121 invariants in 11 ms
[2024-05-30 15:04:36] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-30 15:04:36] [INFO ] Invariant cache hit.
[2024-05-30 15:04:37] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
Running 1170 sub problems to find dead transitions.
[2024-05-30 15:04:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
SMT process timed out in 30165ms, After SMT, problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 30175ms
Starting structural reductions in LTL mode, iteration 1 : 1171/1215 places, 1171/1215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31234 ms. Remains : 1171/1215 places, 1171/1215 transitions.
[2024-05-30 15:05:07] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:05:07] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:05:07] [INFO ] Input system was already deterministic with 1171 transitions.
[2024-05-30 15:05:07] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:05:07] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:05:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality5996624069091785782.gal : 5 ms
[2024-05-30 15:05:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality3339190934817851921.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/CTLCardinality5996624069091785782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3339190934817851921.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-30 15:05:37] [INFO ] Flatten gal took : 21 ms
[2024-05-30 15:05:37] [INFO ] Applying decomposition
[2024-05-30 15:05:37] [INFO ] Flatten gal took : 19 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/graph3601406257149214356.txt' '-o' '/tmp/graph3601406257149214356.bin' '-w' '/tmp/graph3601406257149214356.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3601406257149214356.bin' '-l' '-1' '-v' '-w' '/tmp/graph3601406257149214356.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:05:37] [INFO ] Decomposing Gal with order
[2024-05-30 15:05:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:05:37] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-30 15:05:37] [INFO ] Flatten gal took : 37 ms
[2024-05-30 15:05:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 15:05:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality8751017210401541021.gal : 8 ms
[2024-05-30 15:05:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality134637867419906782.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/CTLCardinality8751017210401541021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality134637867419906782.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 : 1215/1215 places, 1215/1215 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1176 transition count 1176
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1176 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1175 transition count 1175
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1175 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1174 transition count 1174
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1174 transition count 1174
Applied a total of 82 rules in 124 ms. Remains 1174 /1215 variables (removed 41) and now considering 1174/1215 (removed 41) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2024-05-30 15:06:07] [INFO ] Computed 121 invariants in 10 ms
[2024-05-30 15:06:08] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-30 15:06:08] [INFO ] Invariant cache hit.
[2024-05-30 15:06:08] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
Running 1173 sub problems to find dead transitions.
[2024-05-30 15:06:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1173 unsolved
SMT process timed out in 30166ms, After SMT, problems are : Problem set: 0 solved, 1173 unsolved
Search for dead transitions found 0 dead transitions in 30177ms
Starting structural reductions in LTL mode, iteration 1 : 1174/1215 places, 1174/1215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31283 ms. Remains : 1174/1215 places, 1174/1215 transitions.
[2024-05-30 15:06:38] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:06:38] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:06:39] [INFO ] Input system was already deterministic with 1174 transitions.
[2024-05-30 15:06:39] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:06:39] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:06:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality17999609822669339101.gal : 4 ms
[2024-05-30 15:06:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality2952033757314571679.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/CTLCardinality17999609822669339101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2952033757314571679.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-30 15:07:09] [INFO ] Flatten gal took : 24 ms
[2024-05-30 15:07:09] [INFO ] Applying decomposition
[2024-05-30 15:07:09] [INFO ] Flatten gal took : 19 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/graph5417541882151603756.txt' '-o' '/tmp/graph5417541882151603756.bin' '-w' '/tmp/graph5417541882151603756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5417541882151603756.bin' '-l' '-1' '-v' '-w' '/tmp/graph5417541882151603756.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:07:09] [INFO ] Decomposing Gal with order
[2024-05-30 15:07:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:07:09] [INFO ] Removed a total of 301 redundant transitions.
[2024-05-30 15:07:09] [INFO ] Flatten gal took : 36 ms
[2024-05-30 15:07:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 15:07:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality2064239218078382905.gal : 9 ms
[2024-05-30 15:07:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality11005104962203265611.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/CTLCardinality2064239218078382905.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11005104962203265611.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 : 1215/1215 places, 1215/1215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 1214 transition count 881
Reduce places removed 333 places and 0 transitions.
Iterating post reduction 1 with 333 rules applied. Total rules applied 666 place count 881 transition count 881
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 217 Pre rules applied. Total rules applied 666 place count 881 transition count 664
Deduced a syphon composed of 217 places in 0 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 2 with 434 rules applied. Total rules applied 1100 place count 664 transition count 664
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 1131 place count 633 transition count 633
Iterating global reduction 2 with 31 rules applied. Total rules applied 1162 place count 633 transition count 633
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 1162 place count 633 transition count 606
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 1216 place count 606 transition count 606
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 0 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1692 place count 368 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1693 place count 368 transition count 367
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 1695 place count 367 transition count 366
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1697 place count 365 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1698 place count 364 transition count 364
Applied a total of 1698 rules in 73 ms. Remains 364 /1215 variables (removed 851) and now considering 364/1215 (removed 851) transitions.
// Phase 1: matrix 364 rows 364 cols
[2024-05-30 15:07:39] [INFO ] Computed 120 invariants in 2 ms
[2024-05-30 15:07:39] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-30 15:07:39] [INFO ] Invariant cache hit.
[2024-05-30 15:07:39] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-05-30 15:07:39] [INFO ] Redundant transitions in 2 ms returned []
Running 361 sub problems to find dead transitions.
[2024-05-30 15:07:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 2/364 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 364/728 variables, 364/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (OVERLAPS) 0/728 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 728/728 variables, and 484 constraints, problems are : Problem set: 0 solved, 361 unsolved in 17235 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 2/364 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 364/728 variables, 364/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 361/845 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/728 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 728/728 variables, and 845 constraints, problems are : Problem set: 0 solved, 361 unsolved in 17686 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 34959ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 34962ms
Starting structural reductions in SI_CTL mode, iteration 1 : 364/1215 places, 364/1215 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35429 ms. Remains : 364/1215 places, 364/1215 transitions.
[2024-05-30 15:08:14] [INFO ] Flatten gal took : 10 ms
[2024-05-30 15:08:14] [INFO ] Flatten gal took : 7 ms
[2024-05-30 15:08:14] [INFO ] Input system was already deterministic with 364 transitions.
[2024-05-30 15:08:14] [INFO ] Flatten gal took : 8 ms
[2024-05-30 15:08:14] [INFO ] Flatten gal took : 8 ms
[2024-05-30 15:08:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality2822298330891295391.gal : 1 ms
[2024-05-30 15:08:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality12257701475512795991.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/CTLCardinality2822298330891295391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12257701475512795991.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,4.73287e+57,0.191267,9948,2,609,5,25574,6,0,1822,32426,0


Converting to forward existential form...Done !
original formula: EG(!(E(E((p581==0) U !(((p1031==0)||(p1158==1)))) U (p1332!=0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(E((p581==0) U !(((p1031==0)||(p1158==1)))) U (p1332!=0))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 362/0/2
(forward)formula 0,0,0.911919,34684,1,0,15,181121,28,7,9190,123549,14
FORMULA ShieldRVt-PT-030B-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1178 transition count 1178
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1178 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1177 transition count 1177
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1177 transition count 1177
Applied a total of 76 rules in 104 ms. Remains 1177 /1215 variables (removed 38) and now considering 1177/1215 (removed 38) transitions.
// Phase 1: matrix 1177 rows 1177 cols
[2024-05-30 15:08:15] [INFO ] Computed 121 invariants in 9 ms
[2024-05-30 15:08:16] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-30 15:08:16] [INFO ] Invariant cache hit.
[2024-05-30 15:08:16] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
Running 1176 sub problems to find dead transitions.
[2024-05-30 15:08:16] [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)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 timeout
1.0)
(s714 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
SMT process timed out in 30168ms, After SMT, problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 30179ms
Starting structural reductions in LTL mode, iteration 1 : 1177/1215 places, 1177/1215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31261 ms. Remains : 1177/1215 places, 1177/1215 transitions.
[2024-05-30 15:08:47] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:08:47] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:08:47] [INFO ] Input system was already deterministic with 1177 transitions.
[2024-05-30 15:08:47] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:08:47] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:08:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality18332844082607595695.gal : 3 ms
[2024-05-30 15:08:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality1441912937693510034.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/CTLCardinality18332844082607595695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1441912937693510034.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-30 15:09:17] [INFO ] Flatten gal took : 31 ms
[2024-05-30 15:09:17] [INFO ] Applying decomposition
[2024-05-30 15:09:17] [INFO ] Flatten gal took : 22 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/graph10915931475885991192.txt' '-o' '/tmp/graph10915931475885991192.bin' '-w' '/tmp/graph10915931475885991192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10915931475885991192.bin' '-l' '-1' '-v' '-w' '/tmp/graph10915931475885991192.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:09:17] [INFO ] Decomposing Gal with order
[2024-05-30 15:09:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:09:17] [INFO ] Removed a total of 293 redundant transitions.
[2024-05-30 15:09:17] [INFO ] Flatten gal took : 34 ms
[2024-05-30 15:09:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 15:09:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality9655100735187886494.gal : 9 ms
[2024-05-30 15:09:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality9791871907582759891.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/CTLCardinality9655100735187886494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9791871907582759891.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 : 1215/1215 places, 1215/1215 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1176 transition count 1176
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1176 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1175 transition count 1175
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1175 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1174 transition count 1174
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1174 transition count 1174
Applied a total of 82 rules in 129 ms. Remains 1174 /1215 variables (removed 41) and now considering 1174/1215 (removed 41) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2024-05-30 15:09:47] [INFO ] Computed 121 invariants in 10 ms
[2024-05-30 15:09:47] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-30 15:09:47] [INFO ] Invariant cache hit.
[2024-05-30 15:09:48] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
Running 1173 sub problems to find dead transitions.
[2024-05-30 15:09:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1173 unsolved
SMT process timed out in 30164ms, After SMT, problems are : Problem set: 0 solved, 1173 unsolved
Search for dead transitions found 0 dead transitions in 30177ms
Starting structural reductions in LTL mode, iteration 1 : 1174/1215 places, 1174/1215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31292 ms. Remains : 1174/1215 places, 1174/1215 transitions.
[2024-05-30 15:10:18] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:10:18] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:10:18] [INFO ] Input system was already deterministic with 1174 transitions.
[2024-05-30 15:10:18] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:10:18] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:10:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality5962049892567859660.gal : 6 ms
[2024-05-30 15:10:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality3019539743813687827.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/CTLCardinality5962049892567859660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3019539743813687827.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-30 15:10:49] [INFO ] Flatten gal took : 21 ms
[2024-05-30 15:10:49] [INFO ] Applying decomposition
[2024-05-30 15:10:49] [INFO ] Flatten gal took : 19 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/graph14526934621111052688.txt' '-o' '/tmp/graph14526934621111052688.bin' '-w' '/tmp/graph14526934621111052688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14526934621111052688.bin' '-l' '-1' '-v' '-w' '/tmp/graph14526934621111052688.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:10:49] [INFO ] Decomposing Gal with order
[2024-05-30 15:10:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:10:49] [INFO ] Removed a total of 301 redundant transitions.
[2024-05-30 15:10:49] [INFO ] Flatten gal took : 34 ms
[2024-05-30 15:10:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 15:10:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality2168696776117134023.gal : 8 ms
[2024-05-30 15:10:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality11101137635631710646.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/CTLCardinality2168696776117134023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11101137635631710646.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 : 1215/1215 places, 1215/1215 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1179 transition count 1179
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1179 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1178 transition count 1178
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1178 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1177 transition count 1177
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1177 transition count 1177
Applied a total of 76 rules in 139 ms. Remains 1177 /1215 variables (removed 38) and now considering 1177/1215 (removed 38) transitions.
// Phase 1: matrix 1177 rows 1177 cols
[2024-05-30 15:11:19] [INFO ] Computed 121 invariants in 16 ms
[2024-05-30 15:11:19] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-30 15:11:19] [INFO ] Invariant cache hit.
[2024-05-30 15:11:20] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
Running 1176 sub problems to find dead transitions.
[2024-05-30 15:11:20] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
SMT process timed out in 30174ms, After SMT, problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 30186ms
Starting structural reductions in LTL mode, iteration 1 : 1177/1215 places, 1177/1215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31294 ms. Remains : 1177/1215 places, 1177/1215 transitions.
[2024-05-30 15:11:50] [INFO ] Flatten gal took : 22 ms
[2024-05-30 15:11:50] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:11:50] [INFO ] Input system was already deterministic with 1177 transitions.
[2024-05-30 15:11:50] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:11:50] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:11:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality7733303474366088875.gal : 4 ms
[2024-05-30 15:11:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality1621548501019121388.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/CTLCardinality7733303474366088875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1621548501019121388.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-30 15:12:20] [INFO ] Flatten gal took : 23 ms
[2024-05-30 15:12:20] [INFO ] Applying decomposition
[2024-05-30 15:12:20] [INFO ] Flatten gal took : 18 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/graph12250962864152230641.txt' '-o' '/tmp/graph12250962864152230641.bin' '-w' '/tmp/graph12250962864152230641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12250962864152230641.bin' '-l' '-1' '-v' '-w' '/tmp/graph12250962864152230641.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:12:20] [INFO ] Decomposing Gal with order
[2024-05-30 15:12:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:12:20] [INFO ] Removed a total of 296 redundant transitions.
[2024-05-30 15:12:20] [INFO ] Flatten gal took : 33 ms
[2024-05-30 15:12:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 15:12:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality6201119081057237874.gal : 8 ms
[2024-05-30 15:12:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality17225615704417665581.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/CTLCardinality6201119081057237874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17225615704417665581.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 : 1215/1215 places, 1215/1215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 334 place count 1214 transition count 880
Reduce places removed 334 places and 0 transitions.
Iterating post reduction 1 with 334 rules applied. Total rules applied 668 place count 880 transition count 880
Performed 219 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 219 Pre rules applied. Total rules applied 668 place count 880 transition count 661
Deduced a syphon composed of 219 places in 1 ms
Reduce places removed 219 places and 0 transitions.
Iterating global reduction 2 with 438 rules applied. Total rules applied 1106 place count 661 transition count 661
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 1137 place count 630 transition count 630
Iterating global reduction 2 with 31 rules applied. Total rules applied 1168 place count 630 transition count 630
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 1168 place count 630 transition count 604
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 1220 place count 604 transition count 604
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 0 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1696 place count 366 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1697 place count 366 transition count 365
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 1699 place count 365 transition count 364
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1701 place count 363 transition count 362
Applied a total of 1701 rules in 72 ms. Remains 363 /1215 variables (removed 852) and now considering 362/1215 (removed 853) transitions.
// Phase 1: matrix 362 rows 363 cols
[2024-05-30 15:12:51] [INFO ] Computed 121 invariants in 2 ms
[2024-05-30 15:12:51] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-30 15:12:51] [INFO ] Invariant cache hit.
[2024-05-30 15:12:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-30 15:12:51] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-30 15:12:51] [INFO ] Redundant transitions in 2 ms returned []
Running 360 sub problems to find dead transitions.
[2024-05-30 15:12:51] [INFO ] Invariant cache hit.
[2024-05-30 15:12:51] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/363 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 362/725 variables, 363/484 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 0/725 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 486 constraints, problems are : Problem set: 0 solved, 360 unsolved in 15418 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 363/363 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/363 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 362/725 variables, 363/484 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 360/846 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (OVERLAPS) 0/725 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 725/725 variables, and 846 constraints, problems are : Problem set: 0 solved, 360 unsolved in 18304 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 363/363 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 33759ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 33763ms
Starting structural reductions in SI_CTL mode, iteration 1 : 363/1215 places, 362/1215 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34264 ms. Remains : 363/1215 places, 362/1215 transitions.
[2024-05-30 15:13:25] [INFO ] Flatten gal took : 7 ms
[2024-05-30 15:13:25] [INFO ] Flatten gal took : 8 ms
[2024-05-30 15:13:25] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-30 15:13:25] [INFO ] Flatten gal took : 9 ms
[2024-05-30 15:13:25] [INFO ] Flatten gal took : 10 ms
[2024-05-30 15:13:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality4163259673314214185.gal : 2 ms
[2024-05-30 15:13:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality12358427866118698618.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/CTLCardinality4163259673314214185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12358427866118698618.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,4.79203e+57,0.183631,9672,2,606,5,24463,6,0,1814,30515,0


Converting to forward existential form...Done !
original formula: EF((EF(EG((p1250==0))) * (p1469==1)))
=> equivalent forward existential formula: [FwdG(FwdU((FwdU(Init,TRUE) * (p1469==1)),TRUE),(p1250==0))] != FALSE
Hit Full ! (commute/partial/dont) 360/0/2
(forward)formula 0,1,0.590606,22080,1,0,11,124007,21,5,9226,30515,11
FORMULA ShieldRVt-PT-030B-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 15:13:26] [INFO ] Flatten gal took : 27 ms
[2024-05-30 15:13:26] [INFO ] Flatten gal took : 20 ms
[2024-05-30 15:13:26] [INFO ] Applying decomposition
[2024-05-30 15:13:26] [INFO ] Flatten gal took : 20 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/graph17632173908235275201.txt' '-o' '/tmp/graph17632173908235275201.bin' '-w' '/tmp/graph17632173908235275201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17632173908235275201.bin' '-l' '-1' '-v' '-w' '/tmp/graph17632173908235275201.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:13:26] [INFO ] Decomposing Gal with order
[2024-05-30 15:13:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:13:26] [INFO ] Removed a total of 272 redundant transitions.
[2024-05-30 15:13:26] [INFO ] Flatten gal took : 37 ms
[2024-05-30 15:13:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 15:13:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality16061249423745600884.gal : 8 ms
[2024-05-30 15:13:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality13814594803373818741.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/CTLCardinality16061249423745600884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13814594803373818741.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 9 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 15:39:14] [INFO ] Applying decomposition
[2024-05-30 15:39:14] [INFO ] Flatten gal took : 20 ms
[2024-05-30 15:39:14] [INFO ] Decomposing Gal with order
[2024-05-30 15:39:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:39:15] [INFO ] Removed a total of 74 redundant transitions.
[2024-05-30 15:39:15] [INFO ] Flatten gal took : 30 ms
[2024-05-30 15:39:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 15:39:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality14758663262417615068.gal : 5 ms
[2024-05-30 15:39:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality6036638515215272355.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/CTLCardinality14758663262417615068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6036638515215272355.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 9 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,1.4322e+108,386.633,5746964,2231,358,8.60674e+06,932,701,3.38947e+07,140,12635,0


Converting to forward existential form...Done !
original formula: AG((EF(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u119.p646==0)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u342.p867==1)...570
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u119.p646==0)&&(i0...667
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t1151, i0.i0.i0.i0.t1149, i0.i0.i0.i0.i0.i0.i0.t1102, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.t11...18770

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="ShieldRVt-PT-030B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldRVt-PT-030B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683762301001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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