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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 86K 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-03-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-03-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717359345172

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 20:15:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:15:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:15:46] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 20:15:46] [INFO ] Transformed 112 places.
[2024-06-02 20:15:46] [INFO ] Transformed 356 transitions.
[2024-06-02 20:15:46] [INFO ] Found NUPN structural information;
[2024-06-02 20:15:46] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 66 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 303/303 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 112 transition count 297
Applied a total of 6 rules in 22 ms. Remains 112 /112 variables (removed 0) and now considering 297/303 (removed 6) transitions.
[2024-06-02 20:15:46] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
// Phase 1: matrix 271 rows 112 cols
[2024-06-02 20:15:46] [INFO ] Computed 9 invariants in 17 ms
[2024-06-02 20:15:46] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-06-02 20:15:46] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 20:15:46] [INFO ] Invariant cache hit.
[2024-06-02 20:15:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:15:46] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-06-02 20:15:46] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 20:15:46] [INFO ] Invariant cache hit.
[2024-06-02 20:15:47] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-02 20:15:49] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 6 ms to minimize.
[2024-06-02 20:15:49] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:15:49] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:15:49] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:15:49] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:15:50] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:15:50] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:15:50] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 282 constraints, problems are : Problem set: 0 solved, 296 unsolved in 12902 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 296/577 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 578 constraints, problems are : Problem set: 0 solved, 296 unsolved in 18955 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints]
After SMT, in 32137ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 32170ms
Starting structural reductions in LTL mode, iteration 1 : 112/112 places, 297/303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32624 ms. Remains : 112/112 places, 297/303 transitions.
Support contains 66 out of 112 places after structural reductions.
[2024-06-02 20:16:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 20:16:19] [INFO ] Flatten gal took : 45 ms
[2024-06-02 20:16:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-03-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:16:19] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:16:19] [INFO ] Input system was already deterministic with 297 transitions.
Support contains 64 out of 112 places (down from 66) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 51 to 50
RANDOM walk for 40000 steps (2046 resets) in 2379 ms. (16 steps per ms) remains 23/50 properties
BEST_FIRST walk for 4004 steps (47 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (47 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (52 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (57 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (61 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (59 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (37 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (40 resets) in 23 ms. (166 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4003 steps (57 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (48 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (46 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (51 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (50 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (55 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (40 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (47 resets) in 23 ms. (166 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (52 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (54 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (54 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (42 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
[2024-06-02 20:16:20] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 20:16:20] [INFO ] Invariant cache hit.
[2024-06-02 20:16:20] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 2 (OVERLAPS) 78/110 variables, 8/40 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 78/118 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-02 20:16:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:16:20] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:16:20] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:16:20] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2024-06-02 20:16:20] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 5/123 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 2/112 variables, 1/124 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 2/126 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 270/382 variables, 112/238 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 40/278 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 1/383 variables, 1/279 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/383 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 279 constraints, problems are : Problem set: 1 solved, 19 unsolved in 864 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 80/110 variables, 8/38 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 80/118 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 5/123 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 2/112 variables, 1/124 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 2/126 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-02 20:16:21] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 1/127 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 270/382 variables, 112/239 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 40/279 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 19/298 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 1/383 variables, 1/299 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 0/383 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 299 constraints, problems are : Problem set: 1 solved, 19 unsolved in 1280 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 19/20 constraints, Known Traps: 6/6 constraints]
After SMT, in 2172ms problems are : Problem set: 1 solved, 19 unsolved
Parikh walk visited 0 properties in 1696 ms.
Support contains 30 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 297/297 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 110 transition count 289
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 110 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 109 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 107 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 107 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 107 transition count 284
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 107 transition count 286
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 106 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 106 transition count 282
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 106 transition count 282
Applied a total of 29 rules in 73 ms. Remains 106 /112 variables (removed 6) and now considering 282/297 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 106/112 places, 282/297 transitions.
RANDOM walk for 40000 steps (2162 resets) in 589 ms. (67 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4002 steps (42 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (66 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (43 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (40 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (45 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (45 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (52 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (53 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (54 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (59 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (62 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (47 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (56 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (39 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (51 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (56 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (58 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 286207 steps, run visited all 18 properties in 629 ms. (steps per millisecond=455 )
Probabilistic random walk after 286207 steps, saw 57441 distinct states, run finished after 632 ms. (steps per millisecond=452 ) properties seen :18
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-06-02 20:16:25] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:16:25] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:16:25] [INFO ] Input system was already deterministic with 297 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 7 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:16:25] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:16:25] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 20:16:25] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 20:16:25] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:16:25] [INFO ] Invariant cache hit.
[2024-06-02 20:16:25] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:16:25] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:16:25] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:16:25] [INFO ] Invariant cache hit.
[2024-06-02 20:16:25] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:16:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:16:27] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-02 20:16:27] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:16:27] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:16:27] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:16:27] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:16:27] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:16:27] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:16:28] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:16:28] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11829 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:16:38] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20110 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 32107ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32111ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32305 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 20:16:57] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:16:57] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:16:57] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:16:57] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:16:57] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:16:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality1057456634351210625.gal : 7 ms
[2024-06-02 20:16:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality9870714936190790550.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1057456634351210625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9870714936190790550.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AF((EF((p19==1)) * (((p60==1)||(p31==0))||(p26==1)))) * AG((((EF((p88==1)) * EX(((p12==0)||(p58==1)))) + AX(FALSE)) + ((p40==0)||(p3==1)...159
=> equivalent forward existential formula: ([FwdG(Init,!((E(TRUE U (p19==1)) * (((p60==1)||(p31==0))||(p26==1)))))] = FALSE * [(EY(((FwdU(Init,TRUE) * !(((...251
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
(forward)formula 0,0,15.9111,385504,1,0,587,1.87437e+06,591,303,6102,1.44456e+06,673
FORMULA FireWire-PT-03-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 102 transition count 278
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 101 transition count 278
Applied a total of 20 rules in 54 ms. Remains 101 /112 variables (removed 11) and now considering 278/297 (removed 19) transitions.
[2024-06-02 20:17:14] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
// Phase 1: matrix 253 rows 101 cols
[2024-06-02 20:17:14] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:17:14] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 20:17:14] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2024-06-02 20:17:14] [INFO ] Invariant cache hit.
[2024-06-02 20:17:14] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 20:17:14] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-06-02 20:17:14] [INFO ] Redundant transitions in 13 ms returned []
Running 275 sub problems to find dead transitions.
[2024-06-02 20:17:14] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2024-06-02 20:17:14] [INFO ] Invariant cache hit.
[2024-06-02 20:17:14] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 20:17:15] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:17:15] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:17:15] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:17:15] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:17:15] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:17:15] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:17:15] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-02 20:17:16] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/117 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/354 variables, and 152 constraints, problems are : Problem set: 0 solved, 275 unsolved in 7694 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/117 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 275/427 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 20:17:25] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/354 variables, and 428 constraints, problems are : Problem set: 0 solved, 275 unsolved in 13505 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 9/9 constraints]
After SMT, in 21383ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 21387ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/112 places, 278/297 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21757 ms. Remains : 101/112 places, 278/297 transitions.
[2024-06-02 20:17:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:17:35] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:17:35] [INFO ] Input system was already deterministic with 278 transitions.
[2024-06-02 20:17:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:17:35] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:17:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality6511411451660976075.gal : 3 ms
[2024-06-02 20:17:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality13207018881055619513.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/CTLCardinality6511411451660976075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13207018881055619513.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(AF((p59==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p59==0)))] = FALSE
Hit Full ! (commute/partial/dont) 274/0/4
(forward)formula 0,0,1.38508,33972,1,0,10,141613,20,3,3899,95997,8
FORMULA FireWire-PT-03-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 102 transition count 278
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 101 transition count 278
Applied a total of 20 rules in 48 ms. Remains 101 /112 variables (removed 11) and now considering 278/297 (removed 19) transitions.
[2024-06-02 20:17:37] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2024-06-02 20:17:37] [INFO ] Invariant cache hit.
[2024-06-02 20:17:37] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 20:17:37] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2024-06-02 20:17:37] [INFO ] Invariant cache hit.
[2024-06-02 20:17:37] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 20:17:37] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-02 20:17:37] [INFO ] Redundant transitions in 4 ms returned []
Running 275 sub problems to find dead transitions.
[2024-06-02 20:17:37] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2024-06-02 20:17:37] [INFO ] Invariant cache hit.
[2024-06-02 20:17:37] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 3 ms to minimize.
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/117 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/354 variables, and 152 constraints, problems are : Problem set: 0 solved, 275 unsolved in 7463 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/117 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 275/427 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 20:17:48] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/354 variables, and 428 constraints, problems are : Problem set: 0 solved, 275 unsolved in 13607 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 9/9 constraints]
After SMT, in 21252ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 21255ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/112 places, 278/297 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21486 ms. Remains : 101/112 places, 278/297 transitions.
[2024-06-02 20:17:58] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:17:58] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:17:58] [INFO ] Input system was already deterministic with 278 transitions.
[2024-06-02 20:17:58] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:17:58] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:17:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality1018371043212587817.gal : 2 ms
[2024-06-02 20:17:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality13769815104966956833.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/CTLCardinality1018371043212587817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13769815104966956833.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(((p2==0)||(p68==1)) U (p67==1))
=> equivalent forward existential formula: [(FwdU(Init,((p2==0)||(p68==1))) * (p67==1))] != FALSE
Hit Full ! (commute/partial/dont) 237/0/41
(forward)formula 0,1,2.29036,58164,1,0,10,163728,15,1,1317,202219,4
FORMULA FireWire-PT-03-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 295
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 108 transition count 289
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 108 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 107 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 107 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 106 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 106 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 105 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 104 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 14 place count 104 transition count 282
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 103 transition count 282
Applied a total of 16 rules in 28 ms. Remains 103 /112 variables (removed 9) and now considering 282/297 (removed 15) transitions.
[2024-06-02 20:18:01] [INFO ] Flow matrix only has 257 transitions (discarded 25 similar events)
// Phase 1: matrix 257 rows 103 cols
[2024-06-02 20:18:01] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:18:01] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-02 20:18:01] [INFO ] Flow matrix only has 257 transitions (discarded 25 similar events)
[2024-06-02 20:18:01] [INFO ] Invariant cache hit.
[2024-06-02 20:18:01] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 20:18:01] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-02 20:18:01] [INFO ] Redundant transitions in 4 ms returned []
Running 279 sub problems to find dead transitions.
[2024-06-02 20:18:01] [INFO ] Flow matrix only has 257 transitions (discarded 25 similar events)
[2024-06-02 20:18:01] [INFO ] Invariant cache hit.
[2024-06-02 20:18:01] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-06-02 20:18:02] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:18:02] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-06-02 20:18:02] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:18:02] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:18:02] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:18:03] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-02 20:18:03] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:18:03] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:18:03] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:18:03] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 256/359 variables, 103/121 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 35/156 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-06-02 20:18:05] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/360 variables, and 157 constraints, problems are : Problem set: 0 solved, 279 unsolved in 9463 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 256/359 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 35/157 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 279/436 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/360 variables, and 436 constraints, problems are : Problem set: 0 solved, 279 unsolved in 9390 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 11/11 constraints]
After SMT, in 19025ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 19029ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/112 places, 282/297 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19363 ms. Remains : 103/112 places, 282/297 transitions.
[2024-06-02 20:18:20] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:18:20] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:18:20] [INFO ] Input system was already deterministic with 282 transitions.
[2024-06-02 20:18:20] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:18:20] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:18:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality2175568103676510639.gal : 2 ms
[2024-06-02 20:18:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality14344837679357299355.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/CTLCardinality2175568103676510639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14344837679357299355.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((AF((((EF((p50==1)) * (p66==0)) * (p83==1)) + E((p86==0) U !(((p86==0)||(p3==1)))))) + AG((E((p14==1) U ((p96==0)||(p1==1))) + EF((p75...164
=> equivalent forward existential formula: [((FwdU((FwdU(Init,TRUE) * !(!(EG(!((((E(TRUE U (p50==1)) * (p66==0)) * (p83==1)) + E((p86==0) U !(((p86==0)||(p...249
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, ...552
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 20:18:50] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:18:50] [INFO ] Applying decomposition
[2024-06-02 20:18:50] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17119438846888535619.txt' '-o' '/tmp/graph17119438846888535619.bin' '-w' '/tmp/graph17119438846888535619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17119438846888535619.bin' '-l' '-1' '-v' '-w' '/tmp/graph17119438846888535619.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:18:50] [INFO ] Decomposing Gal with order
[2024-06-02 20:18:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:18:50] [INFO ] Removed a total of 411 redundant transitions.
[2024-06-02 20:18:50] [INFO ] Flatten gal took : 49 ms
[2024-06-02 20:18:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 15 ms.
[2024-06-02 20:18:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality16582192810640722596.gal : 4 ms
[2024-06-02 20:18:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality8126786014750106214.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/CTLCardinality16582192810640722596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8126786014750106214.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.21934e+06,3.15596,103120,993,135,120044,1720,534,632256,88,18750,0


Converting to forward existential form...Done !
original formula: AG((AF((((EF((i3.u17.p50==1)) * (i5.u21.p66==0)) * (i6.u25.p83==1)) + E((i7.u27.p86==0) U !(((i7.u27.p86==0)||(i1.u1.p3==1)))))) + AG((E(...231
=> equivalent forward existential formula: [((FwdU((FwdU(Init,TRUE) * !(!(EG(!((((E(TRUE U (i3.u17.p50==1)) * (i5.u21.p66==0)) * (i6.u25.p83==1)) + E((i7.u...316
Reverse transition relation is NOT exact ! Due to transitions t1, t45, t48, t51, t52, t61, t66, t71, t76, t81, t95, t97, t98, t99, t100, t133, t142, t147, ...696
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,9.31442,240496,1,0,310328,4347,3422,1.30625e+06,435,23946,652097
FORMULA FireWire-PT-03-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 5 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:19:00] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:19:00] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:19:00] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 20:19:00] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:19:00] [INFO ] Invariant cache hit.
[2024-06-02 20:19:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:19:00] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:19:00] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:19:00] [INFO ] Invariant cache hit.
[2024-06-02 20:19:00] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:19:01] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:19:01] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 6 ms to minimize.
[2024-06-02 20:19:02] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:19:02] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:19:02] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:19:02] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:19:02] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:19:02] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:19:02] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:19:03] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11480 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:19:13] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 19587 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31228ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31231ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31546 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 20:19:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:19:31] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:19:31] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:19:31] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:19:31] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:19:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality16509801015042045955.gal : 4 ms
[2024-06-02 20:19:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality17418280697165514302.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/CTLCardinality16509801015042045955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17418280697165514302.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,5.45564e+06,2.34164,76368,2,4437,5,220184,6,0,710,221203,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(AX((p67==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U !(EX(!((p67==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Detected timeout of ITS tools.
[2024-06-02 20:20:01] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:20:01] [INFO ] Applying decomposition
[2024-06-02 20:20:01] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3116402819964918188.txt' '-o' '/tmp/graph3116402819964918188.bin' '-w' '/tmp/graph3116402819964918188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3116402819964918188.bin' '-l' '-1' '-v' '-w' '/tmp/graph3116402819964918188.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:20:02] [INFO ] Decomposing Gal with order
[2024-06-02 20:20:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:20:02] [INFO ] Removed a total of 414 redundant transitions.
[2024-06-02 20:20:02] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:20:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 5 ms.
[2024-06-02 20:20:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality11021665079390389872.gal : 2 ms
[2024-06-02 20:20:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality9647307413380838601.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/CTLCardinality11021665079390389872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9647307413380838601.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,15.0961,433628,1765,194,475054,3994,580,3.59567e+06,89,41374,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(AX((i3.i1.u22.p67==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U !(EX(!((i3.i1.u22.p67==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t97, t99, t100, t101, t102, t148, t153,...749
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 108 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 287
Applied a total of 8 rules in 3 ms. Remains 108 /112 variables (removed 4) and now considering 287/297 (removed 10) transitions.
[2024-06-02 20:20:32] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 108 cols
[2024-06-02 20:20:32] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:20:32] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 20:20:32] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:20:32] [INFO ] Invariant cache hit.
[2024-06-02 20:20:32] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:20:32] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 20:20:32] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:20:32] [INFO ] Invariant cache hit.
[2024-06-02 20:20:32] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 20:20:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:20:33] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:20:34] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:20:34] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:20:34] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:20:34] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:20:34] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:20:34] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:20:34] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 165 constraints, problems are : Problem set: 0 solved, 286 unsolved in 11775 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 286/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 451 constraints, problems are : Problem set: 0 solved, 286 unsolved in 14746 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 9/9 constraints]
After SMT, in 26679ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 26682ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 287/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26996 ms. Remains : 108/112 places, 287/297 transitions.
[2024-06-02 20:20:59] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:20:59] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:20:59] [INFO ] Input system was already deterministic with 287 transitions.
[2024-06-02 20:20:59] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:20:59] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:20:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality7581251217133618592.gal : 1 ms
[2024-06-02 20:20:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality12853191944179230375.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/CTLCardinality7581251217133618592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12853191944179230375.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX((AF(AX(E(((p100==0)||(p45==1)) U (p12==1)))) + ((EF(EG((p84!=0))) * ((p41==0)||(p80==1))) * ((p14==0)||(p82==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!(!(EX(!(E(((p100==0)||(p45==1)) U (p12==1)))))))))] != FALSE + [FwdG(FwdU(((EY(Init) * ((p14...222
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 283/0/4
(forward)formula 0,1,20.86,574712,1,0,645,2.88658e+06,610,345,6315,2.95633e+06,727
FORMULA FireWire-PT-03-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 102 transition count 278
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 101 transition count 278
Applied a total of 20 rules in 21 ms. Remains 101 /112 variables (removed 11) and now considering 278/297 (removed 19) transitions.
[2024-06-02 20:21:20] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
// Phase 1: matrix 253 rows 101 cols
[2024-06-02 20:21:20] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:21:20] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:21:20] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2024-06-02 20:21:20] [INFO ] Invariant cache hit.
[2024-06-02 20:21:20] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 20:21:20] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-06-02 20:21:20] [INFO ] Redundant transitions in 1 ms returned []
Running 275 sub problems to find dead transitions.
[2024-06-02 20:21:20] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2024-06-02 20:21:20] [INFO ] Invariant cache hit.
[2024-06-02 20:21:20] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 20:21:21] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:21:21] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 1 ms to minimize.
[2024-06-02 20:21:21] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:21:21] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:21:21] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:21:21] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:21:21] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-02 20:21:22] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/117 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/354 variables, and 152 constraints, problems are : Problem set: 0 solved, 275 unsolved in 7750 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/117 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 275/427 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 20:21:31] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/354 variables, and 428 constraints, problems are : Problem set: 0 solved, 275 unsolved in 13373 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 9/9 constraints]
After SMT, in 21262ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 21265ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/112 places, 278/297 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21504 ms. Remains : 101/112 places, 278/297 transitions.
[2024-06-02 20:21:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:21:41] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:21:41] [INFO ] Input system was already deterministic with 278 transitions.
[2024-06-02 20:21:41] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:21:41] [INFO ] Flatten gal took : 6 ms
RANDOM walk for 40000 steps (2487 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
[2024-06-02 20:21:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9555023373327390146.gal : 26 ms
[2024-06-02 20:21:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5523219075589310215.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9555023373327390146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5523219075589310215.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (658 resets) in 42 ms. (930 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Finished probabilistic random walk after 4308 steps, run visited all 1 properties in 10 ms. (steps per millisecond=430 )
Probabilistic random walk after 4308 steps, saw 1986 distinct states, run finished after 10 ms. (steps per millisecond=430 ) properties seen :1
FORMULA FireWire-PT-03-CTLCardinality-2024-07 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 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 108 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 287
Applied a total of 8 rules in 2 ms. Remains 108 /112 variables (removed 4) and now considering 287/297 (removed 10) transitions.
[2024-06-02 20:21:41] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 108 cols
[2024-06-02 20:21:41] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:21:41] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 20:21:41] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:21:41] [INFO ] Invariant cache hit.
[2024-06-02 20:21:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:21:42] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 20:21:42] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:21:42] [INFO ] Invariant cache hit.
[2024-06-02 20:21:42] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 20:21:43] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-02 20:21:43] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:21:43] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:21:43] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:21:43] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-06-02 20:21:43] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:21:43] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:21:44] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:21:44] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 20:21:49] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 166 constraints, problems are : Problem set: 0 solved, 286 unsolved in 12992 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/127 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 286/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 452 constraints, problems are : Problem set: 0 solved, 286 unsolved in 18217 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 31357ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 31363ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 287/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31688 ms. Remains : 108/112 places, 287/297 transitions.
[2024-06-02 20:22:13] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:22:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:22:13] [INFO ] Input system was already deterministic with 287 transitions.
[2024-06-02 20:22:13] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:22:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:22:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality7761318085375396881.gal : 2 ms
[2024-06-02 20:22:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality13838186591884334498.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/CTLCardinality7761318085375396881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13838186591884334498.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: ((E(((p91==0) * !(A(AG(((p91==0)||(p109==1))) U EX(((p89==0)||(p87==1)))))) U AG(E(EX((p15==1)) U ((AX(((p91==0)||(p86==1))) + (p99==0)) ...247
=> equivalent forward existential formula: ([((Init * !((E(((p91==0) * !(!((E(!(EX(((p89==0)||(p87==1)))) U (!(!(E(TRUE U !(((p91==0)||(p109==1)))))) * !(E...1099
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,15.254,416664,1,0,914,2.25002e+06,634,511,6202,1.95853e+06,996
FORMULA FireWire-PT-03-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 292
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 290
Applied a total of 6 rules in 7 ms. Remains 109 /112 variables (removed 3) and now considering 290/297 (removed 7) transitions.
[2024-06-02 20:22:28] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
// Phase 1: matrix 264 rows 109 cols
[2024-06-02 20:22:28] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:22:29] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:22:29] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 20:22:29] [INFO ] Invariant cache hit.
[2024-06-02 20:22:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:22:29] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-06-02 20:22:29] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 20:22:29] [INFO ] Invariant cache hit.
[2024-06-02 20:22:29] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:22:31] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-02 20:22:31] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:22:31] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 0/373 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 166 constraints, problems are : Problem set: 0 solved, 289 unsolved in 11740 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 289/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 455 constraints, problems are : Problem set: 0 solved, 289 unsolved in 16191 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints]
After SMT, in 28063ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 28066ms
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 290/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28292 ms. Remains : 109/112 places, 290/297 transitions.
[2024-06-02 20:22:57] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:22:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:22:57] [INFO ] Input system was already deterministic with 290 transitions.
[2024-06-02 20:22:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:22:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:22:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality7981185082853479425.gal : 2 ms
[2024-06-02 20:22:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality6323386107038454396.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/CTLCardinality7981185082853479425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6323386107038454396.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(E((((!((p103==0)||(p10==1)))||(p100==0))||(p52==1)) U (AG((A(((p105==0)||(p12==1)) U (p102==0)) * EF((p7==1)))) + EG(((p56==0)||(p82==...162
=> equivalent forward existential formula: ([(FwdU(EY(Init),(((!((p103==0)||(p10==1)))||(p100==0))||(p52==1))) * !(E(TRUE U !((!((E(!((p102==0)) U (!(((p10...351
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...590
Detected timeout of ITS tools.
[2024-06-02 20:23:27] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:23:27] [INFO ] Applying decomposition
[2024-06-02 20:23:27] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13849308016278251487.txt' '-o' '/tmp/graph13849308016278251487.bin' '-w' '/tmp/graph13849308016278251487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13849308016278251487.bin' '-l' '-1' '-v' '-w' '/tmp/graph13849308016278251487.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:23:27] [INFO ] Decomposing Gal with order
[2024-06-02 20:23:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:23:27] [INFO ] Removed a total of 417 redundant transitions.
[2024-06-02 20:23:27] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:23:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 5 ms.
[2024-06-02 20:23:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality1724836689423153457.gal : 2 ms
[2024-06-02 20:23:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality14319359801172370866.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/CTLCardinality1724836689423153457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14319359801172370866.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.7602e+06,8.22686,279004,2345,206,235021,1784,563,2.62071e+06,97,15023,0


Converting to forward existential form...Done !
original formula: EX(E((((!((i6.i0.u33.p103==0)||(i0.u3.p10==1)))||(i0.u3.p100==0))||(i3.u15.p52==1)) U (AG((A(((i6.i1.u34.p105==0)||(i0.u3.p12==1)) U (i6....237
=> equivalent forward existential formula: ([(FwdU(EY(Init),(((!((i6.i0.u33.p103==0)||(i0.u3.p10==1)))||(i0.u3.p100==0))||(i3.u15.p52==1))) * !(E(TRUE U !(...475
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t97, t99, t100, t101, t102, t139, t148,...775
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,17.7921,423864,1,0,352864,4705,3286,3.99172e+06,486,24315,902870
FORMULA FireWire-PT-03-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 292
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 290
Applied a total of 6 rules in 6 ms. Remains 109 /112 variables (removed 3) and now considering 290/297 (removed 7) transitions.
[2024-06-02 20:23:45] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
// Phase 1: matrix 264 rows 109 cols
[2024-06-02 20:23:45] [INFO ] Computed 9 invariants in 4 ms
[2024-06-02 20:23:45] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 20:23:45] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 20:23:45] [INFO ] Invariant cache hit.
[2024-06-02 20:23:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:23:45] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-06-02 20:23:45] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 20:23:45] [INFO ] Invariant cache hit.
[2024-06-02 20:23:45] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 20:23:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:23:46] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:23:47] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:23:47] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:23:47] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:23:47] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:23:47] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:23:47] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 0/373 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 166 constraints, problems are : Problem set: 0 solved, 289 unsolved in 11642 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 289/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 455 constraints, problems are : Problem set: 0 solved, 289 unsolved in 15735 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints]
After SMT, in 27507ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 27510ms
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 290/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27738 ms. Remains : 109/112 places, 290/297 transitions.
[2024-06-02 20:24:13] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:24:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:24:13] [INFO ] Input system was already deterministic with 290 transitions.
[2024-06-02 20:24:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:24:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:24:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality14943092204004823324.gal : 1 ms
[2024-06-02 20:24:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality16816534253632613704.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/CTLCardinality14943092204004823324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16816534253632613704.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,5.7602e+06,2.24572,73208,2,4335,5,206612,6,0,723,214032,0


Converting to forward existential form...Done !
original formula: (EX((((EF((((p111==0)&&(p29==1))||(p64==0))) + AG((p71==1))) * AF((p44==1))) * ((p61==0)&&(p59==1)))) + EF(AG((((p3==1)&&((p23==0)||(p25=...186
=> equivalent forward existential formula: ([(((EY(Init) * ((p61==0)&&(p59==1))) * (E(TRUE U (((p111==0)&&(p29==1))||(p64==0))) + !(E(TRUE U !((p71==1)))))...294
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...590
Detected timeout of ITS tools.
[2024-06-02 20:24:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:24:43] [INFO ] Applying decomposition
[2024-06-02 20:24:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11890135117876580230.txt' '-o' '/tmp/graph11890135117876580230.bin' '-w' '/tmp/graph11890135117876580230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11890135117876580230.bin' '-l' '-1' '-v' '-w' '/tmp/graph11890135117876580230.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:24:43] [INFO ] Decomposing Gal with order
[2024-06-02 20:24:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:24:43] [INFO ] Removed a total of 423 redundant transitions.
[2024-06-02 20:24:43] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:24:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 5 ms.
[2024-06-02 20:24:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality9024790221433972931.gal : 3 ms
[2024-06-02 20:24:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality10969229828928700781.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/CTLCardinality9024790221433972931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10969229828928700781.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.7602e+06,6.56544,187508,1623,192,233546,1860,613,1.16874e+06,93,17971,0


Converting to forward existential form...Done !
original formula: (EX((((EF((((i6.i1.u36.p111==0)&&(i2.u9.p29==1))||(i6.i0.u21.p64==0))) + AG((i4.u23.p71==1))) * AF((i1.i1.u13.p44==1))) * ((i4.u25.p61==0...281
=> equivalent forward existential formula: ([(((EY(Init) * ((i4.u25.p61==0)&&(i1.i0.u19.p59==1))) * (E(TRUE U (((i6.i1.u36.p111==0)&&(i2.u9.p29==1))||(i6.i...389
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t97, t99, t100, t101, t102, t139, t148,...783
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,25.6669,668944,1,0,790663,5047,3203,4.94476e+06,432,29037,1060872
FORMULA FireWire-PT-03-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:25:09] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:25:09] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:25:09] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 20:25:09] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:25:09] [INFO ] Invariant cache hit.
[2024-06-02 20:25:09] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:25:09] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:25:09] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:25:09] [INFO ] Invariant cache hit.
[2024-06-02 20:25:09] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:25:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:25:10] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-06-02 20:25:10] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:25:10] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:25:10] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:25:10] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:25:11] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:25:11] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:25:11] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-02 20:25:11] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11609 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:25:21] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20403 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 32155ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32158ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32343 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 20:25:41] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:25:41] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:25:41] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:25:41] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:25:41] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:25:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality17281209352855447067.gal : 1 ms
[2024-06-02 20:25:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality4117918852410059530.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/CTLCardinality17281209352855447067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4117918852410059530.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(!(EF((((EX(TRUE) + (p9==1)) + ((p44==1)||(p91==0))) + ((p49==1)||(p80==1))))) U AX(E(EG(((p79==1)||(p65==0))) U (p86!=0))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U (((EX(TRUE) + (p9==1)) + ((p44==1)||(p91==0))) + ((p49==1)||(p80==1)))))) * !(EX(!(E(EG((...201
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Detected timeout of ITS tools.
[2024-06-02 20:26:11] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:26:11] [INFO ] Applying decomposition
[2024-06-02 20:26:11] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph137136963313910952.txt' '-o' '/tmp/graph137136963313910952.bin' '-w' '/tmp/graph137136963313910952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph137136963313910952.bin' '-l' '-1' '-v' '-w' '/tmp/graph137136963313910952.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:26:11] [INFO ] Decomposing Gal with order
[2024-06-02 20:26:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:26:11] [INFO ] Removed a total of 408 redundant transitions.
[2024-06-02 20:26:11] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:26:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 5 ms.
[2024-06-02 20:26:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality870441980548362160.gal : 2 ms
[2024-06-02 20:26:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality8902187374745687443.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/CTLCardinality870441980548362160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8902187374745687443.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,4.91132,148028,1875,205,189955,2055,556,836470,93,23117,0


Converting to forward existential form...Done !
original formula: E(!(EF((((EX(TRUE) + (i6.u32.p9==1)) + ((i1.u12.p44==1)||(i0.u29.p91==0))) + ((i3.u15.p49==1)||(i6.u25.p80==1))))) U AX(E(EG(((i6.u32.p79...202
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U (((EX(TRUE) + (i6.u32.p9==1)) + ((i1.u12.p44==1)||(i0.u29.p91==0))) + ((i3.u15.p49==1)||(...260
Reverse transition relation is NOT exact ! Due to transitions t47, t49, t50, t53, t54, t57, t62, t63, t83, t86, t97, t99, t100, t101, t102, t139, t148, t15...764
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
(forward)formula 0,1,18.796,494816,1,0,650666,9604,2924,2.97282e+06,448,66853,1002981
FORMULA FireWire-PT-03-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 2 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:26:30] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:26:30] [INFO ] Invariant cache hit.
[2024-06-02 20:26:30] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:26:30] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:26:30] [INFO ] Invariant cache hit.
[2024-06-02 20:26:30] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:26:30] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:26:30] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:26:30] [INFO ] Invariant cache hit.
[2024-06-02 20:26:30] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:26:31] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:26:31] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:26:32] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2024-06-02 20:26:32] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:26:32] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:26:32] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:26:32] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:26:32] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-02 20:26:32] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-02 20:26:32] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11396 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:26:42] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 19955 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31478ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31481ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31659 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 20:27:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:27:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:27:02] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:27:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:27:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:27:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality11509713875863246309.gal : 1 ms
[2024-06-02 20:27:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality6658080763252262624.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/CTLCardinality11509713875863246309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6658080763252262624.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(!((AG(!(EX(TRUE))) + AX((p80==1)))) U AX(!(A((p62==1) U ((p24==0)||(p59==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(!((E(!(((p24==0)||(p59==1))) U (!((p62==1)) * !(((p24==0)||(p59==1))))) + EG(!(((p24==...502
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Detected timeout of ITS tools.
[2024-06-02 20:27:32] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:27:32] [INFO ] Applying decomposition
[2024-06-02 20:27:32] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7340254167519095124.txt' '-o' '/tmp/graph7340254167519095124.bin' '-w' '/tmp/graph7340254167519095124.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7340254167519095124.bin' '-l' '-1' '-v' '-w' '/tmp/graph7340254167519095124.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:27:32] [INFO ] Decomposing Gal with order
[2024-06-02 20:27:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:27:32] [INFO ] Removed a total of 405 redundant transitions.
[2024-06-02 20:27:32] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:27:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 4 ms.
[2024-06-02 20:27:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality2773265437828741327.gal : 2 ms
[2024-06-02 20:27:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality4512446334721593367.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/CTLCardinality2773265437828741327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4512446334721593367.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,5.0298,155956,1544,176,196580,2081,603,972711,104,18990,0


Converting to forward existential form...Done !
original formula: A(!((AG(!(EX(TRUE))) + AX((i4.u25.p80==1)))) U AX(!(A((i0.u19.p62==1) U ((i2.u7.p24==0)||(i1.i0.u18.p59==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(!((E(!(((i2.u7.p24==0)||(i1.i0.u18.p59==1))) U (!((i0.u19.p62==1)) * !(((i2.u7.p24==0)...674
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t97, t99, t100, t101, t102, t139, t148,...743
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,16.4218,421244,1,0,603380,9580,3243,2.37883e+06,520,59741,967907
FORMULA FireWire-PT-03-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 108 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 287
Applied a total of 8 rules in 2 ms. Remains 108 /112 variables (removed 4) and now considering 287/297 (removed 10) transitions.
[2024-06-02 20:27:48] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 108 cols
[2024-06-02 20:27:48] [INFO ] Computed 9 invariants in 4 ms
[2024-06-02 20:27:48] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 20:27:48] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:27:48] [INFO ] Invariant cache hit.
[2024-06-02 20:27:48] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:27:49] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 20:27:49] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:27:49] [INFO ] Invariant cache hit.
[2024-06-02 20:27:49] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 20:27:50] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:27:50] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:27:50] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:27:50] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:27:50] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-02 20:27:50] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:27:50] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-06-02 20:27:51] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:27:51] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 20:27:56] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 166 constraints, problems are : Problem set: 0 solved, 286 unsolved in 13236 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/127 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 286/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 452 constraints, problems are : Problem set: 0 solved, 286 unsolved in 18730 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 32115ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 32119ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 287/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32467 ms. Remains : 108/112 places, 287/297 transitions.
[2024-06-02 20:28:21] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:28:21] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:28:21] [INFO ] Input system was already deterministic with 287 transitions.
[2024-06-02 20:28:21] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:28:21] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:28:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality2562500393670570449.gal : 2 ms
[2024-06-02 20:28:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality17922725514396983351.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/CTLCardinality2562500393670570449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17922725514396983351.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AG(AX(E((p37==1) U (p72==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(E((p37==1) U (p72==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
(forward)formula 0,1,7.69834,219856,1,0,841,1.13088e+06,596,432,6004,1.074e+06,919
FORMULA FireWire-PT-03-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 2 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:28:29] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:28:29] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:28:29] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:28:29] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:28:29] [INFO ] Invariant cache hit.
[2024-06-02 20:28:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:28:29] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:28:29] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:28:29] [INFO ] Invariant cache hit.
[2024-06-02 20:28:29] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:28:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:28:30] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:28:30] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2024-06-02 20:28:30] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:28:30] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:28:30] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-06-02 20:28:31] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:28:31] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:28:31] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 20:28:31] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11290 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:28:41] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 19648 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31063ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31066ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31258 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 20:29:00] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:29:00] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:29:00] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:29:00] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:29:00] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:29:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality9519920122955637436.gal : 1 ms
[2024-06-02 20:29:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality4228732415936120460.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/CTLCardinality9519920122955637436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4228732415936120460.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(((AX(((p89==0)||(p86==1))) * (p106==0)) * ((p38==1)&&(p26==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p38==1)&&(p26==1))) * (p106==0)) * !(EX(!(((p89==0)||(p86==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
(forward)formula 0,1,3.84127,82884,1,0,510,346207,586,263,5860,306662,576
FORMULA FireWire-PT-03-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-06-02 20:29:04] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:29:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:29:04] [INFO ] Applying decomposition
[2024-06-02 20:29:04] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14755241674071465019.txt' '-o' '/tmp/graph14755241674071465019.bin' '-w' '/tmp/graph14755241674071465019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14755241674071465019.bin' '-l' '-1' '-v' '-w' '/tmp/graph14755241674071465019.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:29:04] [INFO ] Decomposing Gal with order
[2024-06-02 20:29:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:29:04] [INFO ] Removed a total of 433 redundant transitions.
[2024-06-02 20:29:04] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:29:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 4 ms.
[2024-06-02 20:29:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality15859133134302541542.gal : 2 ms
[2024-06-02 20:29:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality15288642976700530646.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/CTLCardinality15859133134302541542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15288642976700530646.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.20421e+06,8.71129,205200,1906,211,203893,5063,625,1.30897e+06,89,45441,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(AX((i6.i0.u22.p67==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U !(EX(!((i6.i0.u22.p67==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t49, t51, t55, t56, t64, t65, t70, t75, t80, t85, t99, t101, t102, t103, t104, t141, t150...822
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,30.3391,553996,1,0,493867,9117,3060,4.36588e+06,398,57493,1023587
FORMULA FireWire-PT-03-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 828528 ms.

BK_STOP 1717360174842

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

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