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.r550-tall-171734899000297.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 FireWire-PT-17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 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 FireWire-PT-17-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717368681213

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 22:51:22] [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-06-02 22:51:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:51:22] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-02 22:51:22] [INFO ] Transformed 428 places.
[2024-06-02 22:51:22] [INFO ] Transformed 656 transitions.
[2024-06-02 22:51:22] [INFO ] Found NUPN structural information;
[2024-06-02 22:51:22] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 123 out of 428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 656/656 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 426 transition count 656
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 62 place count 366 transition count 596
Iterating global reduction 1 with 60 rules applied. Total rules applied 122 place count 366 transition count 596
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 129 place count 359 transition count 570
Iterating global reduction 1 with 7 rules applied. Total rules applied 136 place count 359 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 137 place count 359 transition count 569
Applied a total of 137 rules in 72 ms. Remains 359 /428 variables (removed 69) and now considering 569/656 (removed 87) transitions.
// Phase 1: matrix 569 rows 359 cols
[2024-06-02 22:51:22] [INFO ] Computed 8 invariants in 21 ms
[2024-06-02 22:51:22] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-06-02 22:51:22] [INFO ] Invariant cache hit.
[2024-06-02 22:51:23] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Running 568 sub problems to find dead transitions.
[2024-06-02 22:51:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 4/358 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 22:51:29] [INFO ] Deduced a trap composed of 183 places in 173 ms of which 22 ms to minimize.
[2024-06-02 22:51:30] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:51:30] [INFO ] Deduced a trap composed of 87 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:51:30] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:51:31] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:51:31] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 2 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 96 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:51:33] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:51:33] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-06-02 22:51:33] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2024-06-02 22:51:33] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-06-02 22:51:34] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-06-02 22:51:36] [INFO ] Deduced a trap composed of 173 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 22:51:36] [INFO ] Deduced a trap composed of 181 places in 112 ms of which 2 ms to minimize.
[2024-06-02 22:51:37] [INFO ] Deduced a trap composed of 117 places in 106 ms of which 2 ms to minimize.
[2024-06-02 22:51:37] [INFO ] Deduced a trap composed of 106 places in 53 ms of which 2 ms to minimize.
[2024-06-02 22:51:37] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 1 ms to minimize.
[2024-06-02 22:51:37] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 1 ms to minimize.
[2024-06-02 22:51:38] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-06-02 22:51:38] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-06-02 22:51:38] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 22:51:46] [INFO ] Deduced a trap composed of 103 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:51:46] [INFO ] Deduced a trap composed of 102 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:51:46] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:51:46] [INFO ] Deduced a trap composed of 99 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:51:47] [INFO ] Deduced a trap composed of 99 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:51:47] [INFO ] Deduced a trap composed of 97 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/928 variables, and 38 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/359 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 568 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 4/358 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 22:51:57] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:51:57] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:51:57] [INFO ] Deduced a trap composed of 110 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:51:57] [INFO ] Deduced a trap composed of 151 places in 107 ms of which 3 ms to minimize.
[2024-06-02 22:51:57] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 5 ms to minimize.
[2024-06-02 22:51:58] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-06-02 22:51:58] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 22:52:03] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 2 ms to minimize.
[2024-06-02 22:52:03] [INFO ] Deduced a trap composed of 105 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 22:52:10] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 22:52:13] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:52:15] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 22:52:19] [INFO ] Deduced a trap composed of 106 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/928 variables, and 51 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/359 constraints, PredecessorRefiner: 0/568 constraints, Known Traps: 43/43 constraints]
After SMT, in 60310ms problems are : Problem set: 0 solved, 568 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Starting structural reductions in LTL mode, iteration 1 : 359/428 places, 569/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61076 ms. Remains : 359/428 places, 569/656 transitions.
Support contains 123 out of 359 places after structural reductions.
[2024-06-02 22:52:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 22:52:23] [INFO ] Flatten gal took : 64 ms
FORMULA FireWire-PT-17-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:52:23] [INFO ] Flatten gal took : 32 ms
[2024-06-02 22:52:24] [INFO ] Input system was already deterministic with 569 transitions.
Support contains 113 out of 359 places (down from 123) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 1644 ms. (24 steps per ms) remains 37/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
[2024-06-02 22:52:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 271/338 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 550/888 variables, 338/346 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 14/902 variables, 7/353 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 14/916 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/916 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 9/925 variables, 6/365 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 3/928 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/928 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 0/928 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 928/928 variables, and 367 constraints, problems are : Problem set: 0 solved, 37 unsolved in 2968 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 271/338 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-02 22:52:28] [INFO ] Deduced a trap composed of 176 places in 118 ms of which 3 ms to minimize.
[2024-06-02 22:52:28] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-06-02 22:52:28] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-06-02 22:52:28] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:52:28] [INFO ] Deduced a trap composed of 118 places in 110 ms of which 2 ms to minimize.
[2024-06-02 22:52:28] [INFO ] Deduced a trap composed of 181 places in 115 ms of which 2 ms to minimize.
[2024-06-02 22:52:29] [INFO ] Deduced a trap composed of 173 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-02 22:52:29] [INFO ] Deduced a trap composed of 169 places in 124 ms of which 3 ms to minimize.
[2024-06-02 22:52:29] [INFO ] Deduced a trap composed of 171 places in 106 ms of which 2 ms to minimize.
[2024-06-02 22:52:29] [INFO ] Deduced a trap composed of 180 places in 120 ms of which 2 ms to minimize.
[2024-06-02 22:52:29] [INFO ] Deduced a trap composed of 173 places in 121 ms of which 2 ms to minimize.
[2024-06-02 22:52:29] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:52:29] [INFO ] Deduced a trap composed of 96 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:52:30] [INFO ] Deduced a trap composed of 166 places in 123 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 550/888 variables, 338/360 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 32/392 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-02 22:52:31] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:52:31] [INFO ] Deduced a trap composed of 136 places in 126 ms of which 2 ms to minimize.
[2024-06-02 22:52:31] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 2 ms to minimize.
[2024-06-02 22:52:31] [INFO ] Deduced a trap composed of 98 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/888 variables, 4/396 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-02 22:52:32] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2024-06-02 22:52:32] [INFO ] Deduced a trap composed of 96 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:52:32] [INFO ] Deduced a trap composed of 99 places in 59 ms of which 2 ms to minimize.
SMT process timed out in 8034ms, After SMT, problems are : Problem set: 0 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 569/569 transitions.
Graph (trivial) has 206 edges and 359 vertex of which 15 / 359 are part of one of the 3 SCC in 3 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 965 edges and 347 vertex of which 343 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 343 transition count 506
Reduce places removed 46 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 297 transition count 501
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 108 place count 292 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 291 transition count 499
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 109 place count 291 transition count 485
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 137 place count 277 transition count 485
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 148 place count 266 transition count 474
Iterating global reduction 4 with 11 rules applied. Total rules applied 159 place count 266 transition count 474
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 159 place count 266 transition count 473
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 265 transition count 473
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 241 place count 225 transition count 433
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 242 place count 224 transition count 413
Iterating global reduction 4 with 1 rules applied. Total rules applied 243 place count 224 transition count 413
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 271 place count 210 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 272 place count 210 transition count 451
Free-agglomeration rule applied 21 times.
Iterating global reduction 4 with 21 rules applied. Total rules applied 293 place count 210 transition count 430
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 314 place count 189 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 315 place count 189 transition count 429
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 320 place count 189 transition count 429
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 321 place count 189 transition count 429
Applied a total of 321 rules in 128 ms. Remains 189 /359 variables (removed 170) and now considering 429/569 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 189/359 places, 429/569 transitions.
RANDOM walk for 40000 steps (1637 resets) in 433 ms. (92 steps per ms) remains 25/37 properties
BEST_FIRST walk for 4004 steps (17 resets) in 23 ms. (166 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (37 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (36 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (38 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (25 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (36 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (35 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (36 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (32 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (34 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (35 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (37 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (39 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (38 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (35 resets) in 13 ms. (285 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4004 steps (35 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (37 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (36 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (35 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (36 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (34 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (35 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
// Phase 1: matrix 429 rows 189 cols
[2024-06-02 22:52:33] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 22:52:33] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 134/173 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 6/179 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 425/604 variables, 179/186 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 9/195 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 12/616 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/616 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 2/618 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/618 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 0/618 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 618/618 variables, and 205 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 134/173 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 22:52:34] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:52:34] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:52:34] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:52:34] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:52:34] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 6/179 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 425/604 variables, 179/191 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 19/219 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 22:52:35] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:52:35] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 12/616 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/616 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 22:52:36] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/616 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/616 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 2/618 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/618 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/618 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 618/618 variables, and 235 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3542 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 8/8 constraints]
After SMT, in 4578ms problems are : Problem set: 0 solved, 22 unsolved
Parikh walk visited 1 properties in 2026 ms.
Support contains 38 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 429/429 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 189 transition count 419
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 179 transition count 419
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 20 place count 179 transition count 416
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 176 transition count 416
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 175 transition count 415
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 175 transition count 415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 28 place count 175 transition count 414
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 174 transition count 414
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 44 place count 167 transition count 407
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 47 place count 167 transition count 404
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 61 place count 160 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 66 place count 160 transition count 419
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 160 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 159 transition count 418
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 159 transition count 460
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 72 place count 157 transition count 460
Applied a total of 72 rules in 51 ms. Remains 157 /189 variables (removed 32) and now considering 460/429 (removed -31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 157/189 places, 460/429 transitions.
RANDOM walk for 40000 steps (2072 resets) in 401 ms. (99 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (50 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (51 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (52 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (20 resets) in 15 ms. (250 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (55 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (52 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (50 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (51 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (48 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (53 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (52 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (47 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (53 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (49 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (48 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (51 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (51 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 538706 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :14 out of 20
Probabilistic random walk after 538706 steps, saw 118111 distinct states, run finished after 3009 ms. (steps per millisecond=179 ) properties seen :14
[2024-06-02 22:52:43] [INFO ] Flow matrix only has 448 transitions (discarded 12 similar events)
// Phase 1: matrix 448 rows 157 cols
[2024-06-02 22:52:43] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:52:43] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 126/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/151 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 448/599 variables, 151/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 26/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6/605 variables, 6/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/605 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 190 constraints, problems are : Problem set: 0 solved, 6 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 126/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:52:43] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:52:43] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:52:43] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 9/151 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 448/599 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 26/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 6/605 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/605 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:52:44] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/605 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/605 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/605 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 605/605 variables, and 200 constraints, problems are : Problem set: 0 solved, 6 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 1297ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 1 properties in 2983 ms.
Support contains 14 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 460/460 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 157 transition count 452
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 149 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 148 transition count 451
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 147 transition count 450
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 147 transition count 450
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 147 transition count 449
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 22 place count 146 transition count 449
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 145 transition count 446
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 145 transition count 446
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 36 place count 139 transition count 440
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 38 place count 139 transition count 438
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 40 place count 137 transition count 432
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 137 transition count 432
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 46 place count 137 transition count 428
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 58 place count 131 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 59 place count 131 transition count 437
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 131 transition count 437
Applied a total of 60 rules in 55 ms. Remains 131 /157 variables (removed 26) and now considering 437/460 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 131/157 places, 437/460 transitions.
RANDOM walk for 40000 steps (2276 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (31 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (590 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (629 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (603 resets) in 31 ms. (1250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (599 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 865716 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :4 out of 5
Probabilistic random walk after 865716 steps, saw 256891 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :4
[2024-06-02 22:52:50] [INFO ] Flow matrix only has 422 transitions (discarded 15 similar events)
// Phase 1: matrix 422 rows 131 cols
[2024-06-02 22:52:50] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 22:52:50] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/125 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 420/545 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 26/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/550 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/552 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/553 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/553 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 166 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 131/131 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/125 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:52:50] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 420/545 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 26/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/550 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/550 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/552 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/552 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/553 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/553 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 131/131 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 410ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 437/437 transitions.
Graph (trivial) has 29 edges and 131 vertex of which 3 / 131 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 place count 129 transition count 432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 127 transition count 432
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 126 transition count 429
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 126 transition count 429
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 123 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 123 transition count 396
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 123 transition count 389
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 63 place count 116 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 3 with 52 rules applied. Total rules applied 115 place count 116 transition count 331
Applied a total of 115 rules in 33 ms. Remains 116 /131 variables (removed 15) and now considering 331/437 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 116/131 places, 331/437 transitions.
RANDOM walk for 40000 steps (2381 resets) in 435 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (607 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7531 steps, run visited all 1 properties in 21 ms. (steps per millisecond=358 )
Probabilistic random walk after 7531 steps, saw 2673 distinct states, run finished after 24 ms. (steps per millisecond=313 ) properties seen :1
[2024-06-02 22:52:51] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:52:51] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:52:51] [INFO ] Input system was already deterministic with 569 transitions.
Computed a total of 58 stabilizing places and 60 stable transitions
Graph (complete) has 980 edges and 359 vertex of which 355 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 42 place count 317 transition count 530
Iterating global reduction 1 with 38 rules applied. Total rules applied 80 place count 317 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 317 transition count 529
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 304 transition count 511
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 304 transition count 511
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 304 transition count 510
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 301 transition count 507
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 301 transition count 507
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 299 transition count 505
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 299 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 298 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 298 transition count 504
Applied a total of 120 rules in 27 ms. Remains 298 /359 variables (removed 61) and now considering 504/569 (removed 65) transitions.
// Phase 1: matrix 504 rows 298 cols
[2024-06-02 22:52:51] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:52:51] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 22:52:51] [INFO ] Invariant cache hit.
[2024-06-02 22:52:51] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-06-02 22:52:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 22:52:56] [INFO ] Deduced a trap composed of 154 places in 102 ms of which 2 ms to minimize.
[2024-06-02 22:52:56] [INFO ] Deduced a trap composed of 163 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:52:57] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:52:57] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:52:57] [INFO ] Deduced a trap composed of 149 places in 96 ms of which 2 ms to minimize.
[2024-06-02 22:52:57] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:52:58] [INFO ] Deduced a trap composed of 152 places in 88 ms of which 2 ms to minimize.
[2024-06-02 22:52:58] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:52:58] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:52:59] [INFO ] Deduced a trap composed of 113 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:52:59] [INFO ] Deduced a trap composed of 109 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:52:59] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-06-02 22:53:01] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 22:53:02] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:53:02] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:53:03] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (OVERLAPS) 504/802 variables, 298/321 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 22:53:14] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/802 variables, and 322 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 504/802 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 503/825 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 22:53:34] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 1 ms to minimize.
[2024-06-02 22:53:34] [INFO ] Deduced a trap composed of 116 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:53:35] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:53:35] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 4/829 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 22:53:49] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:53:49] [INFO ] Deduced a trap composed of 111 places in 98 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/802 variables, and 831 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 23/23 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Starting structural reductions in LTL mode, iteration 1 : 298/359 places, 504/569 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60601 ms. Remains : 298/359 places, 504/569 transitions.
[2024-06-02 22:53:52] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:53:52] [INFO ] Flatten gal took : 33 ms
[2024-06-02 22:53:52] [INFO ] Input system was already deterministic with 504 transitions.
[2024-06-02 22:53:52] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:53:52] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:53:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality14015733946456085653.gal : 21 ms
[2024-06-02 22:53:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality16840380248310349125.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/CTLCardinality14015733946456085653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16840380248310349125.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-06-02 22:54:22] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:54:22] [INFO ] Applying decomposition
[2024-06-02 22:54:22] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13687796076569162675.txt' '-o' '/tmp/graph13687796076569162675.bin' '-w' '/tmp/graph13687796076569162675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13687796076569162675.bin' '-l' '-1' '-v' '-w' '/tmp/graph13687796076569162675.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:54:22] [INFO ] Decomposing Gal with order
[2024-06-02 22:54:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:54:22] [INFO ] Removed a total of 508 redundant transitions.
[2024-06-02 22:54:22] [INFO ] Flatten gal took : 75 ms
[2024-06-02 22:54:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 28 ms.
[2024-06-02 22:54:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality16782531786541414644.gal : 8 ms
[2024-06-02 22:54:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality10349809334478539255.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/CTLCardinality16782531786541414644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10349809334478539255.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.91612e+11,26.4985,634996,3665,75,637412,1809,964,4.85286e+06,90,6396,0


Converting to forward existential form...Done !
original formula: EF((AX((((i2.u10.p42==0)&&(i5.u40.p147==1))||((i4.u46.p181==0)&&(i10.u13.p53==1)))) + (AF((i11.u87.p341==1)) * ((((i5.u49.p155==1)||(i10....228
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!((((i2.u10.p42==0)&&(i5.u40.p147==1))||((i4.u46.p181==0)&&(i10.u13.p53==1)))))))] != ...323
Reverse transition relation is NOT exact ! Due to transitions t22, t117, t142, t205, t216, t222, t235, t246, t251, t256, t261, t266, t271, t273, t274, t287...1160
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 43 place count 316 transition count 527
Iterating global reduction 1 with 39 rules applied. Total rules applied 82 place count 316 transition count 527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 316 transition count 526
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 305 transition count 510
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 305 transition count 510
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 305 transition count 509
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 303 transition count 507
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 303 transition count 507
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 301 transition count 505
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 301 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 300 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 300 transition count 504
Applied a total of 116 rules in 24 ms. Remains 300 /359 variables (removed 59) and now considering 504/569 (removed 65) transitions.
// Phase 1: matrix 504 rows 300 cols
[2024-06-02 22:54:52] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 22:54:53] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-02 22:54:53] [INFO ] Invariant cache hit.
[2024-06-02 22:54:53] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-06-02 22:54:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 22:54:58] [INFO ] Deduced a trap composed of 158 places in 95 ms of which 4 ms to minimize.
[2024-06-02 22:54:58] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
[2024-06-02 22:54:58] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:54:58] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:54:58] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:54:59] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:54:59] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:54:59] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:55:00] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 1 ms to minimize.
[2024-06-02 22:55:00] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-06-02 22:55:02] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 504/804 variables, 300/318 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 22:55:09] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:55:10] [INFO ] Deduced a trap composed of 132 places in 97 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 22:55:16] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/804 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 804/804 variables, and 321 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 504/804 variables, 300/321 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 503/824 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 22:55:35] [INFO ] Deduced a trap composed of 115 places in 105 ms of which 2 ms to minimize.
[2024-06-02 22:55:35] [INFO ] Deduced a trap composed of 108 places in 132 ms of which 2 ms to minimize.
[2024-06-02 22:55:35] [INFO ] Deduced a trap composed of 131 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/804 variables, 3/827 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 22:55:48] [INFO ] Deduced a trap composed of 108 places in 98 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/804 variables, and 828 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 18/18 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in LTL mode, iteration 1 : 300/359 places, 504/569 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60702 ms. Remains : 300/359 places, 504/569 transitions.
[2024-06-02 22:55:53] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:55:53] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:55:53] [INFO ] Input system was already deterministic with 504 transitions.
[2024-06-02 22:55:53] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:55:53] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:55:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality2061985023278792128.gal : 3 ms
[2024-06-02 22:55:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality8261878643309740894.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/CTLCardinality2061985023278792128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8261878643309740894.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-06-02 22:56:23] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:56:23] [INFO ] Applying decomposition
[2024-06-02 22:56:23] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10474310792673025227.txt' '-o' '/tmp/graph10474310792673025227.bin' '-w' '/tmp/graph10474310792673025227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10474310792673025227.bin' '-l' '-1' '-v' '-w' '/tmp/graph10474310792673025227.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:56:23] [INFO ] Decomposing Gal with order
[2024-06-02 22:56:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:56:23] [INFO ] Removed a total of 500 redundant transitions.
[2024-06-02 22:56:23] [INFO ] Flatten gal took : 42 ms
[2024-06-02 22:56:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 13 ms.
[2024-06-02 22:56:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality8482223040927542705.gal : 11 ms
[2024-06-02 22:56:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality11964960401670662492.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/CTLCardinality8482223040927542705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11964960401670662492.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 : 359/359 places, 569/569 transitions.
Graph (trivial) has 282 edges and 359 vertex of which 9 / 359 are part of one of the 2 SCC in 2 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 973 edges and 352 vertex of which 349 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 348 transition count 487
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 77 rules applied. Total rules applied 153 place count 274 transition count 484
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 157 place count 272 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 271 transition count 482
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 158 place count 271 transition count 464
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 194 place count 253 transition count 464
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 213 place count 234 transition count 442
Iterating global reduction 4 with 19 rules applied. Total rules applied 232 place count 234 transition count 442
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 232 place count 234 transition count 434
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 248 place count 226 transition count 434
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 251 place count 223 transition count 430
Iterating global reduction 4 with 3 rules applied. Total rules applied 254 place count 223 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 256 place count 223 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 257 place count 222 transition count 428
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 315 place count 193 transition count 399
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 318 place count 190 transition count 375
Iterating global reduction 6 with 3 rules applied. Total rules applied 321 place count 190 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 322 place count 190 transition count 374
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 324 place count 188 transition count 372
Applied a total of 324 rules in 60 ms. Remains 188 /359 variables (removed 171) and now considering 372/569 (removed 197) transitions.
[2024-06-02 22:56:54] [INFO ] Flow matrix only has 371 transitions (discarded 1 similar events)
// Phase 1: matrix 371 rows 188 cols
[2024-06-02 22:56:54] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:56:54] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-02 22:56:54] [INFO ] Flow matrix only has 371 transitions (discarded 1 similar events)
[2024-06-02 22:56:54] [INFO ] Invariant cache hit.
[2024-06-02 22:56:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:56:54] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-02 22:56:54] [INFO ] Redundant transitions in 25 ms returned []
Running 362 sub problems to find dead transitions.
[2024-06-02 22:56:54] [INFO ] Flow matrix only has 371 transitions (discarded 1 similar events)
[2024-06-02 22:56:54] [INFO ] Invariant cache hit.
[2024-06-02 22:56:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 22:56:55] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:56:56] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:56:56] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:56:56] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-06-02 22:56:56] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:56:56] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:56:57] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (OVERLAPS) 370/555 variables, 185/199 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 22:57:02] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:57:02] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:57:02] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:57:02] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 2 ms to minimize.
[2024-06-02 22:57:02] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (OVERLAPS) 3/558 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 9 (OVERLAPS) 0/558 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/559 variables, and 209 constraints, problems are : Problem set: 0 solved, 362 unsolved in 23872 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 22:57:20] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 370/555 variables, 185/205 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 357/564 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (OVERLAPS) 3/558 variables, 3/567 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 5/572 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/559 variables, and 572 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 13/13 constraints]
After SMT, in 54017ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 54020ms
Starting structural reductions in SI_CTL mode, iteration 1 : 188/359 places, 372/569 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54431 ms. Remains : 188/359 places, 372/569 transitions.
[2024-06-02 22:57:48] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:57:48] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:57:48] [INFO ] Input system was already deterministic with 372 transitions.
[2024-06-02 22:57:48] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:57:48] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:57:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality4911943170300483132.gal : 2 ms
[2024-06-02 22:57:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality14683892560318746494.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/CTLCardinality4911943170300483132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14683892560318746494.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.70484e+09,13.5905,363056,2,11834,5,968440,6,0,1118,1.82626e+06,0


Converting to forward existential form...Done !
original formula: AF((EG((((p418==1)&&((p59==0)||(p43==1))) + E((p271==0) U (p376==1)))) * EG(((p265==0)||(p42==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((EG((((p418==1)&&((p59==0)||(p43==1))) + E((p271==0) U (p376==1)))) * EG(((p265==0)||(p42==1))))))]...163
Reverse transition relation is NOT exact ! Due to transitions t6, t15, t21, t33, t35, t42, t50, t56, t58, t69, t71, t88, t92, t93, t94, t96, t97, t99, t100...725
Detected timeout of ITS tools.
[2024-06-02 22:58:18] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:58:18] [INFO ] Applying decomposition
[2024-06-02 22:58:18] [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/graph5295928239657687255.txt' '-o' '/tmp/graph5295928239657687255.bin' '-w' '/tmp/graph5295928239657687255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5295928239657687255.bin' '-l' '-1' '-v' '-w' '/tmp/graph5295928239657687255.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:58:18] [INFO ] Decomposing Gal with order
[2024-06-02 22:58:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:58:18] [INFO ] Removed a total of 433 redundant transitions.
[2024-06-02 22:58:18] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:58:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 18 ms.
[2024-06-02 22:58:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality12828974428202311909.gal : 19 ms
[2024-06-02 22:58:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality16763659454744119687.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/CTLCardinality12828974428202311909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16763659454744119687.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.70484e+09,6.67375,236164,2371,78,311404,2985,812,1.63087e+06,95,15115,0


Converting to forward existential form...Done !
original formula: AF((EG((((i10.u65.p418==1)&&((i3.i0.u6.p59==0)||(i2.u4.p43==1))) + E((i7.i1.u49.p271==0) U (i9.u62.p376==1)))) * EG(((i1.u37.p265==0)||(i...171
=> equivalent forward existential formula: [FwdG(Init,!((EG((((i10.u65.p418==1)&&((i3.i0.u6.p59==0)||(i2.u4.p43==1))) + E((i7.i1.u49.p271==0) U (i9.u62.p37...216
Reverse transition relation is NOT exact ! Due to transitions t88, t107, t108, t114, t116, t155, t160, t175, t176, t182, t225, t227, t234, t245, t266, t277...1121
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Graph (trivial) has 284 edges and 359 vertex of which 18 / 359 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 964 edges and 344 vertex of which 340 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 339 transition count 480
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 76 rules applied. Total rules applied 150 place count 267 transition count 476
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 152 place count 265 transition count 476
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 152 place count 265 transition count 460
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 184 place count 249 transition count 460
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 206 place count 227 transition count 435
Iterating global reduction 3 with 22 rules applied. Total rules applied 228 place count 227 transition count 435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 229 place count 227 transition count 434
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 229 place count 227 transition count 426
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 245 place count 219 transition count 426
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 249 place count 215 transition count 419
Iterating global reduction 4 with 4 rules applied. Total rules applied 253 place count 215 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 255 place count 215 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 256 place count 214 transition count 417
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 312 place count 186 transition count 389
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 315 place count 183 transition count 365
Iterating global reduction 6 with 3 rules applied. Total rules applied 318 place count 183 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 319 place count 183 transition count 364
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 320 place count 183 transition count 364
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 322 place count 181 transition count 362
Applied a total of 322 rules in 58 ms. Remains 181 /359 variables (removed 178) and now considering 362/569 (removed 207) transitions.
[2024-06-02 22:58:48] [INFO ] Flow matrix only has 358 transitions (discarded 4 similar events)
// Phase 1: matrix 358 rows 181 cols
[2024-06-02 22:58:48] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:58:48] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 22:58:48] [INFO ] Flow matrix only has 358 transitions (discarded 4 similar events)
[2024-06-02 22:58:48] [INFO ] Invariant cache hit.
[2024-06-02 22:58:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 22:58:49] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-06-02 22:58:49] [INFO ] Redundant transitions in 7 ms returned []
Running 353 sub problems to find dead transitions.
[2024-06-02 22:58:49] [INFO ] Flow matrix only has 358 transitions (discarded 4 similar events)
[2024-06-02 22:58:49] [INFO ] Invariant cache hit.
[2024-06-02 22:58:49] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-06-02 22:58:50] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:58:50] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:58:50] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:58:50] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:58:50] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 2 ms to minimize.
[2024-06-02 22:58:51] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:58:51] [INFO ] Deduced a trap composed of 109 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:58:51] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 357/536 variables, 179/194 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 22/216 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-06-02 22:58:56] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:58:58] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (OVERLAPS) 2/538 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 9 (OVERLAPS) 0/538 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 353 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/539 variables, and 220 constraints, problems are : Problem set: 0 solved, 353 unsolved in 22505 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (OVERLAPS) 357/536 variables, 179/196 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 22/218 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 353/571 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (OVERLAPS) 2/538 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 9 (OVERLAPS) 0/538 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 353 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/539 variables, and 573 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 10/10 constraints]
After SMT, in 52637ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 52641ms
Starting structural reductions in SI_CTL mode, iteration 1 : 181/359 places, 362/569 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53041 ms. Remains : 181/359 places, 362/569 transitions.
[2024-06-02 22:59:41] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:59:41] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:59:41] [INFO ] Input system was already deterministic with 362 transitions.
[2024-06-02 22:59:41] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:59:41] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:59:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9764302253268649173.gal : 16 ms
[2024-06-02 22:59:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7520858186595641518.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/ReachabilityCardinality9764302253268649173.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7520858186595641518.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (2172 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (458 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 23934 steps, run visited all 1 properties in 48 ms. (steps per millisecond=498 )
Probabilistic random walk after 23934 steps, saw 6863 distinct states, run finished after 48 ms. (steps per millisecond=498 ) properties seen :1
FORMULA FireWire-PT-17-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 41 place count 318 transition count 529
Iterating global reduction 1 with 37 rules applied. Total rules applied 78 place count 318 transition count 529
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 89 place count 307 transition count 514
Iterating global reduction 1 with 11 rules applied. Total rules applied 100 place count 307 transition count 514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 307 transition count 513
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 304 transition count 510
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 304 transition count 510
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 302 transition count 508
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 302 transition count 508
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 301 transition count 507
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 301 transition count 507
Applied a total of 113 rules in 24 ms. Remains 301 /359 variables (removed 58) and now considering 507/569 (removed 62) transitions.
// Phase 1: matrix 507 rows 301 cols
[2024-06-02 22:59:42] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:59:42] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-02 22:59:42] [INFO ] Invariant cache hit.
[2024-06-02 22:59:42] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 506 sub problems to find dead transitions.
[2024-06-02 22:59:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-06-02 22:59:47] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:59:47] [INFO ] Deduced a trap composed of 151 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:59:47] [INFO ] Deduced a trap composed of 141 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:59:48] [INFO ] Deduced a trap composed of 155 places in 102 ms of which 2 ms to minimize.
[2024-06-02 22:59:48] [INFO ] Deduced a trap composed of 152 places in 88 ms of which 2 ms to minimize.
[2024-06-02 22:59:48] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:59:48] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:59:48] [INFO ] Deduced a trap composed of 75 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:59:48] [INFO ] Deduced a trap composed of 92 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:59:49] [INFO ] Deduced a trap composed of 86 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:59:49] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:59:49] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2024-06-02 22:59:50] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:59:51] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-06-02 22:59:52] [INFO ] Deduced a trap composed of 87 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:59:52] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:59:53] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-06-02 22:59:58] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:59:58] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-06-02 23:00:02] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:00:05] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 7 (OVERLAPS) 507/808 variables, 301/329 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-06-02 23:00:12] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
SMT process timed out in 30191ms, After SMT, problems are : Problem set: 0 solved, 506 unsolved
Search for dead transitions found 0 dead transitions in 30197ms
Starting structural reductions in LTL mode, iteration 1 : 301/359 places, 507/569 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30607 ms. Remains : 301/359 places, 507/569 transitions.
[2024-06-02 23:00:12] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:00:12] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:00:12] [INFO ] Input system was already deterministic with 507 transitions.
[2024-06-02 23:00:12] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:00:12] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:00:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality15957793732190307705.gal : 2 ms
[2024-06-02 23:00:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9403108147480576885.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/CTLCardinality15957793732190307705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9403108147480576885.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-06-02 23:00:42] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:00:42] [INFO ] Applying decomposition
[2024-06-02 23:00:42] [INFO ] Flatten gal took : 11 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/graph17007170510859190252.txt' '-o' '/tmp/graph17007170510859190252.bin' '-w' '/tmp/graph17007170510859190252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17007170510859190252.bin' '-l' '-1' '-v' '-w' '/tmp/graph17007170510859190252.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:00:42] [INFO ] Decomposing Gal with order
[2024-06-02 23:00:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:00:42] [INFO ] Removed a total of 528 redundant transitions.
[2024-06-02 23:00:42] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:00:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 7 ms.
[2024-06-02 23:00:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality6979972373405237462.gal : 4 ms
[2024-06-02 23:00:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality5700307923804209977.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/CTLCardinality6979972373405237462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5700307923804209977.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 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 320 transition count 531
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 320 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 320 transition count 530
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 84 place count 311 transition count 519
Iterating global reduction 2 with 9 rules applied. Total rules applied 93 place count 311 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 311 transition count 518
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 309 transition count 516
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 309 transition count 516
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 308 transition count 515
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 308 transition count 515
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 307 transition count 514
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 307 transition count 514
Applied a total of 102 rules in 15 ms. Remains 307 /359 variables (removed 52) and now considering 514/569 (removed 55) transitions.
// Phase 1: matrix 514 rows 307 cols
[2024-06-02 23:01:12] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 23:01:13] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 23:01:13] [INFO ] Invariant cache hit.
[2024-06-02 23:01:13] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 513 sub problems to find dead transitions.
[2024-06-02 23:01:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-06-02 23:01:18] [INFO ] Deduced a trap composed of 190 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:01:18] [INFO ] Deduced a trap composed of 147 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:01:18] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:01:18] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 0 ms to minimize.
[2024-06-02 23:01:18] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:01:19] [INFO ] Deduced a trap composed of 88 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:01:19] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:01:20] [INFO ] Deduced a trap composed of 89 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:01:20] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:01:20] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:01:20] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:01:21] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:01:23] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-06-02 23:01:23] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:01:24] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 5 (OVERLAPS) 514/821 variables, 307/329 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 513 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 821/821 variables, and 329 constraints, problems are : Problem set: 0 solved, 513 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 513/513 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 513 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-06-02 23:01:46] [INFO ] Deduced a trap composed of 157 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:01:46] [INFO ] Deduced a trap composed of 155 places in 94 ms of which 5 ms to minimize.
[2024-06-02 23:01:47] [INFO ] Deduced a trap composed of 157 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:01:47] [INFO ] Deduced a trap composed of 155 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 5 (OVERLAPS) 514/821 variables, 307/333 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 513/846 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/821 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-06-02 23:02:12] [INFO ] Deduced a trap composed of 164 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:02:12] [INFO ] Deduced a trap composed of 166 places in 89 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 821/821 variables, and 848 constraints, problems are : Problem set: 0 solved, 513 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 513/513 constraints, Known Traps: 21/21 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in LTL mode, iteration 1 : 307/359 places, 514/569 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60580 ms. Remains : 307/359 places, 514/569 transitions.
[2024-06-02 23:02:13] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:02:13] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:02:13] [INFO ] Input system was already deterministic with 514 transitions.
[2024-06-02 23:02:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:02:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:02:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality901675762666710218.gal : 3 ms
[2024-06-02 23:02:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality795546789329874154.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/CTLCardinality901675762666710218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality795546789329874154.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:02:43] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:02:43] [INFO ] Applying decomposition
[2024-06-02 23:02:43] [INFO ] Flatten gal took : 15 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/graph7775561008439632078.txt' '-o' '/tmp/graph7775561008439632078.bin' '-w' '/tmp/graph7775561008439632078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7775561008439632078.bin' '-l' '-1' '-v' '-w' '/tmp/graph7775561008439632078.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:02:43] [INFO ] Decomposing Gal with order
[2024-06-02 23:02:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:02:43] [INFO ] Removed a total of 532 redundant transitions.
[2024-06-02 23:02:43] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:02:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 7 ms.
[2024-06-02 23:02:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality16438007620264635069.gal : 3 ms
[2024-06-02 23:02:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality1510834852947207838.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/CTLCardinality16438007620264635069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1510834852947207838.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 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 42 place count 317 transition count 530
Iterating global reduction 1 with 38 rules applied. Total rules applied 80 place count 317 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 317 transition count 529
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 304 transition count 511
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 304 transition count 511
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 304 transition count 510
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 301 transition count 507
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 301 transition count 507
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 299 transition count 505
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 299 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 298 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 298 transition count 504
Applied a total of 120 rules in 21 ms. Remains 298 /359 variables (removed 61) and now considering 504/569 (removed 65) transitions.
// Phase 1: matrix 504 rows 298 cols
[2024-06-02 23:03:13] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:03:13] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 23:03:13] [INFO ] Invariant cache hit.
[2024-06-02 23:03:14] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-06-02 23:03:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 23:03:18] [INFO ] Deduced a trap composed of 143 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:03:19] [INFO ] Deduced a trap composed of 156 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:03:19] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:03:19] [INFO ] Deduced a trap composed of 86 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:03:20] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:03:20] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 0 ms to minimize.
[2024-06-02 23:03:20] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:03:21] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:03:22] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:03:23] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 23:03:25] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (OVERLAPS) 504/802 variables, 298/316 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 23:03:34] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:03:35] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/802 variables, and 318 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 504/802 variables, 298/318 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 503/821 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 23:03:54] [INFO ] Deduced a trap composed of 110 places in 103 ms of which 1 ms to minimize.
[2024-06-02 23:03:56] [INFO ] Deduced a trap composed of 111 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:03:56] [INFO ] Deduced a trap composed of 111 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:03:56] [INFO ] Deduced a trap composed of 107 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:03:59] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 5/826 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 23:04:10] [INFO ] Deduced a trap composed of 152 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/802 variables, and 827 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 19/19 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 298/359 places, 504/569 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60518 ms. Remains : 298/359 places, 504/569 transitions.
[2024-06-02 23:04:14] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:04:14] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:04:14] [INFO ] Input system was already deterministic with 504 transitions.
[2024-06-02 23:04:14] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:04:14] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:04:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality7758620992014708553.gal : 2 ms
[2024-06-02 23:04:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality6168818328031143096.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/CTLCardinality7758620992014708553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6168818328031143096.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-06-02 23:04:44] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:04:44] [INFO ] Applying decomposition
[2024-06-02 23:04:44] [INFO ] Flatten gal took : 10 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/graph11317824301751490617.txt' '-o' '/tmp/graph11317824301751490617.bin' '-w' '/tmp/graph11317824301751490617.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11317824301751490617.bin' '-l' '-1' '-v' '-w' '/tmp/graph11317824301751490617.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:04:44] [INFO ] Decomposing Gal with order
[2024-06-02 23:04:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:04:44] [INFO ] Removed a total of 531 redundant transitions.
[2024-06-02 23:04:44] [INFO ] Flatten gal took : 35 ms
[2024-06-02 23:04:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 17 ms.
[2024-06-02 23:04:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality17468815338092033801.gal : 5 ms
[2024-06-02 23:04:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality200498640314206446.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/CTLCardinality17468815338092033801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality200498640314206446.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.
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.89692e+11,21.4637,615660,3215,73,745546,1673,969,4.67576e+06,87,5463,0


Converting to forward existential form...Done !
original formula: (EX(AX((((i11.u96.p360==0)||(i7.i1.i1.u65.p228==1))&&(((i7.i1.i1.u65.p254==0)&&(i12.u109.p406==1))||(i3.u24.p99==1))))) + EF(!(E(E(EG(((i...257
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!((((i11.u96.p360==0)||(i7.i1.i1.u65.p228==1))&&(((i7.i1.i1.u65.p254==0)&&(i12.u109.p406==1))...341
Reverse transition relation is NOT exact ! Due to transitions t22, t119, t216, t222, t235, t237, t246, t250, t287, t336, t353, t354, t362, t387, t389, t390...1139
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Graph (trivial) has 290 edges and 359 vertex of which 14 / 359 are part of one of the 2 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 967 edges and 347 vertex of which 343 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 342 transition count 478
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 81 rules applied. Total rules applied 160 place count 265 transition count 474
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 263 transition count 474
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 162 place count 263 transition count 457
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 196 place count 246 transition count 457
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 218 place count 224 transition count 432
Iterating global reduction 3 with 22 rules applied. Total rules applied 240 place count 224 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 241 place count 224 transition count 431
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 241 place count 224 transition count 423
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 257 place count 216 transition count 423
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 261 place count 212 transition count 416
Iterating global reduction 4 with 4 rules applied. Total rules applied 265 place count 212 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 267 place count 212 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 268 place count 211 transition count 414
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 324 place count 183 transition count 386
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 327 place count 180 transition count 362
Iterating global reduction 6 with 3 rules applied. Total rules applied 330 place count 180 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 331 place count 180 transition count 361
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 333 place count 178 transition count 359
Applied a total of 333 rules in 38 ms. Remains 178 /359 variables (removed 181) and now considering 359/569 (removed 210) transitions.
[2024-06-02 23:05:14] [INFO ] Flow matrix only has 356 transitions (discarded 3 similar events)
// Phase 1: matrix 356 rows 178 cols
[2024-06-02 23:05:14] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:05:14] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 23:05:14] [INFO ] Flow matrix only has 356 transitions (discarded 3 similar events)
[2024-06-02 23:05:14] [INFO ] Invariant cache hit.
[2024-06-02 23:05:14] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-02 23:05:14] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-06-02 23:05:14] [INFO ] Redundant transitions in 8 ms returned []
Running 350 sub problems to find dead transitions.
[2024-06-02 23:05:14] [INFO ] Flow matrix only has 356 transitions (discarded 3 similar events)
[2024-06-02 23:05:14] [INFO ] Invariant cache hit.
[2024-06-02 23:05:14] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-02 23:05:16] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:05:16] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:05:16] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-06-02 23:05:16] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:05:16] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-06-02 23:05:17] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:05:17] [INFO ] Deduced a trap composed of 104 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:05:17] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 2 ms to minimize.
[2024-06-02 23:05:17] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (OVERLAPS) 355/531 variables, 176/192 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 22/214 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-02 23:05:21] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-02 23:05:25] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 8 (OVERLAPS) 2/533 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/533 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 10 (OVERLAPS) 1/534 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/534 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 12 (OVERLAPS) 0/534 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 350 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 219 constraints, problems are : Problem set: 0 solved, 350 unsolved in 29064 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (OVERLAPS) 355/531 variables, 176/194 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 22/216 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 350/566 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 7 (OVERLAPS) 2/533 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-02 23:05:56] [INFO ] Deduced a trap composed of 124 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/533 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 10 (OVERLAPS) 1/534 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-02 23:06:10] [INFO ] Deduced a trap composed of 106 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 571 constraints, problems are : Problem set: 0 solved, 350 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 13/13 constraints]
After SMT, in 59182ms problems are : Problem set: 0 solved, 350 unsolved
Search for dead transitions found 0 dead transitions in 59185ms
Starting structural reductions in SI_CTL mode, iteration 1 : 178/359 places, 359/569 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59503 ms. Remains : 178/359 places, 359/569 transitions.
[2024-06-02 23:06:14] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:06:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:06:14] [INFO ] Input system was already deterministic with 359 transitions.
[2024-06-02 23:06:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:06:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:06:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality8297812400429121457.gal : 2 ms
[2024-06-02 23:06:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality6202091738564898678.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/CTLCardinality8297812400429121457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6202091738564898678.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.43982e+08,7.07917,189960,2,9336,5,340261,6,0,1068,785204,0


Converting to forward existential form...Done !
original formula: AG(AF((p2==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p2==1)))] = FALSE
Hit Full ! (commute/partial/dont) 357/0/2
(forward)formula 0,0,9.76744,192128,1,0,8,561211,20,3,5746,785204,8
FORMULA FireWire-PT-17-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Graph (trivial) has 283 edges and 359 vertex of which 11 / 359 are part of one of the 2 SCC in 2 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 971 edges and 350 vertex of which 347 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 346 transition count 486
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 77 rules applied. Total rules applied 152 place count 273 transition count 482
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 155 place count 271 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 270 transition count 481
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 156 place count 270 transition count 464
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 190 place count 253 transition count 464
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 212 place count 231 transition count 439
Iterating global reduction 4 with 22 rules applied. Total rules applied 234 place count 231 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 235 place count 231 transition count 438
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 235 place count 231 transition count 430
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 251 place count 223 transition count 430
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 255 place count 219 transition count 423
Iterating global reduction 5 with 4 rules applied. Total rules applied 259 place count 219 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 261 place count 219 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 262 place count 218 transition count 421
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 318 place count 190 transition count 393
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 321 place count 187 transition count 369
Iterating global reduction 7 with 3 rules applied. Total rules applied 324 place count 187 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 325 place count 187 transition count 368
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 327 place count 185 transition count 366
Applied a total of 327 rules in 43 ms. Remains 185 /359 variables (removed 174) and now considering 366/569 (removed 203) transitions.
[2024-06-02 23:06:24] [INFO ] Flow matrix only has 365 transitions (discarded 1 similar events)
// Phase 1: matrix 365 rows 185 cols
[2024-06-02 23:06:24] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:06:24] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 23:06:24] [INFO ] Flow matrix only has 365 transitions (discarded 1 similar events)
[2024-06-02 23:06:24] [INFO ] Invariant cache hit.
[2024-06-02 23:06:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 23:06:24] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-02 23:06:24] [INFO ] Redundant transitions in 2 ms returned []
Running 357 sub problems to find dead transitions.
[2024-06-02 23:06:24] [INFO ] Flow matrix only has 365 transitions (discarded 1 similar events)
[2024-06-02 23:06:24] [INFO ] Invariant cache hit.
[2024-06-02 23:06:24] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-02 23:06:25] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:06:26] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:06:26] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:06:26] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:06:26] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:06:26] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:06:26] [INFO ] Deduced a trap composed of 105 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:06:27] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-02 23:06:28] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 364/546 variables, 182/198 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-02 23:06:34] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (OVERLAPS) 3/549 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/549 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 10 (OVERLAPS) 1/550 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/550 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 12 (OVERLAPS) 0/550 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 205 constraints, problems are : Problem set: 0 solved, 357 unsolved in 27714 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 185/185 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-02 23:06:52] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 364/546 variables, 182/200 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 355/557 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-02 23:07:00] [INFO ] Deduced a trap composed of 113 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 9 (OVERLAPS) 3/549 variables, 3/561 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 12 (OVERLAPS) 1/550 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 564 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 185/185 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 12/12 constraints]
After SMT, in 57833ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 57837ms
Starting structural reductions in SI_CTL mode, iteration 1 : 185/359 places, 366/569 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58199 ms. Remains : 185/359 places, 366/569 transitions.
[2024-06-02 23:07:22] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:07:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:07:22] [INFO ] Input system was already deterministic with 366 transitions.
[2024-06-02 23:07:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:07:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:07:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality18440467858834009195.gal : 1 ms
[2024-06-02 23:07:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality6180876494271477360.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/CTLCardinality18440467858834009195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6180876494271477360.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.73207e+09,16.726,397276,2,11448,5,840602,6,0,1101,1.74359e+06,0


Converting to forward existential form...Done !
original formula: E(AG(E(E((p282==1) U AF((p381==1))) U !(AG((p229==0))))) U E((p3==1) U !(((p315==0)||(p52==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(E(TRUE U !(E(E((p282==1) U !(EG(!((p381==1))))) U !(!(E(TRUE U !((p229==0)))))))))),(p3==1)) ...192
Reverse transition relation is NOT exact ! Due to transitions t8, t16, t22, t34, t36, t43, t51, t57, t59, t70, t72, t80, t86, t92, t93, t94, t96, t97, t99,...712
Detected timeout of ITS tools.
[2024-06-02 23:07:52] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:07:52] [INFO ] Applying decomposition
[2024-06-02 23:07:52] [INFO ] Flatten gal took : 7 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/graph1192363086156425589.txt' '-o' '/tmp/graph1192363086156425589.bin' '-w' '/tmp/graph1192363086156425589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1192363086156425589.bin' '-l' '-1' '-v' '-w' '/tmp/graph1192363086156425589.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:07:52] [INFO ] Decomposing Gal with order
[2024-06-02 23:07:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:07:52] [INFO ] Removed a total of 470 redundant transitions.
[2024-06-02 23:07:52] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:07:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 4 ms.
[2024-06-02 23:07:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality18185190414965305049.gal : 2 ms
[2024-06-02 23:07:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality1129826040583890561.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/CTLCardinality18185190414965305049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1129826040583890561.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,1.73207e+09,21.6252,554448,1959,67,468576,670,837,5.16036e+06,75,2416,0


Converting to forward existential form...Done !
original formula: E(AG(E(E((i8.u44.p282==1) U AF((i8.u64.p381==1))) U !(AG((i4.i1.u38.p229==0))))) U E((i0.u0.p3==1) U !(((i5.i0.u49.p315==0)||(i1.i0.u8.p5...164
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(E(TRUE U !(E(E((i8.u44.p282==1) U !(EG(!((i8.u64.p381==1))))) U !(!(E(TRUE U !((i4.i1.u38.p22...241
Reverse transition relation is NOT exact ! Due to transitions t80, t86, t92, t106, t108, t113, t164, t166, t171, t207, t209, t216, t226, t244, t259, t264, ...1077
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 40 place count 319 transition count 530
Iterating global reduction 1 with 36 rules applied. Total rules applied 76 place count 319 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 319 transition count 529
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 308 transition count 513
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 308 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 308 transition count 512
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 306 transition count 510
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 306 transition count 510
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 305 transition count 509
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 305 transition count 509
Applied a total of 106 rules in 17 ms. Remains 305 /359 variables (removed 54) and now considering 509/569 (removed 60) transitions.
// Phase 1: matrix 509 rows 305 cols
[2024-06-02 23:08:22] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:08:22] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 23:08:22] [INFO ] Invariant cache hit.
[2024-06-02 23:08:22] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 508 sub problems to find dead transitions.
[2024-06-02 23:08:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-02 23:08:27] [INFO ] Deduced a trap composed of 191 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:08:27] [INFO ] Deduced a trap composed of 156 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:08:27] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:08:27] [INFO ] Deduced a trap composed of 141 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:08:28] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:08:28] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:08:28] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:08:28] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:08:29] [INFO ] Deduced a trap composed of 130 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:08:29] [INFO ] Deduced a trap composed of 153 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:08:29] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:08:29] [INFO ] Deduced a trap composed of 160 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:08:30] [INFO ] Deduced a trap composed of 150 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:08:30] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:08:30] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:08:30] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:08:30] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-02 23:08:33] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (OVERLAPS) 509/814 variables, 305/330 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/814 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 814/814 variables, and 330 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 508 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (OVERLAPS) 509/814 variables, 305/330 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/814 variables, 508/838 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-02 23:09:07] [INFO ] Deduced a trap composed of 114 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:09:08] [INFO ] Deduced a trap composed of 163 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/814 variables, 2/840 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 814/814 variables, and 840 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 20/20 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 508 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 305/359 places, 509/569 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60567 ms. Remains : 305/359 places, 509/569 transitions.
[2024-06-02 23:09:23] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:09:23] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:09:23] [INFO ] Input system was already deterministic with 509 transitions.
[2024-06-02 23:09:23] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:09:23] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:09:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality3417692409421215558.gal : 2 ms
[2024-06-02 23:09:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality6657909129849241713.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/CTLCardinality3417692409421215558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6657909129849241713.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-06-02 23:09:53] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:09:53] [INFO ] Applying decomposition
[2024-06-02 23:09:53] [INFO ] Flatten gal took : 10 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/graph8521449097213541285.txt' '-o' '/tmp/graph8521449097213541285.bin' '-w' '/tmp/graph8521449097213541285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8521449097213541285.bin' '-l' '-1' '-v' '-w' '/tmp/graph8521449097213541285.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:09:53] [INFO ] Decomposing Gal with order
[2024-06-02 23:09:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:09:53] [INFO ] Removed a total of 527 redundant transitions.
[2024-06-02 23:09:53] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:09:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 4 ms.
[2024-06-02 23:09:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality18190804786257876644.gal : 4 ms
[2024-06-02 23:09:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality17734196704488802043.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/CTLCardinality18190804786257876644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17734196704488802043.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.37084e+11,7.97346,197476,2395,52,297346,1793,1042,766468,75,5313,0


Converting to forward existential form...Done !
original formula: E(A((((EX(TRUE) * EF((i1.i0.u7.p28!=1))) * ((i13.i2.u109.p387==0)&&((i9.i1.u82.p260==0)||(i13.i1.u107.p394==1)))) * ((i12.i0.u76.p282==0)...576
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!((E(!((E((((i1.i1.u9.p33==1)&&(i3.i1.u51.p201==1)) * !(EX(!(((i14.i1.u110.p401==0)||(i1.i2.u11...1531
Reverse transition relation is NOT exact ! Due to transitions t23, t125, t230, t243, t245, t254, t258, t279, t281, t282, t295, t344, t353, t356, t358, t361...1265
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Graph (trivial) has 273 edges and 359 vertex of which 18 / 359 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 964 edges and 344 vertex of which 341 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 340 transition count 483
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 72 rules applied. Total rules applied 143 place count 271 transition count 480
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 145 place count 269 transition count 480
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 145 place count 269 transition count 463
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 179 place count 252 transition count 463
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 194 place count 237 transition count 445
Iterating global reduction 3 with 15 rules applied. Total rules applied 209 place count 237 transition count 445
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 209 place count 237 transition count 439
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 221 place count 231 transition count 439
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 223 place count 229 transition count 436
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 229 transition count 436
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 227 place count 229 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 228 transition count 434
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 288 place count 198 transition count 404
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 290 place count 196 transition count 382
Iterating global reduction 5 with 2 rules applied. Total rules applied 292 place count 196 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 293 place count 196 transition count 381
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 295 place count 194 transition count 379
Applied a total of 295 rules in 40 ms. Remains 194 /359 variables (removed 165) and now considering 379/569 (removed 190) transitions.
[2024-06-02 23:10:23] [INFO ] Flow matrix only has 375 transitions (discarded 4 similar events)
// Phase 1: matrix 375 rows 194 cols
[2024-06-02 23:10:23] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:10:23] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-02 23:10:23] [INFO ] Flow matrix only has 375 transitions (discarded 4 similar events)
[2024-06-02 23:10:23] [INFO ] Invariant cache hit.
[2024-06-02 23:10:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 23:10:23] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-06-02 23:10:23] [INFO ] Redundant transitions in 2 ms returned []
Running 369 sub problems to find dead transitions.
[2024-06-02 23:10:23] [INFO ] Flow matrix only has 375 transitions (discarded 4 similar events)
[2024-06-02 23:10:23] [INFO ] Invariant cache hit.
[2024-06-02 23:10:23] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 23:10:25] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:10:25] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:10:25] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:10:25] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:10:25] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:10:26] [INFO ] Deduced a trap composed of 69 places in 39 ms of which 0 ms to minimize.
[2024-06-02 23:10:26] [INFO ] Deduced a trap composed of 69 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:10:26] [INFO ] Deduced a trap composed of 111 places in 68 ms of which 4 ms to minimize.
[2024-06-02 23:10:26] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:10:27] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:10:27] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 1/191 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 23:10:30] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:10:30] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:10:30] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (OVERLAPS) 374/565 variables, 191/212 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 22/234 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 23:10:38] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 10 (OVERLAPS) 3/568 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 12 (OVERLAPS) 0/568 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/569 variables, and 238 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 194/194 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 1/191 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 23:10:56] [INFO ] Deduced a trap composed of 115 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (OVERLAPS) 374/565 variables, 191/214 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 22/236 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 364/600 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 23:11:01] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:11:03] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 11 (OVERLAPS) 3/568 variables, 3/605 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 5/610 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/569 variables, and 610 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 194/194 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 18/18 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in SI_CTL mode, iteration 1 : 194/359 places, 379/569 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60535 ms. Remains : 194/359 places, 379/569 transitions.
[2024-06-02 23:11:23] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:11:23] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:11:23] [INFO ] Input system was already deterministic with 379 transitions.
[2024-06-02 23:11:23] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:11:23] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:11:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality7870486873811665561.gal : 1 ms
[2024-06-02 23:11:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality16539998080099313854.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/CTLCardinality7870486873811665561.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16539998080099313854.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.52453e+09,16.991,414580,2,22815,5,901661,6,0,1147,1.70044e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 23:11:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:11:53] [INFO ] Applying decomposition
[2024-06-02 23:11:53] [INFO ] Flatten gal took : 7 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/graph6951385390860065392.txt' '-o' '/tmp/graph6951385390860065392.bin' '-w' '/tmp/graph6951385390860065392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6951385390860065392.bin' '-l' '-1' '-v' '-w' '/tmp/graph6951385390860065392.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:11:54] [INFO ] Decomposing Gal with order
[2024-06-02 23:11:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:11:54] [INFO ] Removed a total of 444 redundant transitions.
[2024-06-02 23:11:54] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:11:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 4 ms.
[2024-06-02 23:11:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality169211285014326843.gal : 2 ms
[2024-06-02 23:11:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality10541350519880445435.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/CTLCardinality169211285014326843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10541350519880445435.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.52453e+09,26.7282,677732,1755,146,800159,4657,803,4.51149e+06,102,25272,0


Converting to forward existential form...Done !
original formula: AG(((((i6.i2.u62.p327==1) + AG(((i2.i0.u58.p351==0)||(i4.i1.u37.p247==1)))) + (EG(EF(!(A(((i6.i2.u53.p335==0)||(i4.i0.u34.p225==1)) U (i6...372
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,TRUE) * !((((i6.i2.u52.p330==0)&&(i5.u63.p371==1))&&((i6.i2.u53.p337==0)||(i8.i0.u66.p387==1...515
Reverse transition relation is NOT exact ! Due to transitions t88, t94, t98, t112, t114, t121, t157, t158, t172, t174, t179, t219, t224, t237, t254, t270, ...1101
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 42 place count 317 transition count 528
Iterating global reduction 1 with 38 rules applied. Total rules applied 80 place count 317 transition count 528
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 317 transition count 527
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 307 transition count 512
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 307 transition count 512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 306 transition count 511
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 306 transition count 511
Applied a total of 103 rules in 8 ms. Remains 306 /359 variables (removed 53) and now considering 511/569 (removed 58) transitions.
// Phase 1: matrix 511 rows 306 cols
[2024-06-02 23:12:24] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:12:24] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 23:12:24] [INFO ] Invariant cache hit.
[2024-06-02 23:12:24] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2024-06-02 23:12:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-06-02 23:12:29] [INFO ] Deduced a trap composed of 184 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:12:29] [INFO ] Deduced a trap composed of 145 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:12:29] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:12:29] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:12:30] [INFO ] Deduced a trap composed of 87 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:12:30] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:12:30] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:12:31] [INFO ] Deduced a trap composed of 86 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:12:31] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:12:31] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 0 ms to minimize.
[2024-06-02 23:12:31] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:12:31] [INFO ] Deduced a trap composed of 159 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:12:31] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:12:31] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:12:33] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-06-02 23:12:35] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-06-02 23:12:40] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:12:41] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (OVERLAPS) 511/817 variables, 306/331 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 817/817 variables, and 331 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (OVERLAPS) 511/817 variables, 306/331 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 510/841 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-06-02 23:13:19] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/817 variables, and 842 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 19/19 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Starting structural reductions in LTL mode, iteration 1 : 306/359 places, 511/569 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60534 ms. Remains : 306/359 places, 511/569 transitions.
[2024-06-02 23:13:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:13:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:13:24] [INFO ] Input system was already deterministic with 511 transitions.
[2024-06-02 23:13:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:13:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:13:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality612762342967474149.gal : 2 ms
[2024-06-02 23:13:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality13729744881390074299.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/CTLCardinality612762342967474149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13729744881390074299.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-06-02 23:13:54] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:13:54] [INFO ] Applying decomposition
[2024-06-02 23:13:54] [INFO ] Flatten gal took : 10 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/graph9620436446783251777.txt' '-o' '/tmp/graph9620436446783251777.bin' '-w' '/tmp/graph9620436446783251777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9620436446783251777.bin' '-l' '-1' '-v' '-w' '/tmp/graph9620436446783251777.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:13:54] [INFO ] Decomposing Gal with order
[2024-06-02 23:13:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:13:54] [INFO ] Removed a total of 507 redundant transitions.
[2024-06-02 23:13:54] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:13:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 4 ms.
[2024-06-02 23:13:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality12084746359426491200.gal : 3 ms
[2024-06-02 23:13:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality17800812322586635296.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/CTLCardinality12084746359426491200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17800812322586635296.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.45049e+11,4.7417,155232,2289,41,224786,1218,1037,709770,70,5134,0


Converting to forward existential form...Done !
original formula: (AF(((i4.i0.u49.p196==0)||(i12.u104.p376==1))) * E((i12.u78.p261==0) U (((i3.u46.p181==0)||(i14.i1.u114.p420==1)) * !(E(EX((i3.u96.p354==...208
=> equivalent forward existential formula: ([FwdG(Init,!(((i4.i0.u49.p196==0)||(i12.u104.p376==1))))] = FALSE * [(Init * !(E((i12.u78.p261==0) U (((i3.u46....275
Reverse transition relation is NOT exact ! Due to transitions t26, t127, t225, t231, t244, t255, t260, t265, t270, t275, t280, t282, t283, t296, t345, t354...1174
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 40 place count 319 transition count 530
Iterating global reduction 1 with 36 rules applied. Total rules applied 76 place count 319 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 319 transition count 529
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 90 place count 306 transition count 511
Iterating global reduction 2 with 13 rules applied. Total rules applied 103 place count 306 transition count 511
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 306 transition count 510
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 303 transition count 507
Iterating global reduction 3 with 3 rules applied. Total rules applied 110 place count 303 transition count 507
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 301 transition count 505
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 301 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 300 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 300 transition count 504
Applied a total of 116 rules in 17 ms. Remains 300 /359 variables (removed 59) and now considering 504/569 (removed 65) transitions.
// Phase 1: matrix 504 rows 300 cols
[2024-06-02 23:14:24] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:14:24] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 23:14:24] [INFO ] Invariant cache hit.
[2024-06-02 23:14:25] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-06-02 23:14:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 23:14:29] [INFO ] Deduced a trap composed of 195 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 146 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 0 ms to minimize.
[2024-06-02 23:14:31] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:14:31] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:14:31] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:14:31] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:14:31] [INFO ] Deduced a trap composed of 86 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:14:31] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:14:32] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:14:33] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 23:14:34] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:14:34] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:14:36] [INFO ] Deduced a trap composed of 156 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:14:36] [INFO ] Deduced a trap composed of 156 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:14:36] [INFO ] Deduced a trap composed of 153 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:14:36] [INFO ] Deduced a trap composed of 140 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:14:36] [INFO ] Deduced a trap composed of 151 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:14:36] [INFO ] Deduced a trap composed of 159 places in 76 ms of which 2 ms to minimize.
[2024-06-02 23:14:37] [INFO ] Deduced a trap composed of 156 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:14:37] [INFO ] Deduced a trap composed of 156 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:14:37] [INFO ] Deduced a trap composed of 153 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 23:14:41] [INFO ] Deduced a trap composed of 158 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:14:42] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 504/804 variables, 300/334 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 804/804 variables, and 334 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 504/804 variables, 300/334 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 503/837 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 23:15:04] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/804 variables, 1/838 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/804 variables, and 838 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 28/28 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 300/359 places, 504/569 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60518 ms. Remains : 300/359 places, 504/569 transitions.
[2024-06-02 23:15:25] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:15:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:15:25] [INFO ] Input system was already deterministic with 504 transitions.
[2024-06-02 23:15:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:15:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:15:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality12046393517522025901.gal : 2 ms
[2024-06-02 23:15:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality9564593443914766029.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/CTLCardinality12046393517522025901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9564593443914766029.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-06-02 23:15:55] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:15:55] [INFO ] Applying decomposition
[2024-06-02 23:15:55] [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/graph5045709894580513668.txt' '-o' '/tmp/graph5045709894580513668.bin' '-w' '/tmp/graph5045709894580513668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5045709894580513668.bin' '-l' '-1' '-v' '-w' '/tmp/graph5045709894580513668.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:15:55] [INFO ] Decomposing Gal with order
[2024-06-02 23:15:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:15:55] [INFO ] Removed a total of 524 redundant transitions.
[2024-06-02 23:15:55] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:15:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 4 ms.
[2024-06-02 23:15:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality17992427689988380390.gal : 3 ms
[2024-06-02 23:15:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality17733065254032632970.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/CTLCardinality17992427689988380390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17733065254032632970.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.14411e+11,12.0426,421752,3152,48,606325,1108,1021,2.97443e+06,80,3048,0


Converting to forward existential form...Done !
original formula: EX(AF(((!(A((i9.i1.u82.p309==1) U ((i0.u10.p35==0)||(i6.i1.u55.p198==1)))) + AG((((i11.i0.u74.p284==0)&&(i4.i2.u49.p193==1))||(i1.u11.p42...258
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((!(!((E(!(((i0.u10.p35==0)||(i6.i1.u55.p198==1))) U (!((i9.i1.u82.p309==1)) * !(((i0.u10.p3...426
Reverse transition relation is NOT exact ! Due to transitions t22, t119, t198, t218, t238, t240, t249, t258, t274, t276, t277, t290, t339, t356, t357, t365...1288
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 43 place count 316 transition count 527
Iterating global reduction 1 with 39 rules applied. Total rules applied 82 place count 316 transition count 527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 316 transition count 526
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 305 transition count 510
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 305 transition count 510
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 305 transition count 509
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 303 transition count 507
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 303 transition count 507
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 302 transition count 506
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 302 transition count 506
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 301 transition count 505
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 301 transition count 505
Applied a total of 114 rules in 20 ms. Remains 301 /359 variables (removed 58) and now considering 505/569 (removed 64) transitions.
// Phase 1: matrix 505 rows 301 cols
[2024-06-02 23:16:25] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:16:25] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 23:16:25] [INFO ] Invariant cache hit.
[2024-06-02 23:16:26] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 504 sub problems to find dead transitions.
[2024-06-02 23:16:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2024-06-02 23:16:30] [INFO ] Deduced a trap composed of 183 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:16:30] [INFO ] Deduced a trap composed of 154 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:16:30] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:16:31] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:16:31] [INFO ] Deduced a trap composed of 78 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:16:31] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:16:32] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:16:32] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 2 ms to minimize.
[2024-06-02 23:16:33] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:16:34] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2024-06-02 23:16:35] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:16:36] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:16:37] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (OVERLAPS) 505/806 variables, 301/321 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2024-06-02 23:16:47] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 322 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (OVERLAPS) 505/806 variables, 301/322 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 504/826 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2024-06-02 23:17:08] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:17:08] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 1 ms to minimize.
[2024-06-02 23:17:10] [INFO ] Deduced a trap composed of 152 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:17:11] [INFO ] Deduced a trap composed of 151 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:17:14] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:17:17] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 6/832 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 832 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 20/20 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 504 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in LTL mode, iteration 1 : 301/359 places, 505/569 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60543 ms. Remains : 301/359 places, 505/569 transitions.
[2024-06-02 23:17:26] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:17:26] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:17:26] [INFO ] Input system was already deterministic with 505 transitions.
[2024-06-02 23:17:26] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:17:26] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:17:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality3664254348417729358.gal : 2 ms
[2024-06-02 23:17:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality2643200978417653503.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/CTLCardinality3664254348417729358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2643200978417653503.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-06-02 23:17:56] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:17:56] [INFO ] Applying decomposition
[2024-06-02 23:17:56] [INFO ] Flatten gal took : 10 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/graph7092483757487051165.txt' '-o' '/tmp/graph7092483757487051165.bin' '-w' '/tmp/graph7092483757487051165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7092483757487051165.bin' '-l' '-1' '-v' '-w' '/tmp/graph7092483757487051165.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:17:56] [INFO ] Decomposing Gal with order
[2024-06-02 23:17:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:17:56] [INFO ] Removed a total of 528 redundant transitions.
[2024-06-02 23:17:56] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:17:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 3 ms.
[2024-06-02 23:17:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality1187267305314102977.gal : 3 ms
[2024-06-02 23:17:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality5672625107074130855.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/CTLCardinality1187267305314102977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5672625107074130855.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.24469e+11,13.7865,457964,2345,43,711380,1041,1014,2.44724e+06,67,3099,0


Converting to forward existential form...Done !
original formula: AX((EX(AF((i7.i1.u65.p242==1))) + AG(!(A(A((i6.i0.u57.p217==1) U (i12.i0.u111.p404==1)) U (i8.i1.u105.p372==1))))))
=> equivalent forward existential formula: [((FwdU((EY(Init) * !(EX(!(EG(!((i7.i1.u65.p242==1))))))),TRUE) * !(EG(!((i8.i1.u105.p372==1))))) * !(E(!((i8.i1...333
Reverse transition relation is NOT exact ! Due to transitions t23, t122, t225, t238, t240, t249, t274, t276, t277, t290, t339, t347, t356, t357, t365, t390...1286
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 41 place count 318 transition count 530
Iterating global reduction 1 with 37 rules applied. Total rules applied 78 place count 318 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 318 transition count 529
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 306 transition count 513
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 306 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 306 transition count 512
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 303 transition count 509
Iterating global reduction 3 with 3 rules applied. Total rules applied 110 place count 303 transition count 509
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 301 transition count 507
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 301 transition count 507
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 300 transition count 506
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 300 transition count 506
Applied a total of 116 rules in 21 ms. Remains 300 /359 variables (removed 59) and now considering 506/569 (removed 63) transitions.
// Phase 1: matrix 506 rows 300 cols
[2024-06-02 23:18:26] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:18:26] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 23:18:26] [INFO ] Invariant cache hit.
[2024-06-02 23:18:26] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 505 sub problems to find dead transitions.
[2024-06-02 23:18:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 23:18:31] [INFO ] Deduced a trap composed of 114 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:18:31] [INFO ] Deduced a trap composed of 146 places in 79 ms of which 2 ms to minimize.
[2024-06-02 23:18:31] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:18:31] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:18:32] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:18:32] [INFO ] Deduced a trap composed of 153 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:18:32] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:18:32] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:18:32] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:18:33] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-02 23:18:33] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:18:33] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:18:33] [INFO ] Deduced a trap composed of 86 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:18:34] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 23:18:36] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (OVERLAPS) 506/806 variables, 300/322 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 23:18:56] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 323 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 506/806 variables, 300/323 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 505/828 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 23:19:11] [INFO ] Deduced a trap composed of 151 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:19:13] [INFO ] Deduced a trap composed of 151 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 2/830 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 830 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 18/18 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LTL mode, iteration 1 : 300/359 places, 506/569 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60589 ms. Remains : 300/359 places, 506/569 transitions.
[2024-06-02 23:19:27] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:19:27] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:19:27] [INFO ] Input system was already deterministic with 506 transitions.
[2024-06-02 23:19:27] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:19:27] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:19:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality14623682563946426498.gal : 1 ms
[2024-06-02 23:19:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality4073848050786045289.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/CTLCardinality14623682563946426498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4073848050786045289.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-06-02 23:19:57] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:19:57] [INFO ] Applying decomposition
[2024-06-02 23:19:57] [INFO ] Flatten gal took : 10 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/graph8109486492787077462.txt' '-o' '/tmp/graph8109486492787077462.bin' '-w' '/tmp/graph8109486492787077462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8109486492787077462.bin' '-l' '-1' '-v' '-w' '/tmp/graph8109486492787077462.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:19:57] [INFO ] Decomposing Gal with order
[2024-06-02 23:19:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:19:57] [INFO ] Removed a total of 509 redundant transitions.
[2024-06-02 23:19:57] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:19:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 2 ms.
[2024-06-02 23:19:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality15488692105363208073.gal : 3 ms
[2024-06-02 23:19:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality10977930322492545660.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/CTLCardinality15488692105363208073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10977930322492545660.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.94279e+11,5.92816,189480,3594,56,346144,1836,951,783519,77,7621,0


Converting to forward existential form...Done !
original formula: (EX(!(E(((i6.u15.p53==0)||(i5.i0.i0.u54.p226==1)) U (i0.u67.p269==1)))) + AF(((i10.i0.i1.u108.p408==0)&&(i0.u23.p97==1))))
=> equivalent forward existential formula: [FwdG((Init * !(EX(!(E(((i6.u15.p53==0)||(i5.i0.i0.u54.p226==1)) U (i0.u67.p269==1)))))),!(((i10.i0.i1.u108.p408...188
Reverse transition relation is NOT exact ! Due to transitions t23, t119, t206, t217, t223, t236, t247, t272, t274, t275, t288, t337, t354, t355, t365, t390...1188
Detected timeout of ITS tools.
[2024-06-02 23:20:27] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:20:27] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:20:27] [INFO ] Applying decomposition
[2024-06-02 23:20:27] [INFO ] Flatten gal took : 11 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/graph14167946054885936857.txt' '-o' '/tmp/graph14167946054885936857.bin' '-w' '/tmp/graph14167946054885936857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14167946054885936857.bin' '-l' '-1' '-v' '-w' '/tmp/graph14167946054885936857.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:20:27] [INFO ] Decomposing Gal with order
[2024-06-02 23:20:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:20:27] [INFO ] Removed a total of 494 redundant transitions.
[2024-06-02 23:20:27] [INFO ] Flatten gal took : 26 ms
[2024-06-02 23:20:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 4 ms.
[2024-06-02 23:20:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3303133066364877584.gal : 7 ms
[2024-06-02 23:20:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality5042667305961640794.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/CTLCardinality3303133066364877584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5042667305961640794.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.26712e+11,13.1468,367356,5271,160,523201,5900,1184,1.63688e+06,117,13589,0


Converting to forward existential form...Done !
original formula: EF((AX((((i2.i1.u15.p42==0)&&(i4.i1.u43.p147==1))||((i1.u49.p181==0)&&(i3.i0.u18.p53==1)))) + (AF((i3.i2.u98.p341==1)) * ((((i4.i1.u52.p1...249
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!((((i2.i1.u15.p42==0)&&(i4.i1.u43.p147==1))||((i1.u49.p181==0)&&(i3.i0.u18.p53==1))))...344
Reverse transition relation is NOT exact ! Due to transitions t56, t287, t299, t340, t342, t345, t392, t419, t420, t445, t448, t449, t461, t463, t466, t513...1601
(forward)formula 0,1,21.3805,365280,1,0,523201,5900,5887,1.63688e+06,488,13589,2204264
FORMULA FireWire-PT-17-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(E((((i0.i1.u11.p29==0) + AF((i7.i0.u62.p218==1))) + AX(AX((i8.i0.u68.p235==1)))) U (i1.u50.p183==1))) * AF(((i3.i0.u20.p60==0) + EF((i...178
=> equivalent forward existential formula: ([(FwdU(Init,(((i0.i1.u11.p29==0) + !(EG(!((i7.i0.u62.p218==1))))) + !(EX(!(!(EX(!((i8.i0.u68.p235==1))))))))) *...264
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
[2024-06-02 23:50:08] [INFO ] Applying decomposition
[2024-06-02 23:50:08] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:50:08] [INFO ] Decomposing Gal with order
[2024-06-02 23:50:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:50:08] [INFO ] Removed a total of 395 redundant transitions.
[2024-06-02 23:50:08] [INFO ] Flatten gal took : 30 ms
[2024-06-02 23:50:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 349 labels/synchronizations in 2 ms.
[2024-06-02 23:50:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality12090140868255767969.gal : 18 ms
[2024-06-02 23:50:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality7665412977551667866.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/CTLCardinality12090140868255767969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7665412977551667866.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 12 CTL formulae.

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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../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="FireWire-PT-17"
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 FireWire-PT-17, 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 r550-tall-171734899000297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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