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

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

=== Now, execution of the tool begins

BK_START 1717367390231

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 22:29:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:29:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:29:51] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 22:29:51] [INFO ] Transformed 248 places.
[2024-06-02 22:29:51] [INFO ] Transformed 383 transitions.
[2024-06-02 22:29:51] [INFO ] Found NUPN structural information;
[2024-06-02 22:29:51] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-15-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 94 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 383
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 38 place count 210 transition count 348
Iterating global reduction 1 with 35 rules applied. Total rules applied 73 place count 210 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 210 transition count 347
Applied a total of 74 rules in 41 ms. Remains 210 /248 variables (removed 38) and now considering 347/383 (removed 36) transitions.
// Phase 1: matrix 347 rows 210 cols
[2024-06-02 22:29:51] [INFO ] Computed 4 invariants in 21 ms
[2024-06-02 22:29:51] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-02 22:29:51] [INFO ] Invariant cache hit.
[2024-06-02 22:29:52] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2024-06-02 22:29:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-02 22:29:55] [INFO ] Deduced a trap composed of 117 places in 109 ms of which 15 ms to minimize.
[2024-06-02 22:29:55] [INFO ] Deduced a trap composed of 99 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:29:55] [INFO ] Deduced a trap composed of 102 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:29:55] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:29:55] [INFO ] Deduced a trap composed of 110 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:29:55] [INFO ] Deduced a trap composed of 120 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:29:55] [INFO ] Deduced a trap composed of 110 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:29:56] [INFO ] Deduced a trap composed of 114 places in 60 ms of which 2 ms to minimize.
[2024-06-02 22:29:56] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 2 ms to minimize.
[2024-06-02 22:29:56] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-06-02 22:29:56] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:29:56] [INFO ] Deduced a trap composed of 106 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:29:56] [INFO ] Deduced a trap composed of 114 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:29:56] [INFO ] Deduced a trap composed of 125 places in 68 ms of which 2 ms to minimize.
Problem TDEAD159 is UNSAT
[2024-06-02 22:29:57] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD318 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 15/19 constraints. Problems are: Problem set: 18 solved, 328 unsolved
[2024-06-02 22:29:58] [INFO ] Deduced a trap composed of 113 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:29:58] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:29:58] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-06-02 22:29:58] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 4/23 constraints. Problems are: Problem set: 18 solved, 328 unsolved
[2024-06-02 22:30:01] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:30:01] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:30:01] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 3/26 constraints. Problems are: Problem set: 18 solved, 328 unsolved
[2024-06-02 22:30:03] [INFO ] Deduced a trap composed of 114 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:30:03] [INFO ] Deduced a trap composed of 100 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:30:04] [INFO ] Deduced a trap composed of 107 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 3/29 constraints. Problems are: Problem set: 18 solved, 328 unsolved
[2024-06-02 22:30:05] [INFO ] Deduced a trap composed of 125 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/30 constraints. Problems are: Problem set: 18 solved, 328 unsolved
[2024-06-02 22:30:08] [INFO ] Deduced a trap composed of 115 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:30:08] [INFO ] Deduced a trap composed of 114 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:30:08] [INFO ] Deduced a trap composed of 124 places in 67 ms of which 2 ms to minimize.
[2024-06-02 22:30:08] [INFO ] Deduced a trap composed of 113 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 4/34 constraints. Problems are: Problem set: 18 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/34 constraints. Problems are: Problem set: 18 solved, 328 unsolved
At refinement iteration 9 (OVERLAPS) 347/555 variables, 208/242 constraints. Problems are: Problem set: 18 solved, 328 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 0/242 constraints. Problems are: Problem set: 18 solved, 328 unsolved
At refinement iteration 11 (OVERLAPS) 2/557 variables, 2/244 constraints. Problems are: Problem set: 18 solved, 328 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 0/244 constraints. Problems are: Problem set: 18 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/557 variables, and 244 constraints, problems are : Problem set: 18 solved, 328 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 18 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 30/34 constraints. Problems are: Problem set: 18 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/34 constraints. Problems are: Problem set: 18 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 347/555 variables, 208/242 constraints. Problems are: Problem set: 18 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 317/559 constraints. Problems are: Problem set: 18 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/559 constraints. Problems are: Problem set: 18 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 2/557 variables, 2/561 constraints. Problems are: Problem set: 18 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 11/572 constraints. Problems are: Problem set: 18 solved, 328 unsolved
[2024-06-02 22:30:39] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 1/573 constraints. Problems are: Problem set: 18 solved, 328 unsolved
[2024-06-02 22:30:47] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 574 constraints, problems are : Problem set: 18 solved, 328 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 328/346 constraints, Known Traps: 32/32 constraints]
After SMT, in 60216ms problems are : Problem set: 18 solved, 328 unsolved
Search for dead transitions found 18 dead transitions in 60235ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 210/248 places, 329/383 transitions.
Applied a total of 0 rules in 5 ms. Remains 210 /210 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60809 ms. Remains : 210/248 places, 329/383 transitions.
Support contains 94 out of 210 places after structural reductions.
[2024-06-02 22:30:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 22:30:52] [INFO ] Flatten gal took : 58 ms
FORMULA FireWire-PT-15-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:30:52] [INFO ] Flatten gal took : 45 ms
[2024-06-02 22:30:52] [INFO ] Input system was already deterministic with 329 transitions.
Support contains 64 out of 210 places (down from 94) after GAL structural reductions.
RANDOM walk for 40000 steps (10 resets) in 1175 ms. (34 steps per ms) remains 34/41 properties
BEST_FIRST walk for 4002 steps (10 resets) in 87 ms. (45 steps per ms) remains 30/34 properties
BEST_FIRST walk for 4000 steps (10 resets) in 46 ms. (85 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4001 steps (12 resets) in 49 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (11 resets) in 59 ms. (66 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (11 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (11 resets) in 52 ms. (75 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (12 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (12 resets) in 33 ms. (117 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4000 steps (9 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (13 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (10 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (11 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (9 resets) in 41 ms. (95 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (9 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (11 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (11 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (11 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (12 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (10 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (10 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (11 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (10 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (10 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (12 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (9 resets) in 28 ms. (137 steps per ms) remains 28/28 properties
// Phase 1: matrix 329 rows 210 cols
[2024-06-02 22:30:53] [INFO ] Computed 4 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 150/195 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 22:30:54] [INFO ] Deduced a trap composed of 110 places in 118 ms of which 1 ms to minimize.
[2024-06-02 22:30:54] [INFO ] Deduced a trap composed of 90 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:30:54] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 5 ms to minimize.
[2024-06-02 22:30:54] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
Problem AtomicPropp6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 27 unsolved
[2024-06-02 22:30:54] [INFO ] Deduced a trap composed of 125 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:30:54] [INFO ] Deduced a trap composed of 125 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 27 unsolved
[2024-06-02 22:30:54] [INFO ] Deduced a trap composed of 115 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:30:55] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 318/513 variables, 195/207 constraints. Problems are: Problem set: 1 solved, 27 unsolved
[2024-06-02 22:30:55] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:30:55] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:30:55] [INFO ] Deduced a trap composed of 111 places in 62 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 3/210 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 19/532 variables, 10/220 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 7/539 variables, 5/225 constraints. Problems are: Problem set: 1 solved, 27 unsolved
[2024-06-02 22:30:56] [INFO ] Deduced a trap composed of 119 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:30:56] [INFO ] Deduced a trap composed of 116 places in 60 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 2/227 constraints. Problems are: Problem set: 1 solved, 27 unsolved
[2024-06-02 22:30:56] [INFO ] Deduced a trap composed of 126 places in 71 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 1/228 constraints. Problems are: Problem set: 1 solved, 27 unsolved
[2024-06-02 22:30:57] [INFO ] Deduced a trap composed of 132 places in 72 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 1/229 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 0/539 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 229 constraints, problems are : Problem set: 1 solved, 27 unsolved in 3908 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 1 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 27 unsolved
Problem AtomicPropp37 is UNSAT
At refinement iteration 1 (OVERLAPS) 152/195 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 14/18 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-06-02 22:30:57] [INFO ] Deduced a trap composed of 102 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:30:57] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2024-06-02 22:30:57] [INFO ] Deduced a trap composed of 107 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:30:57] [INFO ] Deduced a trap composed of 110 places in 60 ms of which 2 ms to minimize.
[2024-06-02 22:30:58] [INFO ] Deduced a trap composed of 127 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 5/23 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-06-02 22:30:58] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 1/24 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 318/513 variables, 195/219 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 25/244 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-06-02 22:30:58] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:30:58] [INFO ] Deduced a trap composed of 101 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:30:59] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 3/247 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-06-02 22:30:59] [INFO ] Deduced a trap composed of 107 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:30:59] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 2/249 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 0/249 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 19/532 variables, 10/259 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 1/260 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 0/260 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 7/539 variables, 5/265 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 1/266 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/539 variables, 0/266 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 17 (OVERLAPS) 0/539 variables, 0/266 constraints. Problems are: Problem set: 2 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 539/539 variables, and 266 constraints, problems are : Problem set: 2 solved, 26 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 26/28 constraints, Known Traps: 26/26 constraints]
After SMT, in 8929ms problems are : Problem set: 2 solved, 26 unsolved
Fused 26 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 3741 ms.
Support contains 39 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 329/329 transitions.
Graph (trivial) has 106 edges and 210 vertex of which 9 / 210 are part of one of the 2 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 203 transition count 300
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 184 transition count 298
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 182 transition count 298
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 43 place count 182 transition count 290
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 59 place count 174 transition count 290
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 73 place count 160 transition count 256
Iterating global reduction 3 with 14 rules applied. Total rules applied 87 place count 160 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 89 place count 160 transition count 254
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 89 place count 160 transition count 252
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 93 place count 158 transition count 252
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 95 place count 156 transition count 249
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 156 transition count 249
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 121 place count 144 transition count 237
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 143 transition count 227
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 143 transition count 227
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 137 place count 136 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 140 place count 136 transition count 245
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 156 place count 136 transition count 229
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 172 place count 120 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 174 place count 120 transition count 227
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 176 place count 120 transition count 227
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 120 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 178 place count 119 transition count 226
Applied a total of 178 rules in 157 ms. Remains 119 /210 variables (removed 91) and now considering 226/329 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 119/210 places, 226/329 transitions.
RANDOM walk for 40000 steps (12 resets) in 459 ms. (86 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (18 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (16 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (12 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (13 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (20 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (9 resets) in 49 ms. (80 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (11 resets) in 44 ms. (88 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (19 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (25 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (35 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (13 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (12 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (16 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (15 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (11 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (17 resets) in 47 ms. (83 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (18 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (17 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (10 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (18 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (12 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (15 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (12 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (20 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (23 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
Finished probabilistic random walk after 139989 steps, run visited all 26 properties in 539 ms. (steps per millisecond=259 )
Probabilistic random walk after 139989 steps, saw 38163 distinct states, run finished after 542 ms. (steps per millisecond=258 ) properties seen :26
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2024-06-02 22:31:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 22:31:07] [INFO ] Flatten gal took : 17 ms
FORMULA FireWire-PT-15-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:31:07] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:31:07] [INFO ] Input system was already deterministic with 329 transitions.
Computed a total of 60 stabilizing places and 82 stable transitions
Graph (complete) has 576 edges and 210 vertex of which 208 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 329/329 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 329
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 34 place count 176 transition count 277
Iterating global reduction 1 with 32 rules applied. Total rules applied 66 place count 176 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 176 transition count 276
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 79 place count 164 transition count 251
Iterating global reduction 2 with 12 rules applied. Total rules applied 91 place count 164 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 164 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 163 transition count 247
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 163 transition count 247
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 162 transition count 246
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 162 transition count 246
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 161 transition count 243
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 161 transition count 243
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 160 transition count 242
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 160 transition count 242
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 159 transition count 239
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 159 transition count 239
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 158 transition count 238
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 158 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 157 transition count 235
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 157 transition count 235
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 156 transition count 234
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 156 transition count 234
Applied a total of 108 rules in 30 ms. Remains 156 /210 variables (removed 54) and now considering 234/329 (removed 95) transitions.
// Phase 1: matrix 234 rows 156 cols
[2024-06-02 22:31:07] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:31:07] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 22:31:07] [INFO ] Invariant cache hit.
[2024-06-02 22:31:07] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-06-02 22:31:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-02 22:31:09] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 2 ms to minimize.
[2024-06-02 22:31:09] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:31:09] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:31:09] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:31:09] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:31:09] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 2 ms to minimize.
[2024-06-02 22:31:09] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:31:09] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:31:10] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:31:10] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
[2024-06-02 22:31:10] [INFO ] Deduced a trap composed of 90 places in 46 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 11/15 constraints. Problems are: Problem set: 18 solved, 215 unsolved
[2024-06-02 22:31:10] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:31:10] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:31:10] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:31:11] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:31:11] [INFO ] Deduced a trap composed of 100 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:31:11] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 6/21 constraints. Problems are: Problem set: 18 solved, 215 unsolved
[2024-06-02 22:31:12] [INFO ] Deduced a trap composed of 93 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/22 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/22 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 234/390 variables, 156/178 constraints. Problems are: Problem set: 18 solved, 215 unsolved
[2024-06-02 22:31:16] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 1/179 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/179 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/179 constraints. Problems are: Problem set: 18 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 179 constraints, problems are : Problem set: 18 solved, 215 unsolved in 12105 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 18 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 19/23 constraints. Problems are: Problem set: 18 solved, 215 unsolved
[2024-06-02 22:31:21] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/24 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/24 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 234/390 variables, 156/180 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 215/395 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/395 constraints. Problems are: Problem set: 18 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/390 variables, 0/395 constraints. Problems are: Problem set: 18 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 395 constraints, problems are : Problem set: 18 solved, 215 unsolved in 11591 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 215/233 constraints, Known Traps: 20/20 constraints]
After SMT, in 23747ms problems are : Problem set: 18 solved, 215 unsolved
Search for dead transitions found 18 dead transitions in 23749ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 156/210 places, 216/329 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24001 ms. Remains : 156/210 places, 216/329 transitions.
[2024-06-02 22:31:31] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:31:31] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:31:31] [INFO ] Input system was already deterministic with 216 transitions.
[2024-06-02 22:31:31] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:31:31] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:31:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality12515360390758414967.gal : 5 ms
[2024-06-02 22:31:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality15172651380944579557.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/CTLCardinality12515360390758414967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15172651380944579557.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,497292,1.33921,49448,2,5623,5,140047,6,0,841,186639,0


Converting to forward existential form...Done !
original formula: EF((A(EF(((p196==0)||(p106==1))) U (p44==0)) * (A((p160==1) U (p143!=0)) + ((p188!=1) * EX((p14==1))))))
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !((E(!((p44==0)) U (!(E(TRUE U ((p196==0)||(p106==1)))) * !((p44==0)))) + EG(!((p44==0)))...402
Reverse transition relation is NOT exact ! Due to transitions t3, t38, t50, t54, t58, t61, t65, t73, t81, t85, t86, t101, t104, t106, t115, t117, t177, t18...306
(forward)formula 0,1,25.6296,782680,1,0,843,5.55632e+06,470,428,5575,3.68108e+06,1007
FORMULA FireWire-PT-15-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 210/210 places, 329/329 transitions.
Graph (trivial) has 155 edges and 210 vertex of which 12 / 210 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 565 edges and 201 vertex of which 199 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 198 transition count 287
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 167 transition count 286
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 65 place count 167 transition count 275
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 87 place count 156 transition count 275
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 106 place count 137 transition count 236
Iterating global reduction 2 with 19 rules applied. Total rules applied 125 place count 137 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 137 transition count 234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 127 place count 137 transition count 232
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 135 transition count 232
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 139 place count 127 transition count 222
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 127 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 127 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 150 place count 126 transition count 220
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 152 place count 124 transition count 215
Iterating global reduction 5 with 2 rules applied. Total rules applied 154 place count 124 transition count 215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 123 transition count 214
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 123 transition count 214
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 157 place count 122 transition count 211
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 122 transition count 211
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 121 transition count 210
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 121 transition count 210
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 161 place count 120 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 120 transition count 207
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 163 place count 119 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 119 transition count 206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 165 place count 118 transition count 203
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 118 transition count 203
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 167 place count 117 transition count 202
Iterating global reduction 5 with 1 rules applied. Total rules applied 168 place count 117 transition count 202
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 169 place count 116 transition count 199
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 116 transition count 199
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 171 place count 115 transition count 198
Iterating global reduction 5 with 1 rules applied. Total rules applied 172 place count 115 transition count 198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 173 place count 114 transition count 196
Iterating global reduction 5 with 1 rules applied. Total rules applied 174 place count 114 transition count 196
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 190 place count 106 transition count 188
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 193 place count 103 transition count 174
Iterating global reduction 5 with 3 rules applied. Total rules applied 196 place count 103 transition count 174
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 5 with 2 rules applied. Total rules applied 198 place count 102 transition count 173
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 102 transition count 173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 200 place count 101 transition count 172
Applied a total of 200 rules in 76 ms. Remains 101 /210 variables (removed 109) and now considering 172/329 (removed 157) transitions.
[2024-06-02 22:31:57] [INFO ] Flow matrix only has 169 transitions (discarded 3 similar events)
// Phase 1: matrix 169 rows 101 cols
[2024-06-02 22:31:57] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 22:31:57] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-02 22:31:57] [INFO ] Flow matrix only has 169 transitions (discarded 3 similar events)
[2024-06-02 22:31:57] [INFO ] Invariant cache hit.
[2024-06-02 22:31:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:31:58] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-06-02 22:31:58] [INFO ] Redundant transitions in 4 ms returned []
Running 167 sub problems to find dead transitions.
[2024-06-02 22:31:58] [INFO ] Flow matrix only has 169 transitions (discarded 3 similar events)
[2024-06-02 22:31:58] [INFO ] Invariant cache hit.
[2024-06-02 22:31:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-02 22:31:58] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:31:58] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:31:58] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:31:58] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:31:58] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:31:58] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-02 22:31:59] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
[2024-06-02 22:31:59] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 168/268 variables, 100/112 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 1/113 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/113 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 1/269 variables, 1/114 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/114 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/114 constraints. Problems are: Problem set: 15 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/270 variables, and 114 constraints, problems are : Problem set: 15 solved, 152 unsolved in 4347 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 15 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 168/268 variables, 100/112 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 1/113 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 152/265 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/265 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 1/269 variables, 1/266 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/266 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 0/269 variables, 0/266 constraints. Problems are: Problem set: 15 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/270 variables, and 266 constraints, problems are : Problem set: 15 solved, 152 unsolved in 5967 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 152/167 constraints, Known Traps: 8/8 constraints]
After SMT, in 10357ms problems are : Problem set: 15 solved, 152 unsolved
Search for dead transitions found 15 dead transitions in 10358ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 101/210 places, 157/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 156
Applied a total of 2 rules in 12 ms. Remains 100 /101 variables (removed 1) and now considering 156/157 (removed 1) transitions.
[2024-06-02 22:32:08] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
// Phase 1: matrix 153 rows 100 cols
[2024-06-02 22:32:08] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:32:08] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:32:08] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
[2024-06-02 22:32:08] [INFO ] Invariant cache hit.
[2024-06-02 22:32:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:32:08] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 100/210 places, 156/329 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 10931 ms. Remains : 100/210 places, 156/329 transitions.
[2024-06-02 22:32:08] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:32:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:32:08] [INFO ] Input system was already deterministic with 156 transitions.
[2024-06-02 22:32:08] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:32:08] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:32:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality413613181371927681.gal : 4 ms
[2024-06-02 22:32:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2044586436234724184.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality413613181371927681.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2044586436234724184.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality2044586436234724184.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 91
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :91 after 109
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :109 after 183
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :183 after 405
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :405 after 1695
RANDOM walk for 40000 steps (3016 resets) in 449 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1102 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1695 after 3843
Finished probabilistic random walk after 11261 steps, run visited all 1 properties in 39 ms. (steps per millisecond=288 )
Probabilistic random walk after 11261 steps, saw 3804 distinct states, run finished after 39 ms. (steps per millisecond=288 ) properties seen :1
FORMULA FireWire-PT-15-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 329/329 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 329
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 31 place count 179 transition count 289
Iterating global reduction 1 with 29 rules applied. Total rules applied 60 place count 179 transition count 289
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 71 place count 168 transition count 265
Iterating global reduction 1 with 11 rules applied. Total rules applied 82 place count 168 transition count 265
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 166 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 166 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 165 transition count 259
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 165 transition count 259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 164 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 164 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 163 transition count 255
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 163 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 162 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 162 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 161 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 161 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 160 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 160 transition count 248
Applied a total of 98 rules in 13 ms. Remains 160 /210 variables (removed 50) and now considering 248/329 (removed 81) transitions.
// Phase 1: matrix 248 rows 160 cols
[2024-06-02 22:32:08] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:32:08] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 22:32:08] [INFO ] Invariant cache hit.
[2024-06-02 22:32:09] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-06-02 22:32:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-02 22:32:10] [INFO ] Deduced a trap composed of 101 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:32:10] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:32:10] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:32:10] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:32:10] [INFO ] Deduced a trap composed of 94 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:32:10] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:32:10] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:32:11] [INFO ] Deduced a trap composed of 86 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:32:11] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:32:11] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:32:11] [INFO ] Deduced a trap composed of 93 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:32:11] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:32:11] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
[2024-06-02 22:32:11] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 1 ms to minimize.
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 14/18 constraints. Problems are: Problem set: 18 solved, 229 unsolved
[2024-06-02 22:32:12] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/19 constraints. Problems are: Problem set: 18 solved, 229 unsolved
[2024-06-02 22:32:13] [INFO ] Deduced a trap composed of 94 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:32:14] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 2/21 constraints. Problems are: Problem set: 18 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/21 constraints. Problems are: Problem set: 18 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 248/408 variables, 160/181 constraints. Problems are: Problem set: 18 solved, 229 unsolved
[2024-06-02 22:32:17] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 1/182 constraints. Problems are: Problem set: 18 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/182 constraints. Problems are: Problem set: 18 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/182 constraints. Problems are: Problem set: 18 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 182 constraints, problems are : Problem set: 18 solved, 229 unsolved in 13303 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 18 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 18/22 constraints. Problems are: Problem set: 18 solved, 229 unsolved
[2024-06-02 22:32:23] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:32:23] [INFO ] Deduced a trap composed of 101 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 2/24 constraints. Problems are: Problem set: 18 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 18 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 248/408 variables, 160/184 constraints. Problems are: Problem set: 18 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 229/413 constraints. Problems are: Problem set: 18 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/413 constraints. Problems are: Problem set: 18 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/413 constraints. Problems are: Problem set: 18 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 413 constraints, problems are : Problem set: 18 solved, 229 unsolved in 12861 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 229/247 constraints, Known Traps: 20/20 constraints]
After SMT, in 26215ms problems are : Problem set: 18 solved, 229 unsolved
Search for dead transitions found 18 dead transitions in 26218ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 160/210 places, 230/329 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26435 ms. Remains : 160/210 places, 230/329 transitions.
[2024-06-02 22:32:35] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:32:35] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:32:35] [INFO ] Input system was already deterministic with 230 transitions.
[2024-06-02 22:32:35] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:32:35] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:32:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality4636053251180498600.gal : 1 ms
[2024-06-02 22:32:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality14941098296548974573.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/CTLCardinality4636053251180498600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14941098296548974573.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,528686,1.50448,52848,2,6235,5,152653,6,0,871,210236,0


Converting to forward existential form...Done !
original formula: AG((A(EG(((p118==0)||(p51==1))) U AX(((p161==1)||(p41==0)))) + AG(((EF(((p194==0)||(p164==1))) * EF(((p142==0)||(p83==1)))) * ((p222==0)&...169
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * !(!((E(!(!(EX(!(((p161==1)||(p41==0)))))) U (!(EG(((p118==0)||(p51==1)))) * !(!(EX(!...752
Reverse transition relation is NOT exact ! Due to transitions t3, t37, t49, t54, t58, t61, t65, t73, t81, t85, t86, t102, t105, t107, t116, t118, t190, t19...306
Using saturation style SCC detection
(forward)formula 0,0,28.4252,898628,1,0,800,6.32749e+06,492,429,6092,3.8888e+06,942
FORMULA FireWire-PT-15-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 329/329 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 329
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 34 place count 176 transition count 277
Iterating global reduction 1 with 32 rules applied. Total rules applied 66 place count 176 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 176 transition count 276
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 80 place count 163 transition count 250
Iterating global reduction 2 with 13 rules applied. Total rules applied 93 place count 163 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 163 transition count 249
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 161 transition count 244
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 161 transition count 244
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 160 transition count 243
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 160 transition count 243
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 159 transition count 240
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 159 transition count 240
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 158 transition count 239
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 158 transition count 239
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 157 transition count 236
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 157 transition count 236
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 156 transition count 235
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 156 transition count 235
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 155 transition count 232
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 155 transition count 232
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 154 transition count 231
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 154 transition count 231
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 153 transition count 228
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 153 transition count 228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 152 transition count 227
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 152 transition count 227
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 151 transition count 225
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 151 transition count 225
Applied a total of 118 rules in 13 ms. Remains 151 /210 variables (removed 59) and now considering 225/329 (removed 104) transitions.
// Phase 1: matrix 225 rows 151 cols
[2024-06-02 22:33:03] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:33:04] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 22:33:04] [INFO ] Invariant cache hit.
[2024-06-02 22:33:04] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-06-02 22:33:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-06-02 22:33:05] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:33:05] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:33:05] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:33:05] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:33:05] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:33:05] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:33:05] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:33:05] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:33:05] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:33:05] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:33:06] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:33:06] [INFO ] Deduced a trap composed of 83 places in 44 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 22:33:06] [INFO ] Deduced a trap composed of 75 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:33:07] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:33:07] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 3/19 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/19 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 225/376 variables, 151/170 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 22:33:10] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/376 variables, 0/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 171 constraints, problems are : Problem set: 15 solved, 209 unsolved in 9343 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 15 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 16/20 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 22:33:14] [INFO ] Deduced a trap composed of 88 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/21 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 225/376 variables, 151/172 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 209/381 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 22:33:17] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 1/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 382 constraints, problems are : Problem set: 15 solved, 209 unsolved in 13770 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 209/224 constraints, Known Traps: 18/18 constraints]
After SMT, in 23152ms problems are : Problem set: 15 solved, 209 unsolved
Search for dead transitions found 15 dead transitions in 23155ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 151/210 places, 210/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 149 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 149 transition count 208
Applied a total of 4 rules in 9 ms. Remains 149 /151 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 149 cols
[2024-06-02 22:33:27] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:33:27] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 22:33:27] [INFO ] Invariant cache hit.
[2024-06-02 22:33:27] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/210 places, 208/329 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23533 ms. Remains : 149/210 places, 208/329 transitions.
[2024-06-02 22:33:27] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:33:27] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:33:27] [INFO ] Input system was already deterministic with 208 transitions.
[2024-06-02 22:33:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:33:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:33:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3134133363244362149.gal : 1 ms
[2024-06-02 22:33:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality12368314080516125851.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/CTLCardinality3134133363244362149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12368314080516125851.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,477446,0.958913,38852,2,4898,5,106757,6,0,805,147401,0


Converting to forward existential form...Done !
original formula: EX(EF((p162==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (p162==1))] != FALSE
(forward)formula 0,1,1.55216,39380,1,0,9,107599,9,1,1586,148502,4
FORMULA FireWire-PT-15-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 329/329 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 329
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 32 place count 178 transition count 279
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 178 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 178 transition count 278
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 76 place count 165 transition count 252
Iterating global reduction 2 with 13 rules applied. Total rules applied 89 place count 165 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 165 transition count 251
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 163 transition count 246
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 163 transition count 246
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 162 transition count 245
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 162 transition count 245
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 161 transition count 242
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 161 transition count 242
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 160 transition count 241
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 160 transition count 241
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 159 transition count 238
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 159 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 158 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 158 transition count 237
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 157 transition count 234
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 157 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 156 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 156 transition count 233
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 155 transition count 230
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 155 transition count 230
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 154 transition count 229
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 154 transition count 229
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 153 transition count 227
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 153 transition count 227
Applied a total of 114 rules in 18 ms. Remains 153 /210 variables (removed 57) and now considering 227/329 (removed 102) transitions.
// Phase 1: matrix 227 rows 153 cols
[2024-06-02 22:33:29] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 22:33:29] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 22:33:29] [INFO ] Invariant cache hit.
[2024-06-02 22:33:29] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-06-02 22:33:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-02 22:33:30] [INFO ] Deduced a trap composed of 100 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:33:30] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:33:30] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:33:30] [INFO ] Deduced a trap composed of 89 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:33:30] [INFO ] Deduced a trap composed of 84 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:33:30] [INFO ] Deduced a trap composed of 79 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:33:31] [INFO ] Deduced a trap composed of 77 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:33:31] [INFO ] Deduced a trap composed of 77 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:33:31] [INFO ] Deduced a trap composed of 91 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:33:31] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:33:31] [INFO ] Deduced a trap composed of 81 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:33:31] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:33:31] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:33:31] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:33:31] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:33:31] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:33:31] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:33:31] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
[2024-06-02 22:33:31] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 2 ms to minimize.
Problem TDEAD139 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
[2024-06-02 22:33:32] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/24 constraints. Problems are: Problem set: 15 solved, 211 unsolved
[2024-06-02 22:33:32] [INFO ] Deduced a trap composed of 91 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:33:32] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:33:32] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:33:32] [INFO ] Deduced a trap composed of 94 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:33:32] [INFO ] Deduced a trap composed of 91 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 5/29 constraints. Problems are: Problem set: 15 solved, 211 unsolved
[2024-06-02 22:33:34] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:33:34] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 2/31 constraints. Problems are: Problem set: 15 solved, 211 unsolved
[2024-06-02 22:33:34] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:33:34] [INFO ] Deduced a trap composed of 89 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 227/380 variables, 153/186 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 186 constraints, problems are : Problem set: 15 solved, 211 unsolved in 11238 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 15 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 29/33 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 227/380 variables, 153/186 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 211/397 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/397 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/380 variables, 0/397 constraints. Problems are: Problem set: 15 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 397 constraints, problems are : Problem set: 15 solved, 211 unsolved in 10696 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 211/226 constraints, Known Traps: 29/29 constraints]
After SMT, in 21974ms problems are : Problem set: 15 solved, 211 unsolved
Search for dead transitions found 15 dead transitions in 21977ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 153/210 places, 212/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 151 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 151 transition count 210
Applied a total of 4 rules in 8 ms. Remains 151 /153 variables (removed 2) and now considering 210/212 (removed 2) transitions.
// Phase 1: matrix 210 rows 151 cols
[2024-06-02 22:33:51] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:33:51] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 22:33:51] [INFO ] Invariant cache hit.
[2024-06-02 22:33:51] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/210 places, 210/329 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22377 ms. Remains : 151/210 places, 210/329 transitions.
[2024-06-02 22:33:51] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:33:51] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:33:51] [INFO ] Input system was already deterministic with 210 transitions.
[2024-06-02 22:33:51] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:33:51] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:33:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality11416359974136011534.gal : 4 ms
[2024-06-02 22:33:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality18129562943759204668.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/CTLCardinality11416359974136011534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18129562943759204668.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,549934,1.04374,41644,2,5296,5,114686,6,0,815,162758,0


Converting to forward existential form...Done !
original formula: EX(AG(((p88==0)||(p121==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((p88==0)||(p121==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t35, t48, t52, t56, t59, t63, t71, t74, t80, t84, t85, t100, t103, t105, t114, t116, t171...305
(forward)formula 0,0,10.5305,317352,1,0,407,2.04536e+06,441,212,5290,1.10522e+06,499
FORMULA FireWire-PT-15-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 210/210 places, 329/329 transitions.
Graph (trivial) has 151 edges and 210 vertex of which 11 / 210 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 567 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 199 transition count 288
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 167 transition count 287
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 167 transition count 276
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 89 place count 156 transition count 276
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 107 place count 138 transition count 238
Iterating global reduction 2 with 18 rules applied. Total rules applied 125 place count 138 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 138 transition count 236
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 127 place count 138 transition count 234
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 136 transition count 234
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 137 place count 130 transition count 227
Iterating global reduction 3 with 6 rules applied. Total rules applied 143 place count 130 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 145 place count 130 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 146 place count 129 transition count 225
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 128 transition count 223
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 128 transition count 223
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 164 place count 120 transition count 215
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 167 place count 117 transition count 201
Iterating global reduction 5 with 3 rules applied. Total rules applied 170 place count 117 transition count 201
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 5 with 2 rules applied. Total rules applied 172 place count 116 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 115 transition count 199
Applied a total of 173 rules in 42 ms. Remains 115 /210 variables (removed 95) and now considering 199/329 (removed 130) transitions.
[2024-06-02 22:34:02] [INFO ] Flow matrix only has 196 transitions (discarded 3 similar events)
// Phase 1: matrix 196 rows 115 cols
[2024-06-02 22:34:02] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:34:02] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 22:34:02] [INFO ] Flow matrix only has 196 transitions (discarded 3 similar events)
[2024-06-02 22:34:02] [INFO ] Invariant cache hit.
[2024-06-02 22:34:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:34:02] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-02 22:34:02] [INFO ] Redundant transitions in 6 ms returned []
Running 194 sub problems to find dead transitions.
[2024-06-02 22:34:02] [INFO ] Flow matrix only has 196 transitions (discarded 3 similar events)
[2024-06-02 22:34:02] [INFO ] Invariant cache hit.
[2024-06-02 22:34:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 22:34:02] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:34:03] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:34:03] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:34:03] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:34:03] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
[2024-06-02 22:34:03] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-02 22:34:03] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
[2024-06-02 22:34:03] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
[2024-06-02 22:34:03] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 9/13 constraints. Problems are: Problem set: 26 solved, 168 unsolved
[2024-06-02 22:34:04] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/14 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/14 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 195/309 variables, 114/128 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 1/129 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/129 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 1/310 variables, 1/130 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/130 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/130 constraints. Problems are: Problem set: 26 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/311 variables, and 130 constraints, problems are : Problem set: 26 solved, 168 unsolved in 6602 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 26 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 4/4 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 10/14 constraints. Problems are: Problem set: 26 solved, 168 unsolved
[2024-06-02 22:34:09] [INFO ] Deduced a trap composed of 70 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/15 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 195/309 variables, 114/129 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 1/130 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 168/298 constraints. Problems are: Problem set: 26 solved, 168 unsolved
[2024-06-02 22:34:10] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 1/299 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/299 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 1/310 variables, 1/300 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/300 constraints. Problems are: Problem set: 26 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/310 variables, 0/300 constraints. Problems are: Problem set: 26 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/311 variables, and 300 constraints, problems are : Problem set: 26 solved, 168 unsolved in 9907 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 168/194 constraints, Known Traps: 12/12 constraints]
After SMT, in 16554ms problems are : Problem set: 26 solved, 168 unsolved
Search for dead transitions found 26 dead transitions in 16557ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 115/210 places, 173/329 transitions.
Applied a total of 0 rules in 17 ms. Remains 115 /115 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2024-06-02 22:34:18] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 16807 ms. Remains : 115/210 places, 173/329 transitions.
[2024-06-02 22:34:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:34:18] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:34:18] [INFO ] Input system was already deterministic with 173 transitions.
[2024-06-02 22:34:18] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:34:18] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:34:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality12883509263359166150.gal : 1 ms
[2024-06-02 22:34:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality5343198611477449168.ctl : 3 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/CTLCardinality12883509263359166150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5343198611477449168.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,122038,0.38452,20116,2,2567,5,51520,6,0,631,65560,0


Converting to forward existential form...Done !
original formula: EF(!(E(((p33==0)||(p94==1)) U !(E(AG((p134==1)) U (p55==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p33==0)||(p94==1)) U !(E(!(E(TRUE U !((p134==1)))) U (p55==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t27, t30, t32, t36, t41, t42, t44, t45, t51, t53, t59, t60, t101, t102, t110, t124,...304
(forward)formula 0,1,1.22857,43884,1,0,320,211985,372,162,4435,172296,375
FORMULA FireWire-PT-15-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 329/329 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 329
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 31 place count 179 transition count 280
Iterating global reduction 1 with 29 rules applied. Total rules applied 60 place count 179 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 179 transition count 279
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 71 place count 169 transition count 257
Iterating global reduction 2 with 10 rules applied. Total rules applied 81 place count 169 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 169 transition count 256
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 167 transition count 251
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 167 transition count 251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 166 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 166 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 165 transition count 247
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 165 transition count 247
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 164 transition count 246
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 164 transition count 246
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 163 transition count 243
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 163 transition count 243
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 162 transition count 242
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 162 transition count 242
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 161 transition count 239
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 161 transition count 239
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 160 transition count 238
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 160 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 159 transition count 235
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 159 transition count 235
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 158 transition count 234
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 158 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 157 transition count 232
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 157 transition count 232
Applied a total of 106 rules in 13 ms. Remains 157 /210 variables (removed 53) and now considering 232/329 (removed 97) transitions.
// Phase 1: matrix 232 rows 157 cols
[2024-06-02 22:34:20] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:34:20] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:34:20] [INFO ] Invariant cache hit.
[2024-06-02 22:34:20] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-06-02 22:34:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-02 22:34:21] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:34:21] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:34:21] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:34:21] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:34:21] [INFO ] Deduced a trap composed of 91 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:34:22] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:34:22] [INFO ] Deduced a trap composed of 93 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:34:22] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 2 ms to minimize.
[2024-06-02 22:34:22] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:34:22] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:34:22] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 2 ms to minimize.
[2024-06-02 22:34:22] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:34:22] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:34:22] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 14/18 constraints. Problems are: Problem set: 15 solved, 216 unsolved
[2024-06-02 22:34:23] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 0 ms to minimize.
[2024-06-02 22:34:23] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:34:23] [INFO ] Deduced a trap composed of 77 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:34:23] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 4/22 constraints. Problems are: Problem set: 15 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 15 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 232/389 variables, 157/179 constraints. Problems are: Problem set: 15 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/179 constraints. Problems are: Problem set: 15 solved, 216 unsolved
[2024-06-02 22:34:28] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:34:28] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/389 variables, 2/181 constraints. Problems are: Problem set: 15 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 181 constraints, problems are : Problem set: 15 solved, 216 unsolved in 12388 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 15 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/24 constraints. Problems are: Problem set: 15 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/24 constraints. Problems are: Problem set: 15 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 232/389 variables, 157/181 constraints. Problems are: Problem set: 15 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 216/397 constraints. Problems are: Problem set: 15 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/397 constraints. Problems are: Problem set: 15 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/389 variables, 0/397 constraints. Problems are: Problem set: 15 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 397 constraints, problems are : Problem set: 15 solved, 216 unsolved in 11081 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 216/231 constraints, Known Traps: 20/20 constraints]
After SMT, in 23501ms problems are : Problem set: 15 solved, 216 unsolved
Search for dead transitions found 15 dead transitions in 23505ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 157/210 places, 217/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 155 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 155 transition count 215
Applied a total of 4 rules in 9 ms. Remains 155 /157 variables (removed 2) and now considering 215/217 (removed 2) transitions.
// Phase 1: matrix 215 rows 155 cols
[2024-06-02 22:34:43] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:34:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 22:34:44] [INFO ] Invariant cache hit.
[2024-06-02 22:34:44] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/210 places, 215/329 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23886 ms. Remains : 155/210 places, 215/329 transitions.
[2024-06-02 22:34:44] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:34:44] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:34:44] [INFO ] Input system was already deterministic with 215 transitions.
[2024-06-02 22:34:44] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:34:44] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:34:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality15467653713541366692.gal : 2 ms
[2024-06-02 22:34:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality9172772001096088160.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/CTLCardinality15467653713541366692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9172772001096088160.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,504344,1.60907,48128,2,4903,5,149359,6,0,836,221594,0


Converting to forward existential form...Done !
original formula: AG(((EF(AX(((p166==0)&&(p50==1)))) + EG(((p125==0)||(p113==1)))) + EG((((p150==0)||(p3==1)) * A(AX((p81==0)) U (p220==0))))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(EG((((p150==0)||(p3==1)) * !((E(!((p220==0)) U (!(!(EX(!((p81==0))))) * !((p220==0)))) +...268
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t23, t37, t49, t53, t58, t61, t65, t72, t73, t80, t83, t87, t88, t90, t94, t104, t107...329
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 22:35:14] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:35:14] [INFO ] Applying decomposition
[2024-06-02 22:35:14] [INFO ] Flatten gal took : 5 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/graph9648482614829546196.txt' '-o' '/tmp/graph9648482614829546196.bin' '-w' '/tmp/graph9648482614829546196.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9648482614829546196.bin' '-l' '-1' '-v' '-w' '/tmp/graph9648482614829546196.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:35:14] [INFO ] Decomposing Gal with order
[2024-06-02 22:35:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:35:14] [INFO ] Removed a total of 135 redundant transitions.
[2024-06-02 22:35:14] [INFO ] Flatten gal took : 38 ms
[2024-06-02 22:35:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2024-06-02 22:35:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality12411370302841310560.gal : 3 ms
[2024-06-02 22:35:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality15547839018223737605.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/CTLCardinality12411370302841310560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15547839018223737605.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,504344,0.163425,10340,464,142,12607,2309,543,19508,153,6886,0


Converting to forward existential form...Done !
original formula: AG(((EF(AX(((i4.i1.u26.p166==0)&&(i3.u9.p50==1)))) + EG(((i4.i1.u33.p125==0)||(i8.u24.p113==1)))) + EG((((i3.u29.p150==0)||(i0.u0.p3==1))...206
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(EG((((i3.u29.p150==0)||(i0.u0.p3==1)) * !((E(!((i7.u43.p220==0)) U (!(!(EX(!((i5.i0.u15....345
Reverse transition relation is NOT exact ! Due to transitions t23, t65, t94, t104, t107, t120, t175, t199, t200, t201, t204, t205, t207, i0.u0.t90, i1.i0.t...444
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found 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
(forward)formula 0,1,2.14893,88748,1,0,129999,2550,3167,436444,844,7865,233556
FORMULA FireWire-PT-15-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 210/210 places, 329/329 transitions.
Graph (trivial) has 146 edges and 210 vertex of which 12 / 210 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 200 transition count 290
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 172 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 171 transition count 288
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 60 place count 171 transition count 277
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 82 place count 160 transition count 277
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 100 place count 142 transition count 239
Iterating global reduction 3 with 18 rules applied. Total rules applied 118 place count 142 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 142 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 120 place count 142 transition count 235
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 124 place count 140 transition count 235
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 131 place count 133 transition count 226
Iterating global reduction 4 with 7 rules applied. Total rules applied 138 place count 133 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 140 place count 133 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 141 place count 132 transition count 224
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 143 place count 130 transition count 219
Iterating global reduction 6 with 2 rules applied. Total rules applied 145 place count 130 transition count 219
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 146 place count 129 transition count 218
Iterating global reduction 6 with 1 rules applied. Total rules applied 147 place count 129 transition count 218
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 148 place count 128 transition count 215
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 128 transition count 215
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 150 place count 127 transition count 214
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 127 transition count 214
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 152 place count 126 transition count 211
Iterating global reduction 6 with 1 rules applied. Total rules applied 153 place count 126 transition count 211
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 154 place count 125 transition count 210
Iterating global reduction 6 with 1 rules applied. Total rules applied 155 place count 125 transition count 210
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 156 place count 124 transition count 207
Iterating global reduction 6 with 1 rules applied. Total rules applied 157 place count 124 transition count 207
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 123 transition count 206
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 123 transition count 206
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 122 transition count 203
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 122 transition count 203
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 121 transition count 202
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 121 transition count 202
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 120 transition count 200
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 120 transition count 200
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 179 place count 113 transition count 193
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 182 place count 110 transition count 179
Iterating global reduction 6 with 3 rules applied. Total rules applied 185 place count 110 transition count 179
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 6 with 2 rules applied. Total rules applied 187 place count 109 transition count 178
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 191 place count 109 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 108 transition count 177
Applied a total of 192 rules in 66 ms. Remains 108 /210 variables (removed 102) and now considering 177/329 (removed 152) transitions.
[2024-06-02 22:35:16] [INFO ] Flow matrix only has 174 transitions (discarded 3 similar events)
// Phase 1: matrix 174 rows 108 cols
[2024-06-02 22:35:16] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:35:16] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-02 22:35:16] [INFO ] Flow matrix only has 174 transitions (discarded 3 similar events)
[2024-06-02 22:35:16] [INFO ] Invariant cache hit.
[2024-06-02 22:35:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:35:16] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-06-02 22:35:16] [INFO ] Redundant transitions in 1 ms returned []
Running 172 sub problems to find dead transitions.
[2024-06-02 22:35:16] [INFO ] Flow matrix only has 174 transitions (discarded 3 similar events)
[2024-06-02 22:35:16] [INFO ] Invariant cache hit.
[2024-06-02 22:35:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 22:35:17] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-06-02 22:35:17] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:35:17] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:35:17] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:35:17] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-06-02 22:35:17] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 173/278 variables, 105/115 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 1/116 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/116 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 3/281 variables, 3/119 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/119 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 0/281 variables, 0/119 constraints. Problems are: Problem set: 15 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/282 variables, and 119 constraints, problems are : Problem set: 15 solved, 157 unsolved in 4373 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 15 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 157 unsolved
[2024-06-02 22:35:21] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/11 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 173/278 variables, 105/116 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 1/117 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 147/264 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/264 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 3/281 variables, 3/267 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 10/277 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 0/277 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/281 variables, 0/277 constraints. Problems are: Problem set: 15 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/282 variables, and 277 constraints, problems are : Problem set: 15 solved, 157 unsolved in 8000 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 157/172 constraints, Known Traps: 7/7 constraints]
After SMT, in 12404ms problems are : Problem set: 15 solved, 157 unsolved
Search for dead transitions found 15 dead transitions in 12406ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 108/210 places, 162/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 161
Applied a total of 2 rules in 4 ms. Remains 107 /108 variables (removed 1) and now considering 161/162 (removed 1) transitions.
[2024-06-02 22:35:29] [INFO ] Flow matrix only has 158 transitions (discarded 3 similar events)
// Phase 1: matrix 158 rows 107 cols
[2024-06-02 22:35:29] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:35:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:35:29] [INFO ] Flow matrix only has 158 transitions (discarded 3 similar events)
[2024-06-02 22:35:29] [INFO ] Invariant cache hit.
[2024-06-02 22:35:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:35:29] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 107/210 places, 161/329 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 13018 ms. Remains : 107/210 places, 161/329 transitions.
[2024-06-02 22:35:29] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:35:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:35:29] [INFO ] Input system was already deterministic with 161 transitions.
[2024-06-02 22:35:29] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:35:29] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:35:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality2177134520531208153.gal : 2 ms
[2024-06-02 22:35:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality1536535392964430337.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/CTLCardinality2177134520531208153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1536535392964430337.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,160998,0.304404,15836,2,2411,5,44139,6,0,582,48709,0


Converting to forward existential form...Done !
original formula: (EG(AG((((p193==1)&&(p64==1))&&(p116==0)))) + EF((((p15==0)||(p69==1))&&(p124==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(E(TRUE U !((((p193==1)&&(p64==1))&&(p116==0))))))] != FALSE + [(FwdU(Init,TRUE) * (((p15==0)||(p69...184
Reverse transition relation is NOT exact ! Due to transitions t12, t22, t34, t39, t44, t46, t53, t54, t92, t93, t101, t115, t118, t143, t147, t148, t149, t...278
(forward)formula 0,1,0.987013,36304,1,0,284,166512,347,141,4109,122917,334
FORMULA FireWire-PT-15-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 210/210 places, 329/329 transitions.
Graph (trivial) has 146 edges and 210 vertex of which 12 / 210 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 565 edges and 201 vertex of which 199 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 198 transition count 291
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 171 transition count 290
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 57 place count 171 transition count 279
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 79 place count 160 transition count 279
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 95 place count 144 transition count 252
Iterating global reduction 2 with 16 rules applied. Total rules applied 111 place count 144 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 144 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 112 place count 144 transition count 249
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 142 transition count 249
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 123 place count 135 transition count 240
Iterating global reduction 3 with 7 rules applied. Total rules applied 130 place count 135 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 135 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 133 place count 134 transition count 238
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 135 place count 132 transition count 233
Iterating global reduction 5 with 2 rules applied. Total rules applied 137 place count 132 transition count 233
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 131 transition count 232
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 131 transition count 232
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 130 transition count 229
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 130 transition count 229
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 129 transition count 228
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 129 transition count 228
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 128 transition count 225
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 128 transition count 225
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 127 transition count 224
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 127 transition count 224
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 126 transition count 221
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 126 transition count 221
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 150 place count 125 transition count 220
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 125 transition count 220
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 152 place count 124 transition count 217
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 124 transition count 217
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 123 transition count 216
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 123 transition count 216
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 171 place count 115 transition count 208
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 172 place count 114 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 114 transition count 206
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 5 with 2 rules applied. Total rules applied 175 place count 113 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 112 transition count 204
Applied a total of 176 rules in 34 ms. Remains 112 /210 variables (removed 98) and now considering 204/329 (removed 125) transitions.
[2024-06-02 22:35:30] [INFO ] Flow matrix only has 201 transitions (discarded 3 similar events)
// Phase 1: matrix 201 rows 112 cols
[2024-06-02 22:35:30] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:35:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 22:35:30] [INFO ] Flow matrix only has 201 transitions (discarded 3 similar events)
[2024-06-02 22:35:30] [INFO ] Invariant cache hit.
[2024-06-02 22:35:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:35:30] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-06-02 22:35:30] [INFO ] Redundant transitions in 1 ms returned []
Running 199 sub problems to find dead transitions.
[2024-06-02 22:35:30] [INFO ] Flow matrix only has 201 transitions (discarded 3 similar events)
[2024-06-02 22:35:30] [INFO ] Invariant cache hit.
[2024-06-02 22:35:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 0 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 8/12 constraints. Problems are: Problem set: 16 solved, 183 unsolved
[2024-06-02 22:35:32] [INFO ] Deduced a trap composed of 68 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/13 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/13 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 200/311 variables, 111/124 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 1/125 constraints. Problems are: Problem set: 16 solved, 183 unsolved
[2024-06-02 22:35:33] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:35:33] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 2/127 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 1/312 variables, 1/128 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/128 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 0/312 variables, 0/128 constraints. Problems are: Problem set: 16 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/313 variables, and 128 constraints, problems are : Problem set: 16 solved, 183 unsolved in 7390 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 16 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 11/15 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 200/311 variables, 111/126 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 1/127 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 183/310 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/310 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 1/312 variables, 1/311 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/311 constraints. Problems are: Problem set: 16 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/312 variables, 0/311 constraints. Problems are: Problem set: 16 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/313 variables, and 311 constraints, problems are : Problem set: 16 solved, 183 unsolved in 8230 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 183/199 constraints, Known Traps: 11/11 constraints]
After SMT, in 15663ms problems are : Problem set: 16 solved, 183 unsolved
Search for dead transitions found 16 dead transitions in 15666ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 112/210 places, 188/329 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-06-02 22:35:46] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 15880 ms. Remains : 112/210 places, 188/329 transitions.
[2024-06-02 22:35:46] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:35:46] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:35:46] [INFO ] Input system was already deterministic with 188 transitions.
[2024-06-02 22:35:46] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:35:46] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:35:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality10054573848574968996.gal : 1 ms
[2024-06-02 22:35:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality1080663548956382967.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/CTLCardinality10054573848574968996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1080663548956382967.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,142563,0.374051,19196,2,2611,5,47637,6,0,634,58671,0


Converting to forward existential form...Done !
original formula: (EF(((EG(!(E(((p9==0)||(p238==1)) U (p73==1)))) * EG(((p43==0)||(p35==1)))) + (p89==1))) + A((p180==0) U (p210==1)))
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * EG(!(E(((p9==0)||(p238==1)) U (p73==1))))),((p43==0)||(p35==1)))] != FALSE + [(FwdU(I...285
Reverse transition relation is NOT exact ! Due to transitions t6, t24, t27, t30, t32, t36, t41, t43, t46, t47, t53, t54, t56, t62, t64, t124, t125, t133, t...308
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 166/0/22
(forward)formula 0,1,5.23184,185568,1,0,516,1.19684e+06,408,292,4837,983831,567
FORMULA FireWire-PT-15-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 210/210 places, 329/329 transitions.
Graph (trivial) has 152 edges and 210 vertex of which 12 / 210 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 565 edges and 201 vertex of which 199 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 198 transition count 288
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 168 transition count 287
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 63 place count 168 transition count 276
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 85 place count 157 transition count 276
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 104 place count 138 transition count 237
Iterating global reduction 2 with 19 rules applied. Total rules applied 123 place count 138 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 125 place count 138 transition count 235
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 125 place count 138 transition count 233
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 136 transition count 233
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 137 place count 128 transition count 223
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 128 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 147 place count 128 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 148 place count 127 transition count 221
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 150 place count 125 transition count 216
Iterating global reduction 5 with 2 rules applied. Total rules applied 152 place count 125 transition count 216
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 153 place count 124 transition count 215
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 124 transition count 215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 123 transition count 212
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 123 transition count 212
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 157 place count 122 transition count 211
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 122 transition count 211
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 121 transition count 208
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 121 transition count 208
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 161 place count 120 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 120 transition count 207
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 163 place count 119 transition count 204
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 119 transition count 204
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 165 place count 118 transition count 203
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 118 transition count 203
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 167 place count 117 transition count 200
Iterating global reduction 5 with 1 rules applied. Total rules applied 168 place count 117 transition count 200
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 169 place count 116 transition count 199
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 116 transition count 199
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 171 place count 115 transition count 197
Iterating global reduction 5 with 1 rules applied. Total rules applied 172 place count 115 transition count 197
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 188 place count 107 transition count 189
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 191 place count 104 transition count 175
Iterating global reduction 5 with 3 rules applied. Total rules applied 194 place count 104 transition count 175
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 5 with 2 rules applied. Total rules applied 196 place count 103 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 102 transition count 173
Applied a total of 197 rules in 23 ms. Remains 102 /210 variables (removed 108) and now considering 173/329 (removed 156) transitions.
[2024-06-02 22:35:51] [INFO ] Flow matrix only has 170 transitions (discarded 3 similar events)
// Phase 1: matrix 170 rows 102 cols
[2024-06-02 22:35:51] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:35:51] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:35:51] [INFO ] Flow matrix only has 170 transitions (discarded 3 similar events)
[2024-06-02 22:35:51] [INFO ] Invariant cache hit.
[2024-06-02 22:35:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:35:51] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-06-02 22:35:51] [INFO ] Redundant transitions in 0 ms returned []
Running 168 sub problems to find dead transitions.
[2024-06-02 22:35:51] [INFO ] Flow matrix only has 170 transitions (discarded 3 similar events)
[2024-06-02 22:35:51] [INFO ] Invariant cache hit.
[2024-06-02 22:35:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 0 ms to minimize.
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 169/270 variables, 101/112 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/113 constraints. Problems are: Problem set: 15 solved, 153 unsolved
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/114 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/114 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/115 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/115 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/115 constraints. Problems are: Problem set: 15 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/272 variables, and 115 constraints, problems are : Problem set: 15 solved, 153 unsolved in 5682 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 15 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 169/270 variables, 101/113 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/114 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 153/267 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/267 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/268 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/268 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/268 constraints. Problems are: Problem set: 15 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/272 variables, and 268 constraints, problems are : Problem set: 15 solved, 153 unsolved in 6773 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 153/168 constraints, Known Traps: 8/8 constraints]
After SMT, in 12486ms problems are : Problem set: 15 solved, 153 unsolved
Search for dead transitions found 15 dead transitions in 12489ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 102/210 places, 158/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 157
Applied a total of 2 rules in 6 ms. Remains 101 /102 variables (removed 1) and now considering 157/158 (removed 1) transitions.
[2024-06-02 22:36:04] [INFO ] Flow matrix only has 154 transitions (discarded 3 similar events)
// Phase 1: matrix 154 rows 101 cols
[2024-06-02 22:36:04] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:36:04] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 22:36:04] [INFO ] Flow matrix only has 154 transitions (discarded 3 similar events)
[2024-06-02 22:36:04] [INFO ] Invariant cache hit.
[2024-06-02 22:36:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:36:04] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 101/210 places, 157/329 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 12825 ms. Remains : 101/210 places, 157/329 transitions.
[2024-06-02 22:36:04] [INFO ] Flatten gal took : 3 ms
[2024-06-02 22:36:04] [INFO ] Flatten gal took : 3 ms
[2024-06-02 22:36:04] [INFO ] Input system was already deterministic with 157 transitions.
[2024-06-02 22:36:04] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:36:04] [INFO ] Flatten gal took : 3 ms
[2024-06-02 22:36:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality4997656147129867357.gal : 1 ms
[2024-06-02 22:36:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality14581036734591282032.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/CTLCardinality4997656147129867357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14581036734591282032.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,93570,0.222391,13160,2,1949,5,33504,6,0,559,38472,0


Converting to forward existential form...Done !
original formula: EF(AG((AG(((p16==0)&&(p130==1))) * ((p32==1)||(p12==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !(((p16==0)&&(p130==1))))) * ((p32==1)||(p12==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t28, t30, t34, t39, t41, t47, t49, t56, t57, t94, t102, t114, t118, t143, t146, t147, t1...277
(forward)formula 0,1,0.864305,33144,1,0,277,156968,333,137,3888,107909,322
FORMULA FireWire-PT-15-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 329/329 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 329
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 34 place count 176 transition count 277
Iterating global reduction 1 with 32 rules applied. Total rules applied 66 place count 176 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 176 transition count 276
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 79 place count 164 transition count 251
Iterating global reduction 2 with 12 rules applied. Total rules applied 91 place count 164 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 164 transition count 250
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 162 transition count 245
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 162 transition count 245
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 161 transition count 244
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 161 transition count 244
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 160 transition count 241
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 160 transition count 241
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 159 transition count 240
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 159 transition count 240
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 158 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 158 transition count 237
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 157 transition count 236
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 157 transition count 236
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 156 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 156 transition count 233
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 155 transition count 232
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 155 transition count 232
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 154 transition count 229
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 154 transition count 229
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 153 transition count 228
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 153 transition count 228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 152 transition count 226
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 152 transition count 226
Applied a total of 116 rules in 18 ms. Remains 152 /210 variables (removed 58) and now considering 226/329 (removed 103) transitions.
// Phase 1: matrix 226 rows 152 cols
[2024-06-02 22:36:05] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:36:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 22:36:05] [INFO ] Invariant cache hit.
[2024-06-02 22:36:05] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-06-02 22:36:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 22:36:06] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 75 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 75 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 0 ms to minimize.
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:36:07] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
[2024-06-02 22:36:08] [INFO ] Deduced a trap composed of 80 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 210 unsolved
[2024-06-02 22:36:08] [INFO ] Deduced a trap composed of 87 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:36:08] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 2/18 constraints. Problems are: Problem set: 15 solved, 210 unsolved
[2024-06-02 22:36:09] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 2 ms to minimize.
[2024-06-02 22:36:09] [INFO ] Deduced a trap composed of 92 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:36:10] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 3/21 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 226/378 variables, 152/173 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/173 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/378 variables, 0/173 constraints. Problems are: Problem set: 15 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 173 constraints, problems are : Problem set: 15 solved, 210 unsolved in 8796 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 15 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 17/21 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 226/378 variables, 152/173 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 210/383 constraints. Problems are: Problem set: 15 solved, 210 unsolved
[2024-06-02 22:36:17] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 2 ms to minimize.
[2024-06-02 22:36:19] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 2/385 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/385 constraints. Problems are: Problem set: 15 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/378 variables, 0/385 constraints. Problems are: Problem set: 15 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 385 constraints, problems are : Problem set: 15 solved, 210 unsolved in 15195 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 210/225 constraints, Known Traps: 19/19 constraints]
After SMT, in 24025ms problems are : Problem set: 15 solved, 210 unsolved
Search for dead transitions found 15 dead transitions in 24028ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 152/210 places, 211/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 151 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 151 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 150 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 150 transition count 209
Applied a total of 4 rules in 7 ms. Remains 150 /152 variables (removed 2) and now considering 209/211 (removed 2) transitions.
// Phase 1: matrix 209 rows 150 cols
[2024-06-02 22:36:29] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:36:29] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 22:36:29] [INFO ] Invariant cache hit.
[2024-06-02 22:36:29] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/210 places, 209/329 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24396 ms. Remains : 150/210 places, 209/329 transitions.
[2024-06-02 22:36:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:36:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:36:29] [INFO ] Input system was already deterministic with 209 transitions.
[2024-06-02 22:36:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:36:29] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:36:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality16418225453110977615.gal : 1 ms
[2024-06-02 22:36:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality3125893627632773167.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/CTLCardinality16418225453110977615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3125893627632773167.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,529334,1.15322,43736,2,5231,5,117899,6,0,810,173079,0


Converting to forward existential form...Done !
original formula: EG(AX(EX(((p130==0)&&(p90==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX(((p130==0)&&(p90==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t35, t47, t51, t55, t58, t62, t70, t78, t82, t83, t98, t101, t103, t112, t114, t169, t192...311
(forward)formula 0,1,19.9467,547608,1,0,1102,1.96399e+06,439,706,5169,3.43909e+06,951
FORMULA FireWire-PT-15-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 210/210 places, 329/329 transitions.
Graph (trivial) has 154 edges and 210 vertex of which 12 / 210 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 565 edges and 201 vertex of which 199 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 198 transition count 286
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 166 transition count 285
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 166 transition count 274
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 89 place count 155 transition count 274
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 107 place count 137 transition count 236
Iterating global reduction 2 with 18 rules applied. Total rules applied 125 place count 137 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 137 transition count 234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 127 place count 137 transition count 232
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 135 transition count 232
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 137 place count 129 transition count 224
Iterating global reduction 3 with 6 rules applied. Total rules applied 143 place count 129 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 145 place count 129 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 146 place count 128 transition count 222
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 127 transition count 219
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 127 transition count 219
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 126 transition count 218
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 126 transition count 218
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 125 transition count 215
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 125 transition count 215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 153 place count 124 transition count 214
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 124 transition count 214
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 123 transition count 211
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 123 transition count 211
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 157 place count 122 transition count 210
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 122 transition count 210
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 121 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 121 transition count 207
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 161 place count 120 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 120 transition count 206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 163 place count 119 transition count 203
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 119 transition count 203
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 165 place count 118 transition count 202
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 118 transition count 202
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 167 place count 117 transition count 200
Iterating global reduction 5 with 1 rules applied. Total rules applied 168 place count 117 transition count 200
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 184 place count 109 transition count 192
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 187 place count 106 transition count 178
Iterating global reduction 5 with 3 rules applied. Total rules applied 190 place count 106 transition count 178
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 5 with 2 rules applied. Total rules applied 192 place count 105 transition count 177
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 105 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 104 transition count 176
Applied a total of 194 rules in 44 ms. Remains 104 /210 variables (removed 106) and now considering 176/329 (removed 153) transitions.
[2024-06-02 22:36:50] [INFO ] Flow matrix only has 173 transitions (discarded 3 similar events)
// Phase 1: matrix 173 rows 104 cols
[2024-06-02 22:36:50] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:36:50] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 22:36:50] [INFO ] Flow matrix only has 173 transitions (discarded 3 similar events)
[2024-06-02 22:36:50] [INFO ] Invariant cache hit.
[2024-06-02 22:36:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:36:50] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-06-02 22:36:50] [INFO ] Redundant transitions in 0 ms returned []
Running 171 sub problems to find dead transitions.
[2024-06-02 22:36:50] [INFO ] Flow matrix only has 173 transitions (discarded 3 similar events)
[2024-06-02 22:36:50] [INFO ] Invariant cache hit.
[2024-06-02 22:36:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 22:36:50] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:36:50] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:36:50] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:36:50] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:36:51] [INFO ] Deduced a trap composed of 58 places in 33 ms of which 0 ms to minimize.
[2024-06-02 22:36:51] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-02 22:36:51] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
[2024-06-02 22:36:51] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 0 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 156 unsolved
[2024-06-02 22:36:51] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/13 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 172/275 variables, 103/116 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 1/117 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/117 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 1/276 variables, 1/118 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/118 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/118 constraints. Problems are: Problem set: 15 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/277 variables, and 118 constraints, problems are : Problem set: 15 solved, 156 unsolved in 5407 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 15 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 172/275 variables, 103/116 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 1/117 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 156/273 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/273 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 1/276 variables, 1/274 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/274 constraints. Problems are: Problem set: 15 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/274 constraints. Problems are: Problem set: 15 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/277 variables, and 274 constraints, problems are : Problem set: 15 solved, 156 unsolved in 6119 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 156/171 constraints, Known Traps: 9/9 constraints]
After SMT, in 11556ms problems are : Problem set: 15 solved, 156 unsolved
Search for dead transitions found 15 dead transitions in 11558ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 104/210 places, 161/329 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 160
Applied a total of 2 rules in 7 ms. Remains 103 /104 variables (removed 1) and now considering 160/161 (removed 1) transitions.
[2024-06-02 22:37:01] [INFO ] Flow matrix only has 157 transitions (discarded 3 similar events)
// Phase 1: matrix 157 rows 103 cols
[2024-06-02 22:37:01] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:37:01] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 22:37:01] [INFO ] Flow matrix only has 157 transitions (discarded 3 similar events)
[2024-06-02 22:37:01] [INFO ] Invariant cache hit.
[2024-06-02 22:37:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:37:01] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 103/210 places, 160/329 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 11919 ms. Remains : 103/210 places, 160/329 transitions.
[2024-06-02 22:37:01] [INFO ] Flatten gal took : 3 ms
[2024-06-02 22:37:01] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:37:01] [INFO ] Input system was already deterministic with 160 transitions.
[2024-06-02 22:37:02] [INFO ] Flatten gal took : 3 ms
[2024-06-02 22:37:02] [INFO ] Flatten gal took : 3 ms
[2024-06-02 22:37:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality5360975410822800468.gal : 1 ms
[2024-06-02 22:37:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality14393798753404045080.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/CTLCardinality5360975410822800468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14393798753404045080.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,88387,0.318178,12128,2,1965,5,28759,6,0,570,31197,0


Converting to forward existential form...Done !
original formula: AG((EF((p191==1)) + ((p214==1) * EF((p37==0)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p214==1) * E(TRUE U (p37==0))))) * !(E(TRUE U (p191==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t14, t24, t30, t32, t36, t41, t43, t44, t48, t50, t56, t57, t95, t103, t115, t120, t144, t147...293
(forward)formula 0,0,3.21264,94648,1,0,399,557015,339,198,3922,332589,467
FORMULA FireWire-PT-15-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-02 22:37:05] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:37:05] [INFO ] Flatten gal took : 7 ms
Total runtime 433919 ms.

BK_STOP 1717367825312

--------------------
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-15"
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-15, 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-171734899000281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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