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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 8.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 97K 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-07-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717360551007

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 20:35:52] [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 20:35:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:35:52] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-02 20:35:52] [INFO ] Transformed 126 places.
[2024-06-02 20:35:52] [INFO ] Transformed 396 transitions.
[2024-06-02 20:35:52] [INFO ] Found NUPN structural information;
[2024-06-02 20:35:52] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-07-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 343/343 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 126 transition count 337
Applied a total of 6 rules in 22 ms. Remains 126 /126 variables (removed 0) and now considering 337/343 (removed 6) transitions.
[2024-06-02 20:35:52] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
// Phase 1: matrix 311 rows 126 cols
[2024-06-02 20:35:52] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 20:35:52] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-02 20:35:52] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2024-06-02 20:35:52] [INFO ] Invariant cache hit.
[2024-06-02 20:35:52] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:35:52] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-06-02 20:35:52] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2024-06-02 20:35:52] [INFO ] Invariant cache hit.
[2024-06-02 20:35:52] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 20:35:55] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 7 ms to minimize.
[2024-06-02 20:35:56] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 2 ms to minimize.
[2024-06-02 20:35:56] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-06-02 20:35:56] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:35:56] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:35:57] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:35:57] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:35:57] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:35:57] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (OVERLAPS) 310/436 variables, 126/269 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 44/313 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (OVERLAPS) 1/437 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 11 (OVERLAPS) 0/437 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 314 constraints, problems are : Problem set: 0 solved, 336 unsolved in 13392 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (OVERLAPS) 310/436 variables, 126/269 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 44/313 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 336/649 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (OVERLAPS) 1/437 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 650 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30019 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 9/9 constraints]
After SMT, in 43765ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 43781ms
Starting structural reductions in LTL mode, iteration 1 : 126/126 places, 337/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44259 ms. Remains : 126/126 places, 337/343 transitions.
Support contains 100 out of 126 places after structural reductions.
[2024-06-02 20:36:36] [INFO ] Flatten gal took : 48 ms
[2024-06-02 20:36:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA FireWire-PT-07-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:36:36] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:36:37] [INFO ] Input system was already deterministic with 337 transitions.
Support contains 94 out of 126 places (down from 100) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 81 to 78
RANDOM walk for 40000 steps (2156 resets) in 2051 ms. (19 steps per ms) remains 36/78 properties
BEST_FIRST walk for 4003 steps (74 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (51 resets) in 78 ms. (50 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (65 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (66 resets) in 47 ms. (83 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (55 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (57 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (55 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (58 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (49 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (40 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (58 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (51 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (51 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (64 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (57 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (61 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (50 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (40 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (46 resets) in 24 ms. (160 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4002 steps (55 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (65 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (53 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (56 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (49 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (117 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (61 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (59 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (59 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (52 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (57 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (40 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (66 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (62 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (44 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (60 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
[2024-06-02 20:36:38] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2024-06-02 20:36:38] [INFO ] Invariant cache hit.
[2024-06-02 20:36:38] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 2 (OVERLAPS) 66/121 variables, 6/61 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 66/127 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:36:38] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 3/130 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 4/125 variables, 2/132 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 4/136 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 310/435 variables, 125/261 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 44/305 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 1/436 variables, 1/306 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 1/307 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 15 (OVERLAPS) 1/437 variables, 1/308 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 20:36:39] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 9 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/437 variables, 1/309 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 0/309 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 20:36:40] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/437 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/437 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 20 (OVERLAPS) 0/437 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 310 constraints, problems are : Problem set: 1 solved, 34 unsolved in 3093 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 67/121 variables, 6/60 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 67/127 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 5/132 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 4/125 variables, 2/134 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 4/138 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 20:36:41] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:36:41] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 2/140 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 310/435 variables, 125/265 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 44/309 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 31/340 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 20:36:42] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 1/341 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 15 (OVERLAPS) 1/436 variables, 1/342 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/436 variables, 1/343 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/436 variables, 3/346 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 20:36:43] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/436 variables, 1/347 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/436 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 20 (OVERLAPS) 1/437 variables, 1/348 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/437 variables, 0/348 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 22 (OVERLAPS) 0/437 variables, 0/348 constraints. Problems are: Problem set: 1 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 348 constraints, problems are : Problem set: 1 solved, 34 unsolved in 5012 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 34/35 constraints, Known Traps: 9/9 constraints]
After SMT, in 8122ms problems are : Problem set: 1 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 337/337 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 126 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 125 transition count 332
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 124 transition count 334
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 124 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 124 transition count 331
Applied a total of 10 rules in 38 ms. Remains 124 /126 variables (removed 2) and now considering 331/337 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 124/126 places, 331/337 transitions.
RANDOM walk for 40000 steps (2202 resets) in 444 ms. (89 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (53 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (70 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (45 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (58 resets) in 21 ms. (182 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (54 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (65 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (54 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (61 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (62 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (46 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (80 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (55 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (39 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (60 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (52 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (50 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (50 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (57 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (59 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (39 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (42 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (61 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (57 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (115 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (46 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (43 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (49 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (42 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (50 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (61 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (66 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (63 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (62 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (55 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 693014 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :31 out of 34
Probabilistic random walk after 693014 steps, saw 151033 distinct states, run finished after 3009 ms. (steps per millisecond=230 ) properties seen :31
[2024-06-02 20:36:49] [INFO ] Flow matrix only has 307 transitions (discarded 24 similar events)
// Phase 1: matrix 307 rows 124 cols
[2024-06-02 20:36:49] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:36:49] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 107/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/123 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 307/430 variables, 123/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/431 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/431 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 178 constraints, problems are : Problem set: 0 solved, 3 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 107/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:36:49] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/123 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 307/430 variables, 123/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/431 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/431 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 182 constraints, problems are : Problem set: 0 solved, 3 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 621ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 413 ms.
Support contains 9 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 331/331 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 321
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 120 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 118 transition count 315
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 118 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 117 transition count 317
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 117 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 117 transition count 314
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 117 transition count 340
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 27 place count 115 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 43 place count 115 transition count 320
Applied a total of 43 rules in 64 ms. Remains 115 /124 variables (removed 9) and now considering 320/331 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 115/124 places, 320/331 transitions.
RANDOM walk for 40000 steps (2226 resets) in 543 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (544 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1132 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (519 resets) in 29 ms. (1333 steps per ms) remains 2/3 properties
[2024-06-02 20:36:50] [INFO ] Flow matrix only has 292 transitions (discarded 28 similar events)
// Phase 1: matrix 292 rows 115 cols
[2024-06-02 20:36:50] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:36:50] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 58/113 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 292/405 variables, 113/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 45/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/407 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/407 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 168 constraints, problems are : Problem set: 0 solved, 2 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 58/113 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 292/405 variables, 113/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 45/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/407 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:36:51] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/407 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 520ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 299 ms.
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 320/320 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 112 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 112 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 111 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 111 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 110 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 110 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 109 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 109 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 108 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 108 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 107 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 107 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 106 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 106 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 105 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 105 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 104 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 104 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 103 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 103 transition count 291
Applied a total of 24 rules in 45 ms. Remains 103 /115 variables (removed 12) and now considering 291/320 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 103/115 places, 291/320 transitions.
RANDOM walk for 40000 steps (2251 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (583 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1136 resets) in 221 ms. (180 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 865524 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :0 out of 2
Probabilistic random walk after 865524 steps, saw 195265 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :0
[2024-06-02 20:36:54] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
// Phase 1: matrix 263 rows 103 cols
[2024-06-02 20:36:54] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 20:36:54] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/101 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 263/364 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/366 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/101 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 263/364 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/366 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 291/291 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 103/103 places, 291/291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 291/291 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-06-02 20:36:55] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
[2024-06-02 20:36:55] [INFO ] Invariant cache hit.
[2024-06-02 20:36:55] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:36:55] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
[2024-06-02 20:36:55] [INFO ] Invariant cache hit.
[2024-06-02 20:36:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:36:55] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-06-02 20:36:55] [INFO ] Redundant transitions in 14 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-02 20:36:55] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
[2024-06-02 20:36:55] [INFO ] Invariant cache hit.
[2024-06-02 20:36:55] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 20:36:56] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:36:57] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:36:57] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-06-02 20:36:57] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:36:57] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:36:57] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:36:57] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 263/366 variables, 103/118 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 20:37:02] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/366 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 159 constraints, problems are : Problem set: 0 solved, 290 unsolved in 12405 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 20:37:08] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 263/366 variables, 103/120 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 40/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 290/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 290 unsolved in 14569 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 9/9 constraints]
After SMT, in 27145ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 27148ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27386 ms. Remains : 103/103 places, 291/291 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 94 edges and 103 vertex of which 20 / 103 are part of one of the 3 SCC in 4 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 103 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 85 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 18 place count 85 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 85 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 84 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 84 transition count 170
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 22 place count 83 transition count 170
Free-agglomeration rule applied 7 times with reduction of 4 identical transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 29 place count 83 transition count 159
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 41 place count 76 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 76 transition count 153
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 76 transition count 152
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 46 place count 75 transition count 150
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 49 place count 75 transition count 150
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 50 place count 75 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 74 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 74 transition count 148
Applied a total of 52 rules in 68 ms. Remains 74 /103 variables (removed 29) and now considering 148/291 (removed 143) transitions.
Running SMT prover for 2 properties.
[2024-06-02 20:37:22] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 74 cols
[2024-06-02 20:37:22] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:37:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:37:22] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 20:37:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:37:23] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 20:37:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 20:37:23] [INFO ] After 22ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 20:37:23] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 20:37:23] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 435 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2024-06-02 20:37:23] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:37:23] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:37:23] [INFO ] Input system was already deterministic with 337 transitions.
Computed a total of 22 stabilizing places and 47 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 118 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 118 transition count 316
Applied a total of 19 rules in 3 ms. Remains 118 /126 variables (removed 8) and now considering 316/337 (removed 21) transitions.
[2024-06-02 20:37:23] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
// Phase 1: matrix 290 rows 118 cols
[2024-06-02 20:37:23] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:37:23] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 20:37:23] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2024-06-02 20:37:23] [INFO ] Invariant cache hit.
[2024-06-02 20:37:23] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:37:23] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2024-06-02 20:37:23] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2024-06-02 20:37:23] [INFO ] Invariant cache hit.
[2024-06-02 20:37:23] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-02 20:37:25] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:37:25] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-06-02 20:37:25] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:37:25] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:37:25] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:37:26] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 4 ms to minimize.
[2024-06-02 20:37:26] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:37:26] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/407 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 1/408 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 177 constraints, problems are : Problem set: 0 solved, 315 unsolved in 12203 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/407 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 315/491 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (OVERLAPS) 1/408 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 10 (OVERLAPS) 0/408 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 492 constraints, problems are : Problem set: 0 solved, 315 unsolved in 24651 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 8/8 constraints]
After SMT, in 37050ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 37054ms
Starting structural reductions in LTL mode, iteration 1 : 118/126 places, 316/337 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37305 ms. Remains : 118/126 places, 316/337 transitions.
[2024-06-02 20:38:00] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:38:00] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:38:00] [INFO ] Input system was already deterministic with 316 transitions.
[2024-06-02 20:38:00] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:38:00] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:38:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality6635479616003141006.gal : 9 ms
[2024-06-02 20:38:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality17527395507355615340.ctl : 6 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/CTLCardinality6635479616003141006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17527395507355615340.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,6.3511e+06,0.484462,20964,2,2375,5,63574,6,0,787,54241,0


Converting to forward existential form...Done !
original formula: EF(EG(AX((((p86==0)&&(p91==1))||((p83==0)&&(p74==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!((((p86==0)&&(p91==1))||((p83==0)&&(p74==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...684
(forward)formula 0,1,1.7101,56984,1,0,585,248550,652,297,6556,253463,643
FORMULA FireWire-PT-07-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 329
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 329
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 120 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 119 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 118 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 117 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 117 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 116 transition count 314
Applied a total of 20 rules in 23 ms. Remains 116 /126 variables (removed 10) and now considering 314/337 (removed 23) transitions.
[2024-06-02 20:38:02] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
// Phase 1: matrix 288 rows 116 cols
[2024-06-02 20:38:02] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:38:02] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-02 20:38:02] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
[2024-06-02 20:38:02] [INFO ] Invariant cache hit.
[2024-06-02 20:38:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:38:02] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-06-02 20:38:02] [INFO ] Redundant transitions in 7 ms returned []
Running 313 sub problems to find dead transitions.
[2024-06-02 20:38:02] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
[2024-06-02 20:38:02] [INFO ] Invariant cache hit.
[2024-06-02 20:38:02] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:38:04] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2024-06-02 20:38:04] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:38:04] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:38:04] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:38:04] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-06-02 20:38:04] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:38:05] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:38:05] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:38:05] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 287/403 variables, 116/133 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 174 constraints, problems are : Problem set: 0 solved, 313 unsolved in 12281 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 287/403 variables, 116/133 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 313/486 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 1/404 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:38:27] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 11 (OVERLAPS) 0/404 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 488 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 10/10 constraints]
After SMT, in 42465ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 42469ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/126 places, 314/337 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43040 ms. Remains : 116/126 places, 314/337 transitions.
[2024-06-02 20:38:45] [INFO ] Flatten gal took : 23 ms
[2024-06-02 20:38:45] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:38:45] [INFO ] Input system was already deterministic with 314 transitions.
[2024-06-02 20:38:45] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:38:45] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:38:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17071147221829107455.gal : 3 ms
[2024-06-02 20:38:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality8535330062470175030.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/CTLCardinality17071147221829107455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8535330062470175030.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,5.99784e+06,1.37353,50588,2,2605,5,180695,6,0,777,154095,0


Converting to forward existential form...Done !
original formula: E((!(AF(((((p39==0)||(p71==0))||(((p89==0)||(p53==1))&&(p93==1))) * EF(((p52==0)||(p51==1)))))) + ((!(EG(((p1==0)||(p84==1)))) + !(((((A(...414
=> equivalent forward existential formula: ([((FwdU(Init,(!(!(EG(!(((((p39==0)||(p71==0))||(((p89==0)||(p53==1))&&(p93==1))) * E(TRUE U ((p52==0)||(p51==1)...1109
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...672
(forward)formula 0,0,29.5338,814452,1,0,861,4.53826e+06,655,433,6639,4.00123e+06,979
FORMULA FireWire-PT-07-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 119 transition count 318
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 292
Applied a total of 39 rules in 15 ms. Remains 108 /126 variables (removed 18) and now considering 292/337 (removed 45) transitions.
[2024-06-02 20:39:15] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
// Phase 1: matrix 266 rows 108 cols
[2024-06-02 20:39:15] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:39:15] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 20:39:15] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2024-06-02 20:39:15] [INFO ] Invariant cache hit.
[2024-06-02 20:39:15] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:39:15] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-06-02 20:39:15] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2024-06-02 20:39:15] [INFO ] Invariant cache hit.
[2024-06-02 20:39:15] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 20:39:16] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 265/373 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/374 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 165 constraints, problems are : Problem set: 0 solved, 291 unsolved in 10791 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 265/373 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 291/455 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 1/374 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 20:39:40] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/374 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 12 (OVERLAPS) 0/374 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 457 constraints, problems are : Problem set: 0 solved, 291 unsolved in 27841 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 11/11 constraints]
After SMT, in 38783ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 38786ms
Starting structural reductions in LTL mode, iteration 1 : 108/126 places, 292/337 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39030 ms. Remains : 108/126 places, 292/337 transitions.
[2024-06-02 20:39:54] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:39:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:39:54] [INFO ] Input system was already deterministic with 292 transitions.
[2024-06-02 20:39:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:39:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:39:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13719131453774427659.gal : 4 ms
[2024-06-02 20:39:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality1612639002890186423.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/CTLCardinality13719131453774427659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1612639002890186423.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,6.58067e+06,5.52633,172032,2,6344,5,446067,6,0,723,592722,0


Converting to forward existential form...Done !
original formula: E(!(AX(EG((p32==1)))) U EX((p72!=0)))
=> equivalent forward existential formula: [(EY(FwdU(Init,!(!(EX(!(EG((p32==1)))))))) * (p72!=0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...624
Detected timeout of ITS tools.
[2024-06-02 20:40:24] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:40:24] [INFO ] Applying decomposition
[2024-06-02 20:40:24] [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/graph16683952553765994164.txt' '-o' '/tmp/graph16683952553765994164.bin' '-w' '/tmp/graph16683952553765994164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16683952553765994164.bin' '-l' '-1' '-v' '-w' '/tmp/graph16683952553765994164.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:40:24] [INFO ] Decomposing Gal with order
[2024-06-02 20:40:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:40:24] [INFO ] Removed a total of 445 redundant transitions.
[2024-06-02 20:40:24] [INFO ] Flatten gal took : 49 ms
[2024-06-02 20:40:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 20 ms.
[2024-06-02 20:40:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality10356937218103447113.gal : 4 ms
[2024-06-02 20:40:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality4583023431021730750.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/CTLCardinality10356937218103447113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4583023431021730750.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,6.58067e+06,3.05159,97892,1510,205,168280,1605,594,394624,91,13618,0


Converting to forward existential form...Done !
original formula: E(!(AX(EG((i2.u11.p32==1)))) U EX((i6.u23.p72!=0)))
=> equivalent forward existential formula: [(EY(FwdU(Init,!(!(EX(!(EG((i2.u11.p32==1)))))))) * (i6.u23.p72!=0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t42, t44, t45, t48, t49, t51, t57, t59, t79, t82, t83, t91, t92, t93, t94, t99, t140, t142, t...801
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 325
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 121 transition count 322
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 119 transition count 318
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 119 transition count 318
Applied a total of 17 rules in 6 ms. Remains 119 /126 variables (removed 7) and now considering 318/337 (removed 19) transitions.
[2024-06-02 20:40:54] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
// Phase 1: matrix 292 rows 119 cols
[2024-06-02 20:40:54] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:40:54] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 20:40:54] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
[2024-06-02 20:40:54] [INFO ] Invariant cache hit.
[2024-06-02 20:40:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:40:54] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 317 sub problems to find dead transitions.
[2024-06-02 20:40:55] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
[2024-06-02 20:40:55] [INFO ] Invariant cache hit.
[2024-06-02 20:40:55] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-06-02 20:40:56] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:40:56] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:40:56] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:40:56] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 4 ms to minimize.
[2024-06-02 20:40:56] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-06-02 20:40:56] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:40:57] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:40:57] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:40:57] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 291/410 variables, 119/136 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 42/178 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 1/411 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (OVERLAPS) 0/411 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 179 constraints, problems are : Problem set: 0 solved, 317 unsolved in 12720 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 291/410 variables, 119/136 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 42/178 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 317/495 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (OVERLAPS) 1/411 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 10 (OVERLAPS) 0/411 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 496 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 9/9 constraints]
After SMT, in 42911ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 42915ms
Starting structural reductions in LTL mode, iteration 1 : 119/126 places, 318/337 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43174 ms. Remains : 119/126 places, 318/337 transitions.
[2024-06-02 20:41:37] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:41:37] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:41:37] [INFO ] Input system was already deterministic with 318 transitions.
[2024-06-02 20:41:37] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:41:37] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:41:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality3399668726438591187.gal : 3 ms
[2024-06-02 20:41:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality7545491087884047590.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/CTLCardinality3399668726438591187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7545491087884047590.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,6.36102e+06,0.635769,21860,2,2377,5,65061,6,0,793,56868,0


Converting to forward existential form...Done !
original formula: A(A((p112==1) U EF(((p14==1) + A(((p118==0)||(p19==1)) U (p47==0))))) U A((p11!=0) U (EX(E((p29==0) U (p113==1))) * ((p40==0)||(p73==1)))...157
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((EX(E((p29==0) U (p113==1))) * ((p40==0)||(p73==1)))) U (!((p11!=0)) * !((EX(E((p29==0) ...1051
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t12, t13, t15, t16, t17, t19, t21, t25, t26, t28, t29, t30, t32, t34,...685
Detected timeout of ITS tools.
[2024-06-02 20:42:08] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:42:08] [INFO ] Applying decomposition
[2024-06-02 20:42:08] [INFO ] Flatten gal took : 13 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/graph10220918709392022898.txt' '-o' '/tmp/graph10220918709392022898.bin' '-w' '/tmp/graph10220918709392022898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10220918709392022898.bin' '-l' '-1' '-v' '-w' '/tmp/graph10220918709392022898.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:42:08] [INFO ] Decomposing Gal with order
[2024-06-02 20:42:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:42:08] [INFO ] Removed a total of 500 redundant transitions.
[2024-06-02 20:42:08] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:42:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 9 ms.
[2024-06-02 20:42:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality14713564657157390584.gal : 3 ms
[2024-06-02 20:42:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality921838454067555207.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/CTLCardinality14713564657157390584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality921838454067555207.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,6.36102e+06,3.43109,88896,1170,130,122911,1180,662,333787,81,7751,0


Converting to forward existential form...Done !
original formula: A(A((i0.u39.p112==1) U EF(((i1.i0.u4.p14==1) + A(((i0.u42.p118==0)||(i1.i0.u5.p19==1)) U (i3.u13.p47==0))))) U A((i1.i1.u3.p11!=0) U (EX(...233
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((EX(E((i2.u10.p29==0) U (i0.u40.p113==1))) * ((i3.u13.p40==0)||(i0.u24.p73==1)))) U (!((...1475
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t43, t45, t46, t49, t50, t52, t60, t65, t70, t75, t80, t84, t92, t93, t94, t95, t98, ...892
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 1
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
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
(forward)formula 0,1,21.9907,511784,1,0,652845,3243,3506,2.51379e+06,362,20538,1091384
FORMULA FireWire-PT-07-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 117 transition count 313
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 106 transition count 287
Applied a total of 43 rules in 16 ms. Remains 106 /126 variables (removed 20) and now considering 287/337 (removed 50) transitions.
[2024-06-02 20:42:30] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 20:42:30] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 20:42:30] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 20:42:30] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:42:30] [INFO ] Invariant cache hit.
[2024-06-02 20:42:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:42:30] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 20:42:30] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:42:30] [INFO ] Invariant cache hit.
[2024-06-02 20:42:30] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 20:42:31] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:42:31] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:42:32] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:42:32] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:42:32] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:42:32] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:42:32] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:42:32] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:42:32] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:42:32] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 162 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10432 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 448 constraints, problems are : Problem set: 0 solved, 286 unsolved in 22070 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 32658ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 32664ms
Starting structural reductions in LTL mode, iteration 1 : 106/126 places, 287/337 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32889 ms. Remains : 106/126 places, 287/337 transitions.
[2024-06-02 20:43:03] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:43:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:43:03] [INFO ] Input system was already deterministic with 287 transitions.
[2024-06-02 20:43:03] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:43:03] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:43:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15955899526829128341.gal : 3 ms
[2024-06-02 20:43:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality1760619291647292146.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/CTLCardinality15955899526829128341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1760619291647292146.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,6.23367e+06,6.45258,169880,2,6179,5,456345,6,0,710,596611,0


Converting to forward existential form...Done !
original formula: EF(!(E((A((p69==1) U (p35==0)) * AG(((p46==0)||(p63==1)))) U AX((p86==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((!((E(!((p35==0)) U (!((p69==1)) * !((p35==0)))) + EG(!((p35==0))))) * !(E(TRUE U !(((p4...209
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...612
Detected timeout of ITS tools.
[2024-06-02 20:43:33] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:43:33] [INFO ] Applying decomposition
[2024-06-02 20:43:33] [INFO ] Flatten gal took : 6 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/graph18377062126162900274.txt' '-o' '/tmp/graph18377062126162900274.bin' '-w' '/tmp/graph18377062126162900274.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18377062126162900274.bin' '-l' '-1' '-v' '-w' '/tmp/graph18377062126162900274.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:43:33] [INFO ] Decomposing Gal with order
[2024-06-02 20:43:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:43:33] [INFO ] Removed a total of 436 redundant transitions.
[2024-06-02 20:43:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:43:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 7 ms.
[2024-06-02 20:43:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality13510211373509884688.gal : 2 ms
[2024-06-02 20:43:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality16500835088820065299.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/CTLCardinality13510211373509884688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16500835088820065299.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,6.23367e+06,8.25957,238736,2684,164,320587,1274,555,1.64023e+06,86,10942,0


Converting to forward existential form...Done !
original formula: EF(!(E((A((i5.i0.u21.p69==1) U (i2.u10.p35==0)) * AG(((i1.u14.p46==0)||(i4.u20.p63==1)))) U AX((i1.u28.p86==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((!((E(!((i2.u10.p35==0)) U (!((i5.i0.u21.p69==1)) * !((i2.u10.p35==0)))) + EG(!((i2.u10....261
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t94, t99, t136, t137, t138, t140, ...779
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 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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 330
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 321
Applied a total of 13 rules in 4 ms. Remains 120 /126 variables (removed 6) and now considering 321/337 (removed 16) transitions.
[2024-06-02 20:44:03] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 120 cols
[2024-06-02 20:44:03] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 20:44:03] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 20:44:03] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 20:44:03] [INFO ] Invariant cache hit.
[2024-06-02 20:44:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:44:03] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2024-06-02 20:44:03] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 20:44:03] [INFO ] Invariant cache hit.
[2024-06-02 20:44:03] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 20:44:05] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:44:05] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:44:05] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:44:05] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:44:05] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:44:05] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:44:05] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:44:06] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:44:06] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:44:06] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2024-06-02 20:44:06] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 294/414 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 41/180 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 1/415 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (OVERLAPS) 0/415 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 181 constraints, problems are : Problem set: 0 solved, 320 unsolved in 12987 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 20:44:17] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 294/414 variables, 120/140 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 41/181 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 320/501 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 20:44:21] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (OVERLAPS) 1/415 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 12 (OVERLAPS) 0/415 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 503 constraints, problems are : Problem set: 0 solved, 320 unsolved in 27155 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 13/13 constraints]
After SMT, in 40325ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 40331ms
Starting structural reductions in LTL mode, iteration 1 : 120/126 places, 321/337 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40550 ms. Remains : 120/126 places, 321/337 transitions.
[2024-06-02 20:44:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:44:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:44:43] [INFO ] Input system was already deterministic with 321 transitions.
[2024-06-02 20:44:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:44:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:44:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality1747206417980491039.gal : 2 ms
[2024-06-02 20:44:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality18281617155834747625.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/CTLCardinality1747206417980491039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18281617155834747625.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.38259e+06,1.69397,57676,2,2906,5,194927,6,0,800,182382,0


Converting to forward existential form...Done !
original formula: AX((EX(((EX((p20==1)) + EF(((p23==1)||(p44==1)))) + ((((p95==0)&&(p42==1))&&((p25==0)&&(p79==1)))||((p106==0)&&(p21==1))))) + (EX(A((p17=...345
=> equivalent forward existential formula: ([((EY(Init) * !(EX(((EX((p20==1)) + E(TRUE U ((p23==1)||(p44==1)))) + ((((p95==0)&&(p42==1))&&((p25==0)&&(p79==...635
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...685
Detected timeout of ITS tools.
[2024-06-02 20:45:14] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:45:14] [INFO ] Applying decomposition
[2024-06-02 20:45:14] [INFO ] Flatten gal took : 8 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/graph14972529462714802500.txt' '-o' '/tmp/graph14972529462714802500.bin' '-w' '/tmp/graph14972529462714802500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14972529462714802500.bin' '-l' '-1' '-v' '-w' '/tmp/graph14972529462714802500.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:45:14] [INFO ] Decomposing Gal with order
[2024-06-02 20:45:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:45:14] [INFO ] Removed a total of 504 redundant transitions.
[2024-06-02 20:45:14] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:45:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 6 ms.
[2024-06-02 20:45:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality10858835969453302829.gal : 1 ms
[2024-06-02 20:45:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality6228745351139027125.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/CTLCardinality10858835969453302829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6228745351139027125.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.38259e+06,4.52849,138712,2187,133,189493,1654,606,704082,89,11063,0


Converting to forward existential form...Done !
original formula: AX((EX(((EX((i2.u6.p20==1)) + EF(((i2.u7.p23==1)||(i1.u15.p44==1)))) + ((((i5.u32.p95==0)&&(i1.u14.p42==1))&&((i3.u8.p25==0)&&(i0.u26.p79...525
=> equivalent forward existential formula: ([((EY(Init) * !(EX(((EX((i2.u6.p20==1)) + E(TRUE U ((i2.u7.p23==1)||(i1.u15.p44==1)))) + ((((i5.u32.p95==0)&&(i...911
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t51, t59, t64, t65, t69, t74, t79, t91, t92, t93, t94, t97, t99,...857
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 4
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
(forward)formula 0,1,29.5372,761736,1,0,929147,4376,3308,4.47456e+06,372,26528,1761640
FORMULA FireWire-PT-07-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 122 transition count 328
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 122 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 122 transition count 326
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 120 transition count 321
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 109 transition count 295
Applied a total of 36 rules in 13 ms. Remains 109 /126 variables (removed 17) and now considering 295/337 (removed 42) transitions.
[2024-06-02 20:45:43] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
// Phase 1: matrix 269 rows 109 cols
[2024-06-02 20:45:43] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:45:43] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 20:45:43] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2024-06-02 20:45:43] [INFO ] Invariant cache hit.
[2024-06-02 20:45:43] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:45:43] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-06-02 20:45:43] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2024-06-02 20:45:43] [INFO ] Invariant cache hit.
[2024-06-02 20:45:43] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:45:45] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:45:45] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:45:45] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:45:45] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:45:46] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:45:46] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-02 20:45:46] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:45:46] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:45:46] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:45:46] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 268/377 variables, 109/127 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 1/378 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 166 constraints, problems are : Problem set: 0 solved, 294 unsolved in 10909 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 268/377 variables, 109/127 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 294/459 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 1/378 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 460 constraints, problems are : Problem set: 0 solved, 294 unsolved in 19694 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 10/10 constraints]
After SMT, in 30774ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 30778ms
Starting structural reductions in LTL mode, iteration 1 : 109/126 places, 295/337 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30992 ms. Remains : 109/126 places, 295/337 transitions.
[2024-06-02 20:46:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:14] [INFO ] Input system was already deterministic with 295 transitions.
[2024-06-02 20:46:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:46:14] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:46:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality1154940364222658979.gal : 1 ms
[2024-06-02 20:46:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality7321357379671134167.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/CTLCardinality1154940364222658979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7321357379671134167.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,6.95698e+06,6.33127,174396,2,6411,5,474286,6,0,730,600873,0


Converting to forward existential form...Done !
original formula: A((((p16==0)||(p68==1)) * ((AG(!(AX((p16==1)))) + A(AX((p68==1)) U EX((p96==1)))) + !(A((p45!=0) U (p41!=1))))) U AG(AX((A(((p35==0)||(p2...251
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(EX(!((!((E(!((p20==0)) U (!(((p35==0)||(p27==1))) * !((p20==0)))) + EG(!((p20==0...875
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...630
Detected timeout of ITS tools.
[2024-06-02 20:46:44] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:46:44] [INFO ] Applying decomposition
[2024-06-02 20:46:44] [INFO ] Flatten gal took : 8 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/graph6202166486905204452.txt' '-o' '/tmp/graph6202166486905204452.bin' '-w' '/tmp/graph6202166486905204452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6202166486905204452.bin' '-l' '-1' '-v' '-w' '/tmp/graph6202166486905204452.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:46:44] [INFO ] Decomposing Gal with order
[2024-06-02 20:46:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:46:44] [INFO ] Removed a total of 450 redundant transitions.
[2024-06-02 20:46:44] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:46:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 6 ms.
[2024-06-02 20:46:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality18245327476590231643.gal : 12 ms
[2024-06-02 20:46:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality12271948975154022255.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/CTLCardinality18245327476590231643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12271948975154022255.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,6.95698e+06,29.1364,654492,1864,180,588627,16451,619,5.65906e+06,93,101625,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 331
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 331
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 121 transition count 324
Applied a total of 12 rules in 7 ms. Remains 121 /126 variables (removed 5) and now considering 324/337 (removed 13) transitions.
[2024-06-02 20:47:15] [INFO ] Flow matrix only has 298 transitions (discarded 26 similar events)
// Phase 1: matrix 298 rows 121 cols
[2024-06-02 20:47:15] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:47:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 20:47:15] [INFO ] Flow matrix only has 298 transitions (discarded 26 similar events)
[2024-06-02 20:47:15] [INFO ] Invariant cache hit.
[2024-06-02 20:47:15] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 20:47:15] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-06-02 20:47:15] [INFO ] Flow matrix only has 298 transitions (discarded 26 similar events)
[2024-06-02 20:47:15] [INFO ] Invariant cache hit.
[2024-06-02 20:47:15] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 20:47:17] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:47:17] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:47:17] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:47:17] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:47:17] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:47:17] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:47:17] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:47:17] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:47:18] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-06-02 20:47:18] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 297/418 variables, 121/139 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 1/419 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 9 (OVERLAPS) 0/419 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 183 constraints, problems are : Problem set: 0 solved, 323 unsolved in 13230 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 297/418 variables, 121/139 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 323/505 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 8 (OVERLAPS) 1/419 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 10 (OVERLAPS) 0/419 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 506 constraints, problems are : Problem set: 0 solved, 323 unsolved in 22399 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 10/10 constraints]
After SMT, in 35819ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 35823ms
Starting structural reductions in LTL mode, iteration 1 : 121/126 places, 324/337 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36047 ms. Remains : 121/126 places, 324/337 transitions.
[2024-06-02 20:47:51] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:51] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:51] [INFO ] Input system was already deterministic with 324 transitions.
[2024-06-02 20:47:51] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:47:51] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:47:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality13947758141387998538.gal : 2 ms
[2024-06-02 20:47:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality4088980471752271303.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/CTLCardinality13947758141387998538.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4088980471752271303.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.19813e+06,1.35612,47904,2,2585,5,152658,6,0,807,153237,0


Converting to forward existential form...Done !
original formula: (AX(E(E(A(((p42==0)||(p32==1)) U (p44==1)) U ((p71==0)||(p104==1))) U (A((((p114==0)||(p120==1))&&((p50==0)||(p7==1))) U ((p58==1)&&(p61=...243
=> equivalent forward existential formula: ([(EY(Init) * !(E(E(!((E(!((p44==1)) U (!(((p42==0)||(p32==1))) * !((p44==1)))) + EG(!((p44==1))))) U ((p71==0)|...479
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...702
Detected timeout of ITS tools.
[2024-06-02 20:48:21] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:48:21] [INFO ] Applying decomposition
[2024-06-02 20:48:21] [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/graph15215914644805051982.txt' '-o' '/tmp/graph15215914644805051982.bin' '-w' '/tmp/graph15215914644805051982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15215914644805051982.bin' '-l' '-1' '-v' '-w' '/tmp/graph15215914644805051982.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:48:21] [INFO ] Decomposing Gal with order
[2024-06-02 20:48:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:48:21] [INFO ] Removed a total of 488 redundant transitions.
[2024-06-02 20:48:21] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:48:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 4 ms.
[2024-06-02 20:48:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality2470787818030190717.gal : 2 ms
[2024-06-02 20:48:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality4744240059258518084.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/CTLCardinality2470787818030190717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4744240059258518084.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,7.19813e+06,5.8276,168100,2180,214,193859,2435,621,1.11633e+06,106,18428,0


Converting to forward existential form...Done !
original formula: (AX(E(E(A(((i6.u14.p42==0)||(i1.u10.p32==1)) U (i6.u15.p44==1)) U ((i4.i1.u30.p71==0)||(i5.i1.u33.p104==1))) U (A((((i0.u0.p114==0)||(i0....371
=> equivalent forward existential formula: ([(EY(Init) * !(E(E(!((E(!((i6.u15.p44==1)) U (!(((i6.u14.p42==0)||(i1.u10.p32==1))) * !((i6.u15.p44==1)))) + EG...675
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t59, t68, t69, t74, t79, t87, t94, t97, t106, t138, t139, t140, ...902
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 332
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 332
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 329
Applied a total of 7 rules in 2 ms. Remains 123 /126 variables (removed 3) and now considering 329/337 (removed 8) transitions.
[2024-06-02 20:48:51] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
// Phase 1: matrix 303 rows 123 cols
[2024-06-02 20:48:51] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:48:51] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:48:51] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2024-06-02 20:48:51] [INFO ] Invariant cache hit.
[2024-06-02 20:48:51] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 20:48:51] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-02 20:48:51] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2024-06-02 20:48:51] [INFO ] Invariant cache hit.
[2024-06-02 20:48:51] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-02 20:48:53] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:48:53] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:48:53] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:48:53] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:48:53] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:48:53] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:48:54] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 3 ms to minimize.
[2024-06-02 20:48:54] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 302/425 variables, 123/139 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 1/426 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (OVERLAPS) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 183 constraints, problems are : Problem set: 0 solved, 328 unsolved in 13476 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 302/425 variables, 123/139 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 328/510 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 1/426 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 511 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 8/8 constraints]
After SMT, in 43665ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 43669ms
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 329/337 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43894 ms. Remains : 123/126 places, 329/337 transitions.
[2024-06-02 20:49:35] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:49:35] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:49:35] [INFO ] Input system was already deterministic with 329 transitions.
[2024-06-02 20:49:35] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:49:35] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:49:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality162599075701722360.gal : 1 ms
[2024-06-02 20:49:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality14587335318498207553.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/CTLCardinality162599075701722360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14587335318498207553.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.22347e+06,0.814285,33036,2,2488,5,102480,6,0,820,100926,0


Converting to forward existential form...Done !
original formula: (E((!((((EX(((p109==0)||(p18==1))) + A((p24==1) U (p16==0))) * (p30==1)) * (((p9==0)||(p52==1))||((p83==1)||(!((p53==0)||(p1==1))))))) * ...618
=> equivalent forward existential formula: ([FwdG((Init * !(E((!((((EX(((p109==0)||(p18==1))) + !((E(!((p16==0)) U (!((p24==1)) * !((p16==0)))) + EG(!((p16...3222
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t12, t13, t15, t16, t17, t19, t21, t25, t26, t28, t29, t30, t32, t34,...710
Detected timeout of ITS tools.
[2024-06-02 20:50:05] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:50:05] [INFO ] Applying decomposition
[2024-06-02 20:50:05] [INFO ] Flatten gal took : 8 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/graph11804100534370807076.txt' '-o' '/tmp/graph11804100534370807076.bin' '-w' '/tmp/graph11804100534370807076.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11804100534370807076.bin' '-l' '-1' '-v' '-w' '/tmp/graph11804100534370807076.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:50:05] [INFO ] Decomposing Gal with order
[2024-06-02 20:50:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:50:05] [INFO ] Removed a total of 514 redundant transitions.
[2024-06-02 20:50:05] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:50:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 3 ms.
[2024-06-02 20:50:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality12370942940596824139.gal : 2 ms
[2024-06-02 20:50:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality4745626706672240018.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/CTLCardinality12370942940596824139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4745626706672240018.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.22347e+06,3.58798,114212,2072,200,141870,1902,612,599235,93,17610,0


Converting to forward existential form...Done !
original formula: (E((!((((EX(((i6.i1.u37.p109==0)||(i1.u6.p18==1))) + A((i1.u5.p24==1) U (i1.u5.p16==0))) * (i3.u10.p30==1)) * (((i2.u3.p9==0)||(i4.u17.p5...916
=> equivalent forward existential formula: ([FwdG((Init * !(E((!((((EX(((i6.i1.u37.p109==0)||(i1.u6.p18==1))) + !((E(!((i1.u5.p16==0)) U (!((i1.u5.p24==1))...4610
Reverse transition relation is NOT exact ! Due to transitions t43, t45, t46, t49, t50, t52, t58, t60, t65, t70, t75, t80, t84, t92, t93, t94, t95, t98, t10...856
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 4
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 119 transition count 322
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 119 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 119 transition count 319
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 116 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 113 transition count 306
Applied a total of 27 rules in 15 ms. Remains 113 /126 variables (removed 13) and now considering 306/337 (removed 31) transitions.
[2024-06-02 20:50:35] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 113 cols
[2024-06-02 20:50:35] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:50:35] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:50:35] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 20:50:35] [INFO ] Invariant cache hit.
[2024-06-02 20:50:35] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:50:35] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-06-02 20:50:35] [INFO ] Redundant transitions in 4 ms returned []
Running 303 sub problems to find dead transitions.
[2024-06-02 20:50:35] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 20:50:35] [INFO ] Invariant cache hit.
[2024-06-02 20:50:35] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:50:36] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:50:36] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:50:36] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:50:36] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:50:36] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:50:37] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:50:37] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:50:37] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-02 20:50:37] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:50:37] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:50:37] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 279/391 variables, 112/131 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 39/170 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (OVERLAPS) 1/392 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 0/392 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/393 variables, and 171 constraints, problems are : Problem set: 0 solved, 303 unsolved in 10804 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 279/391 variables, 112/131 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 39/170 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 303/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:50:49] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 1/392 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 20:51:02] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/393 variables, and 476 constraints, problems are : Problem set: 0 solved, 303 unsolved in 26819 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 13/13 constraints]
After SMT, in 37791ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 37794ms
Starting structural reductions in SI_CTL mode, iteration 1 : 113/126 places, 306/337 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38037 ms. Remains : 113/126 places, 306/337 transitions.
[2024-06-02 20:51:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:51:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:51:13] [INFO ] Input system was already deterministic with 306 transitions.
[2024-06-02 20:51:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:51:13] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:51:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality4945789420997994323.gal : 1 ms
[2024-06-02 20:51:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality4902360763232564048.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/CTLCardinality4945789420997994323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4902360763232564048.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,5.27565e+06,0.715626,28628,2,2263,5,91295,6,0,757,91634,0


Converting to forward existential form...Done !
original formula: EF(AG(((p47==1)||(p115==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p47==1)||(p115==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...655
(forward)formula 0,1,5.07967,153516,1,0,639,781697,631,324,6283,570060,723
FORMULA FireWire-PT-07-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 119 transition count 322
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 119 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 119 transition count 319
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 116 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 105 transition count 286
Applied a total of 43 rules in 39 ms. Remains 105 /126 variables (removed 21) and now considering 286/337 (removed 51) transitions.
[2024-06-02 20:51:18] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
// Phase 1: matrix 260 rows 105 cols
[2024-06-02 20:51:18] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:51:18] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 20:51:18] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2024-06-02 20:51:18] [INFO ] Invariant cache hit.
[2024-06-02 20:51:18] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:51:18] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 20:51:18] [INFO ] Redundant transitions in 2 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 20:51:18] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2024-06-02 20:51:18] [INFO ] Invariant cache hit.
[2024-06-02 20:51:18] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:51:19] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:51:19] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:51:19] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:51:19] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:51:20] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:51:20] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-06-02 20:51:20] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:51:20] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:51:20] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:51:20] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-06-02 20:51:20] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 2 ms to minimize.
[2024-06-02 20:51:20] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:51:21] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 259/363 variables, 104/125 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 36/161 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/365 variables, and 162 constraints, problems are : Problem set: 0 solved, 283 unsolved in 11149 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/125 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/161 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 283/444 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:51:41] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (OVERLAPS) 0/364 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/365 variables, and 446 constraints, problems are : Problem set: 0 solved, 283 unsolved in 23714 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 14/14 constraints]
After SMT, in 35004ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 35009ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/126 places, 286/337 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35300 ms. Remains : 105/126 places, 286/337 transitions.
[2024-06-02 20:51:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:51:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:51:53] [INFO ] Input system was already deterministic with 286 transitions.
[2024-06-02 20:51:54] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:51:54] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:51:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality6746751549675651531.gal : 1 ms
[2024-06-02 20:51:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality17733913233300366765.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/CTLCardinality6746751549675651531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17733913233300366765.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,6.23367e+06,0.819179,31108,2,2128,5,92030,6,0,705,99426,0


Converting to forward existential form...Done !
original formula: (EG((!(E((p124!=0) U ((p103==1)&&((p6==0)||(p68==1))))) + AG((p97==0)))) * EG(AF((p87==0))))
=> equivalent forward existential formula: [FwdG((Init * EG((!(E((p124!=0) U ((p103==1)&&((p6==0)||(p68==1))))) + !(E(TRUE U !((p97==0))))))),!(EG(!((p87==...171
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...612
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 20:52:24] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:52:24] [INFO ] Applying decomposition
[2024-06-02 20:52:24] [INFO ] Flatten gal took : 6 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/graph13508348461359298834.txt' '-o' '/tmp/graph13508348461359298834.bin' '-w' '/tmp/graph13508348461359298834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13508348461359298834.bin' '-l' '-1' '-v' '-w' '/tmp/graph13508348461359298834.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:52:24] [INFO ] Decomposing Gal with order
[2024-06-02 20:52:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:52:24] [INFO ] Removed a total of 432 redundant transitions.
[2024-06-02 20:52:24] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:52:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 3 ms.
[2024-06-02 20:52:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality13815690172318556411.gal : 2 ms
[2024-06-02 20:52:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality10868893430354531762.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/CTLCardinality13815690172318556411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10868893430354531762.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,6.23367e+06,3.27917,111920,1600,193,146676,2388,598,661163,86,20300,0


Converting to forward existential form...Done !
original formula: (EG((!(E((i1.i1.u3.p124!=0) U ((i5.i1.u35.p103==1)&&((i5.i1.u35.p6==0)||(i5.i0.u21.p68==1))))) + AG((i6.u32.p97==0)))) * EG(AF((i1.i1.u28...166
=> equivalent forward existential formula: [FwdG((Init * EG((!(E((i1.i1.u3.p124!=0) U ((i5.i1.u35.p103==1)&&((i5.i1.u35.p6==0)||(i5.i0.u21.p68==1))))) + !(...227
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t47, t48, t50, t58, t63, t68, t73, t78, t81, t93, t98, t135, t136, t137, t139, ...813
Detected timeout of ITS tools.
[2024-06-02 20:52:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:52:54] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:52:54] [INFO ] Applying decomposition
[2024-06-02 20:52:54] [INFO ] Flatten gal took : 8 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/graph1115338247108876167.txt' '-o' '/tmp/graph1115338247108876167.bin' '-w' '/tmp/graph1115338247108876167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1115338247108876167.bin' '-l' '-1' '-v' '-w' '/tmp/graph1115338247108876167.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:52:54] [INFO ] Decomposing Gal with order
[2024-06-02 20:52:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:52:54] [INFO ] Removed a total of 530 redundant transitions.
[2024-06-02 20:52:54] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:52:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 4 ms.
[2024-06-02 20:52:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality8342791525479074239.gal : 3 ms
[2024-06-02 20:52:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality3173289618862187379.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/CTLCardinality8342791525479074239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3173289618862187379.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 6 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.03512e+06,3.29911,100200,1798,197,141429,1971,570,407394,88,17088,0


Converting to forward existential form...Done !
original formula: E(!(AX(EG((i3.u10.p32==1)))) U EX((i5.u23.p72!=0)))
=> equivalent forward existential formula: [(EY(FwdU(Init,!(!(EX(!(EG((i3.u10.p32==1)))))))) * (i5.u23.p72!=0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t45, t46, t49, t50, t52, t58, t60, t65, t70, t75, t80, t84, t92, t93, t94, t95, t98, t10...844
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 6
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
(forward)formula 0,1,48.328,1040652,1,0,1.50765e+06,7786,3005,3.98356e+06,364,88128,3446379
FORMULA FireWire-PT-07-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(!(E((A((i6.u22.p69==1) U (i3.u11.p35==0)) * AG(((i1.u15.p46==0)||(i5.u20.p63==1)))) U AX((i2.u30.p86==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((!((E(!((i3.u11.p35==0)) U (!((i6.u22.p69==1)) * !((i3.u11.p35==0)))) + EG(!((i3.u11.p35...258
(forward)formula 1,1,63.4177,1450380,1,0,2.05409e+06,9611,3113,5.81743e+06,370,105696,4452071
FORMULA FireWire-PT-07-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((((i1.u5.p16==0)||(i6.u22.p68==1)) * ((AG(!(AX((i1.u5.p16==1)))) + A(AX((i6.u22.p68==1)) U EX((i6.u33.p96==1)))) + !(A((i1.u15.p45!=0) ...357
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(EX(!((!((E(!((i1.u7.p20==0)) U (!(((i3.u11.p35==0)||(i3.u9.p27==1))) * !((i1.u7....1163
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 6
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 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
(forward)formula 2,0,132.821,2214304,1,0,3.03543e+06,11776,1819,8.92353e+06,227,133235,2014364
FORMULA FireWire-PT-07-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX(E(E(A(((i1.u14.p42==0)||(i3.u10.p32==1)) U (i1.u15.p44==1)) U ((i5.u23.p71==0)||(i6.u35.p104==1))) U (A((((i0.u40.p114==0)||(i0.u43.p...361
=> equivalent forward existential formula: ([(EY(Init) * !(E(E(!((E(!((i1.u15.p44==1)) U (!(((i1.u14.p42==0)||(i3.u10.p32==1))) * !((i1.u15.p44==1)))) + EG...653
(forward)formula 3,1,168.846,2214304,1,0,3.03543e+06,11776,2231,8.92353e+06,243,133235,4291373
FORMULA FireWire-PT-07-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (E((!((((EX(((i7.u38.p109==0)||(i1.u6.p18==1))) + A((i1.u5.p24==1) U (i1.u5.p16==0))) * (i3.u10.p30==1)) * (((i2.u3.p9==0)||(i4.u17.p52==...895
=> equivalent forward existential formula: ([FwdG((Init * !(E((!((((EX(((i7.u38.p109==0)||(i1.u6.p18==1))) + !((E(!((i1.u5.p16==0)) U (!((i1.u5.p24==1)) * ...4478
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 6
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
(forward)formula 4,0,250.648,2475664,1,0,3.32334e+06,11776,2371,9.46767e+06,253,133235,3214494
FORMULA FireWire-PT-07-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EG((!(E((i2.u3.p124!=0) U ((i6.u37.p103==1)&&((i6.u37.p6==0)||(i6.u22.p68==1))))) + AG((i6.u33.p97==0)))) * EG(AF((i2.u30.p87==0))))
=> equivalent forward existential formula: [FwdG((Init * EG((!(E((i2.u3.p124!=0) U ((i6.u37.p103==1)&&((i6.u37.p6==0)||(i6.u22.p68==1))))) + !(E(TRUE U !((...212
Fast SCC detection found an SCC at level 7
(forward)formula 5,1,279.074,2475664,1,0,3.32334e+06,11776,2441,9.46767e+06,255,133235,5263319
FORMULA FireWire-PT-07-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1301643 ms.

BK_STOP 1717361853859

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-07"
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-07, 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-171734898800217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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