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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 84K 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-01-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-01-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717357715178

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-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 19:48:36] [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 19:48:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:48:36] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 19:48:36] [INFO ] Transformed 107 places.
[2024-06-02 19:48:36] [INFO ] Transformed 346 transitions.
[2024-06-02 19:48:36] [INFO ] Found NUPN structural information;
[2024-06-02 19:48:36] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-01-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 293/293 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 106 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 290
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 8 place count 106 transition count 284
Applied a total of 8 rules in 27 ms. Remains 106 /107 variables (removed 1) and now considering 284/293 (removed 9) transitions.
[2024-06-02 19:48:36] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
// Phase 1: matrix 258 rows 106 cols
[2024-06-02 19:48:36] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 19:48:36] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-06-02 19:48:36] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 19:48:36] [INFO ] Invariant cache hit.
[2024-06-02 19:48:36] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 19:48:37] [INFO ] Implicit Places using invariants and state equation in 169 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 422 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/107 places, 284/293 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 470 ms. Remains : 105/107 places, 284/293 transitions.
Support contains 53 out of 105 places after structural reductions.
[2024-06-02 19:48:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 19:48:37] [INFO ] Flatten gal took : 46 ms
FORMULA FireWire-PT-01-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:48:37] [INFO ] Flatten gal took : 27 ms
[2024-06-02 19:48:37] [INFO ] Input system was already deterministic with 284 transitions.
Support contains 47 out of 105 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (2189 resets) in 1964 ms. (20 steps per ms) remains 15/39 properties
BEST_FIRST walk for 4002 steps (52 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (56 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (65 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (45 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (31 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (63 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (67 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (62 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (152 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (66 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (109 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (49 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (45 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (54 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
[2024-06-02 19:48:38] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
// Phase 1: matrix 258 rows 105 cols
[2024-06-02 19:48:38] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 19:48:38] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 77/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:48:38] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 256/358 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 38/148 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:48:38] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-06-02 19:48:38] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 4/362 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 1/363 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/363 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 154 constraints, problems are : Problem set: 0 solved, 15 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 77/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:48:39] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/102 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 256/358 variables, 102/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 38/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 13/164 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 4/362 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 1/363 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/363 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/363 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 170 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1107 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 4/4 constraints]
After SMT, in 2161ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 14 properties in 2533 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 284/284 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 105 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 104 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 104 transition count 279
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 103 transition count 279
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 11 place count 99 transition count 269
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 99 transition count 269
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 97 transition count 265
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 97 transition count 265
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 94 transition count 272
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 31 place count 94 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 34 place count 94 transition count 263
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 94 transition count 265
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 3 with 3 rules applied. Total rules applied 38 place count 93 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 93 transition count 261
Applied a total of 40 rules in 67 ms. Remains 93 /105 variables (removed 12) and now considering 261/284 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 93/105 places, 261/284 transitions.
RANDOM walk for 40000 steps (2373 resets) in 871 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (308 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5072 steps, run visited all 1 properties in 20 ms. (steps per millisecond=253 )
Probabilistic random walk after 5072 steps, saw 2563 distinct states, run finished after 35 ms. (steps per millisecond=144 ) properties seen :1
[2024-06-02 19:48:43] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:48:43] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:48:43] [INFO ] Input system was already deterministic with 284 transitions.
Computed a total of 6 stabilizing places and 9 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 281
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 98 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 98 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 96 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 96 transition count 267
Applied a total of 16 rules in 19 ms. Remains 96 /105 variables (removed 9) and now considering 267/284 (removed 17) transitions.
[2024-06-02 19:48:43] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
// Phase 1: matrix 241 rows 96 cols
[2024-06-02 19:48:43] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:48:43] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:48:43] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:48:43] [INFO ] Invariant cache hit.
[2024-06-02 19:48:43] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 19:48:43] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-06-02 19:48:43] [INFO ] Redundant transitions in 13 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 19:48:43] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:48:43] [INFO ] Invariant cache hit.
[2024-06-02 19:48:43] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:48:44] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:48:44] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-02 19:48:44] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:48:44] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:48:44] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-06-02 19:48:45] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/337 variables, and 144 constraints, problems are : Problem set: 0 solved, 264 unsolved in 8453 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 264/407 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:48:55] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/337 variables, and 409 constraints, problems are : Problem set: 0 solved, 264 unsolved in 15437 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints]
After SMT, in 24099ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 24106ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/105 places, 267/284 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24364 ms. Remains : 96/105 places, 267/284 transitions.
[2024-06-02 19:49:07] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:49:07] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:49:07] [INFO ] Input system was already deterministic with 267 transitions.
[2024-06-02 19:49:07] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:49:07] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:49:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality3175953486789000563.gal : 6 ms
[2024-06-02 19:49:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality6500581182968115528.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/CTLCardinality3175953486789000563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6500581182968115528.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,1.05328e+06,3.49425,106180,2,4866,5,309860,6,0,650,411969,0


Converting to forward existential form...Done !
original formula: AF((EG(AG((((p61==0)&&(p84==1))&&(p76==0)))) + AF((EF((p65==1)) * (p32==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((EG(!(E(TRUE U !((((p61==0)&&(p84==1))&&(p76==0)))))) + !(EG(!((E(TRUE U (p65==1)) * (p32==0)))))))...165
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t7, t8, t10, t15, t16, t17, t18, t19, t21, t23, t28, t29, t30, t31, t32, t34, t36...551
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 19:49:37] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:49:37] [INFO ] Applying decomposition
[2024-06-02 19:49:37] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph414383102312840539.txt' '-o' '/tmp/graph414383102312840539.bin' '-w' '/tmp/graph414383102312840539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph414383102312840539.bin' '-l' '-1' '-v' '-w' '/tmp/graph414383102312840539.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:49:37] [INFO ] Decomposing Gal with order
[2024-06-02 19:49:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:49:38] [INFO ] Removed a total of 379 redundant transitions.
[2024-06-02 19:49:38] [INFO ] Flatten gal took : 51 ms
[2024-06-02 19:49:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 9 ms.
[2024-06-02 19:49:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality9434881018408665522.gal : 3 ms
[2024-06-02 19:49:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality17568522034232461365.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/CTLCardinality9434881018408665522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17568522034232461365.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05328e+06,16.409,460496,3150,227,472756,4258,489,3.90992e+06,84,48588,0


Converting to forward existential form...Done !
original formula: AF((EG(AG((((i1.u18.p61==0)&&(i5.u26.p84==1))&&(i5.u24.p76==0)))) + AF((EF((i1.u20.p65==1)) * (i2.u7.p32==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((EG(!(E(TRUE U !((((i1.u18.p61==0)&&(i5.u26.p84==1))&&(i5.u24.p76==0)))))) + !(EG(!((E(TRUE U (i1.u...199
Reverse transition relation is NOT exact ! Due to transitions t1, t44, t46, t50, t51, t59, t60, t65, t70, t75, t80, t94, t142, t143, t144, t146, t149, t152...704
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 102 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 102 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 274
Applied a total of 8 rules in 11 ms. Remains 101 /105 variables (removed 4) and now considering 274/284 (removed 10) transitions.
[2024-06-02 19:50:08] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
// Phase 1: matrix 248 rows 101 cols
[2024-06-02 19:50:08] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:50:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 19:50:08] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
[2024-06-02 19:50:08] [INFO ] Invariant cache hit.
[2024-06-02 19:50:08] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:50:08] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2024-06-02 19:50:08] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
[2024-06-02 19:50:08] [INFO ] Invariant cache hit.
[2024-06-02 19:50:08] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-02 19:50:09] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:50:09] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:50:10] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:50:10] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
[2024-06-02 19:50:10] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-06-02 19:50:10] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-02 19:50:10] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 247/348 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 9 (OVERLAPS) 0/349 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 152 constraints, problems are : Problem set: 0 solved, 273 unsolved in 9954 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 247/348 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 273/424 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 1/349 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 10 (OVERLAPS) 0/349 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 425 constraints, problems are : Problem set: 0 solved, 273 unsolved in 14863 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 7/7 constraints]
After SMT, in 24969ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 24973ms
Starting structural reductions in LTL mode, iteration 1 : 101/105 places, 274/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25295 ms. Remains : 101/105 places, 274/284 transitions.
[2024-06-02 19:50:33] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:50:33] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:50:33] [INFO ] Input system was already deterministic with 274 transitions.
[2024-06-02 19:50:33] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:50:33] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:50:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality4373096383522594924.gal : 3 ms
[2024-06-02 19:50:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality17678289840354931133.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/CTLCardinality4373096383522594924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17678289840354931133.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: ((AX((p22==1)) + AF((((p53==0)&&(p92==1))&&(p1==0)))) + (AG((AF(((p14==0)&&(p2==1))) + EF(AX((p72==0))))) + EX((p46==1))))
=> equivalent forward existential formula: [FwdG((FwdU(((Init * !((!(EX(!((p22==1)))) + !(EG(!((((p53==0)&&(p92==1))&&(p1==0)))))))) * !(EX((p46==1)))),TRU...225
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...551
(forward)formula 0,1,3.92467,78392,1,0,487,331725,577,253,5756,302995,563
FORMULA FireWire-PT-01-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 281
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 281
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 98 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 98 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 96 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 96 transition count 267
Applied a total of 16 rules in 18 ms. Remains 96 /105 variables (removed 9) and now considering 267/284 (removed 17) transitions.
[2024-06-02 19:50:37] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
// Phase 1: matrix 241 rows 96 cols
[2024-06-02 19:50:37] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:50:37] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 19:50:37] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:50:37] [INFO ] Invariant cache hit.
[2024-06-02 19:50:37] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 19:50:37] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-06-02 19:50:37] [INFO ] Redundant transitions in 4 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 19:50:37] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:50:37] [INFO ] Invariant cache hit.
[2024-06-02 19:50:37] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/337 variables, and 144 constraints, problems are : Problem set: 0 solved, 264 unsolved in 8251 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 264/407 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:50:49] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/337 variables, and 409 constraints, problems are : Problem set: 0 solved, 264 unsolved in 15670 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints]
After SMT, in 24070ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 24074ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/105 places, 267/284 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24292 ms. Remains : 96/105 places, 267/284 transitions.
[2024-06-02 19:51:01] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:51:01] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:51:01] [INFO ] Input system was already deterministic with 267 transitions.
[2024-06-02 19:51:01] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:51:01] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:51:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality10511805452683695069.gal : 2 ms
[2024-06-02 19:51:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality2284813414888477393.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/CTLCardinality10511805452683695069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2284813414888477393.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(EF(AG(((p63==0)&&(p17==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(((p63==0)&&(p17==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t7, t8, t10, t15, t16, t17, t18, t19, t21, t23, t28, t29, t30, t31, t32, t34, t36...551
Detected timeout of ITS tools.
[2024-06-02 19:51:31] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:51:31] [INFO ] Applying decomposition
[2024-06-02 19:51:31] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8310802559070054590.txt' '-o' '/tmp/graph8310802559070054590.bin' '-w' '/tmp/graph8310802559070054590.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8310802559070054590.bin' '-l' '-1' '-v' '-w' '/tmp/graph8310802559070054590.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:51:31] [INFO ] Decomposing Gal with order
[2024-06-02 19:51:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:51:31] [INFO ] Removed a total of 388 redundant transitions.
[2024-06-02 19:51:31] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:51:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 4 ms.
[2024-06-02 19:51:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality12107996328570500275.gal : 3 ms
[2024-06-02 19:51:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality9910786970020058736.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/CTLCardinality12107996328570500275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9910786970020058736.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05328e+06,6.14862,198264,2955,187,299372,1755,488,1.02036e+06,82,17124,0


Converting to forward existential form...Done !
original formula: EG(EF(AG(((i1.u21.p63==0)&&(i1.u5.p17==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(((i1.u21.p63==0)&&(i1.u5.p17==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t44, t46, t50, t51, t59, t60, t65, t70, t75, t80, t94, t146, t149, t152, t154, t196, t203...681
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 7 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
[2024-06-02 19:52:02] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 19:52:02] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:52:02] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 19:52:02] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:52:02] [INFO ] Invariant cache hit.
[2024-06-02 19:52:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:52:02] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 19:52:02] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:52:02] [INFO ] Invariant cache hit.
[2024-06-02 19:52:02] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 19:52:03] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:52:03] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:52:03] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:52:03] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:52:03] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:52:03] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:52:04] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:52:04] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-06-02 19:52:04] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 5 ms to minimize.
[2024-06-02 19:52:04] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-02 19:52:04] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10086 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14555 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24797ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24800ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 270/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24993 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 19:52:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:52:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:52:27] [INFO ] Input system was already deterministic with 270 transitions.
[2024-06-02 19:52:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:52:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:52:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality1289364034509905136.gal : 2 ms
[2024-06-02 19:52:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality2101702920055857346.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/CTLCardinality1289364034509905136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2101702920055857346.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,1.40249e+06,1.97665,66260,2,3821,5,191696,6,0,665,194070,0


Converting to forward existential form...Done !
original formula: AF(AG(((EX(((p2==0)&&(p45==1))) + EF((p40==0))) + (((p101==0)&&(p96==1))&&(p82==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((EX(((p2==0)&&(p45==1))) + E(TRUE U (p40==0))) + (((p101==0)&&(p96==1))&&(p82==0)))))...167
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...551
Detected timeout of ITS tools.
[2024-06-02 19:52:57] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:52:57] [INFO ] Applying decomposition
[2024-06-02 19:52:57] [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/graph12522795897351612553.txt' '-o' '/tmp/graph12522795897351612553.bin' '-w' '/tmp/graph12522795897351612553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12522795897351612553.bin' '-l' '-1' '-v' '-w' '/tmp/graph12522795897351612553.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:52:57] [INFO ] Decomposing Gal with order
[2024-06-02 19:52:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:52:57] [INFO ] Removed a total of 375 redundant transitions.
[2024-06-02 19:52:57] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:52:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 5 ms.
[2024-06-02 19:52:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality11829165710558523718.gal : 2 ms
[2024-06-02 19:52:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality2082370293487614236.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/CTLCardinality11829165710558523718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2082370293487614236.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40249e+06,17.6147,445612,2783,206,522900,1932,501,3.5774e+06,93,24665,0


Converting to forward existential form...Done !
original formula: AF(AG(((EX(((i7.u0.p2==0)&&(i4.u13.p45==1))) + EF((i2.u11.p40==0))) + (((i1.u30.p101==0)&&(i2.u3.p96==1))&&(i6.u22.p82==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((EX(((i7.u0.p2==0)&&(i4.u13.p45==1))) + E(TRUE U (i2.u11.p40==0))) + (((i1.u30.p101==...207
Reverse transition relation is NOT exact ! Due to transitions t2, t45, t47, t51, t52, t60, t61, t66, t71, t76, t81, t95, t143, t144, t145, t147, t150, t153...698
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 4 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
[2024-06-02 19:53:27] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:53:27] [INFO ] Invariant cache hit.
[2024-06-02 19:53:27] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 19:53:27] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:53:27] [INFO ] Invariant cache hit.
[2024-06-02 19:53:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:53:27] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 19:53:27] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:53:27] [INFO ] Invariant cache hit.
[2024-06-02 19:53:27] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10092 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14656 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24910ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24914ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 270/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25102 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 19:53:52] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:53:52] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:53:52] [INFO ] Input system was already deterministic with 270 transitions.
[2024-06-02 19:53:52] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:53:52] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:53:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality8135825059268330730.gal : 5 ms
[2024-06-02 19:53:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality15754798149281022505.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/CTLCardinality8135825059268330730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15754798149281022505.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,2.24074,66016,1,0,6,191696,7,1,994,194070,1
FORMULA FireWire-PT-01-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 281
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 98 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 98 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 96 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 96 transition count 267
Applied a total of 16 rules in 22 ms. Remains 96 /105 variables (removed 9) and now considering 267/284 (removed 17) transitions.
[2024-06-02 19:53:54] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
// Phase 1: matrix 241 rows 96 cols
[2024-06-02 19:53:54] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:53:54] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 19:53:54] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:53:54] [INFO ] Invariant cache hit.
[2024-06-02 19:53:54] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 19:53:54] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-06-02 19:53:54] [INFO ] Redundant transitions in 4 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 19:53:54] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:53:54] [INFO ] Invariant cache hit.
[2024-06-02 19:53:54] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:53:55] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:53:55] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-02 19:53:55] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:53:55] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:53:56] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2024-06-02 19:53:56] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/337 variables, and 144 constraints, problems are : Problem set: 0 solved, 264 unsolved in 8146 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 264/407 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:54:06] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/337 variables, and 409 constraints, problems are : Problem set: 0 solved, 264 unsolved in 15675 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints]
After SMT, in 23958ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 23961ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/105 places, 267/284 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24178 ms. Remains : 96/105 places, 267/284 transitions.
[2024-06-02 19:54:18] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:54:18] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:54:18] [INFO ] Input system was already deterministic with 267 transitions.
[2024-06-02 19:54:18] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:54:18] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:54:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13606717206344271390.gal : 4 ms
[2024-06-02 19:54:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15222995064956100016.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13606717206344271390.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15222995064956100016.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15222995064956100016.prop.
RANDOM walk for 40000 steps (2621 resets) in 355 ms. (112 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
BEST_FIRST walk for 40004 steps (707 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 28
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 39
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :39 after 64
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :64 after 123
Finished probabilistic random walk after 14114 steps, run visited all 1 properties in 54 ms. (steps per millisecond=261 )
Probabilistic random walk after 14114 steps, saw 5643 distinct states, run finished after 54 ms. (steps per millisecond=261 ) properties seen :1
FORMULA FireWire-PT-01-CTLCardinality-2024-06 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 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 3 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
[2024-06-02 19:54:19] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 19:54:19] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:54:19] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 19:54:19] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:54:19] [INFO ] Invariant cache hit.
[2024-06-02 19:54:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:54:19] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 19:54:19] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:54:19] [INFO ] Invariant cache hit.
[2024-06-02 19:54:19] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 19:54:20] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:54:20] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:54:20] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:54:20] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:54:20] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:54:20] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:54:21] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-02 19:54:21] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:54:21] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:54:21] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-02 19:54:21] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 9963 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14705 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24808ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24811ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 270/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24975 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 19:54:44] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:54:44] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:54:44] [INFO ] Input system was already deterministic with 270 transitions.
[2024-06-02 19:54:44] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:54:44] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:54:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4497567085123663057.gal : 1 ms
[2024-06-02 19:54:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality7362097056031882612.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/CTLCardinality4497567085123663057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7362097056031882612.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,1.40249e+06,1.85881,66328,2,3821,5,191696,6,0,665,194070,0


Converting to forward existential form...Done !
original formula: (A(EX((p103==1)) U (EG(AG(!(((p41==0)||(p43==1))))) * !(E(((p106!=1)||(((p55==0)||(p27==1))&&((p28==0)||(p46==1)))) U (((p15==0)||(p86==1...303
=> equivalent forward existential formula: ([((Init * !(EG(!((EG(!(E(TRUE U !(!(((p41==0)||(p43==1))))))) * !(E(((p106!=1)||(((p55==0)||(p27==1))&&((p28==0...711
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...551
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,26.7961,755888,1,0,961,4.16147e+06,578,590,5781,4.18352e+06,1043
FORMULA FireWire-PT-01-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 102 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 102 transition count 277
Applied a total of 6 rules in 9 ms. Remains 102 /105 variables (removed 3) and now considering 277/284 (removed 7) transitions.
[2024-06-02 19:55:11] [INFO ] Flow matrix only has 251 transitions (discarded 26 similar events)
// Phase 1: matrix 251 rows 102 cols
[2024-06-02 19:55:11] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:55:11] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 19:55:11] [INFO ] Flow matrix only has 251 transitions (discarded 26 similar events)
[2024-06-02 19:55:11] [INFO ] Invariant cache hit.
[2024-06-02 19:55:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 19:55:11] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-02 19:55:11] [INFO ] Flow matrix only has 251 transitions (discarded 26 similar events)
[2024-06-02 19:55:11] [INFO ] Invariant cache hit.
[2024-06-02 19:55:11] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 19:55:12] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:55:12] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-06-02 19:55:12] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:55:12] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:55:13] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:55:13] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-02 19:55:13] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 250/352 variables, 102/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 1/353 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/353 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10551 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 250/352 variables, 102/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 276/429 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 10 (OVERLAPS) 0/353 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13329 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 7/7 constraints]
After SMT, in 24034ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 24038ms
Starting structural reductions in LTL mode, iteration 1 : 102/105 places, 277/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24257 ms. Remains : 102/105 places, 277/284 transitions.
[2024-06-02 19:55:35] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:55:35] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:55:35] [INFO ] Input system was already deterministic with 277 transitions.
[2024-06-02 19:55:35] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:55:35] [INFO ] Flatten gal took : 30 ms
[2024-06-02 19:55:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality17347322220855335148.gal : 2 ms
[2024-06-02 19:55:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality1406878692373971069.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/CTLCardinality17347322220855335148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1406878692373971069.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EX(EF(((A(((p12==0)||(p53==1)) U ((p83==0)||(p42==1))) * A(((p77==0)||(p96==1)) U (p45==1))) * (EG((p43==1)) * ((p43==0)||(p17==1)))))...157
=> equivalent forward existential formula: [FwdG(Init,!(EX(E(TRUE U ((!((E(!(((p83==0)||(p42==1))) U (!(((p12==0)||(p53==1))) * !(((p83==0)||(p42==1))))) +...322
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...562
Detected timeout of ITS tools.
[2024-06-02 19:56:05] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:56:05] [INFO ] Applying decomposition
[2024-06-02 19:56:05] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11004606144887089934.txt' '-o' '/tmp/graph11004606144887089934.bin' '-w' '/tmp/graph11004606144887089934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11004606144887089934.bin' '-l' '-1' '-v' '-w' '/tmp/graph11004606144887089934.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:56:05] [INFO ] Decomposing Gal with order
[2024-06-02 19:56:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:56:05] [INFO ] Removed a total of 402 redundant transitions.
[2024-06-02 19:56:05] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:56:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 5 ms.
[2024-06-02 19:56:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality12244971984293851732.gal : 2 ms
[2024-06-02 19:56:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality3045686887487161048.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/CTLCardinality12244971984293851732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3045686887487161048.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45929e+06,23.84,632756,3513,184,733929,1713,520,4.40127e+06,88,16901,0


Converting to forward existential form...Done !
original formula: AF(EX(EF(((A(((i1.u3.p12==0)||(i4.u16.p53==1)) U ((i5.u26.p83==0)||(i1.u13.p42==1))) * A(((i6.u32.p77==0)||(i1.u3.p96==1)) U (i4.u14.p45=...224
=> equivalent forward existential formula: [FwdG(Init,!(EX(E(TRUE U ((!((E(!(((i5.u26.p83==0)||(i1.u13.p42==1))) U (!(((i1.u3.p12==0)||(i4.u16.p53==1))) * ...431
Reverse transition relation is NOT exact ! Due to transitions t2, t45, t47, t51, t52, t60, t61, t66, t71, t76, t81, t95, t97, t98, t99, t100, t149, t151, t...726
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 102 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 102 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 100 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 100 transition count 272
Applied a total of 10 rules in 9 ms. Remains 100 /105 variables (removed 5) and now considering 272/284 (removed 12) transitions.
[2024-06-02 19:56:35] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
// Phase 1: matrix 246 rows 100 cols
[2024-06-02 19:56:35] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:56:35] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 19:56:35] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 19:56:35] [INFO ] Invariant cache hit.
[2024-06-02 19:56:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:56:35] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-06-02 19:56:35] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 19:56:35] [INFO ] Invariant cache hit.
[2024-06-02 19:56:35] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-02 19:56:37] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 2 ms to minimize.
[2024-06-02 19:56:37] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2024-06-02 19:56:37] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-06-02 19:56:37] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 0 ms to minimize.
[2024-06-02 19:56:37] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:56:37] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:56:37] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:56:37] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-06-02 19:56:37] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-02 19:56:38] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/117 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/346 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/346 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 154 constraints, problems are : Problem set: 0 solved, 271 unsolved in 9801 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/117 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 271/424 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/346 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/346 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 425 constraints, problems are : Problem set: 0 solved, 271 unsolved in 16192 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 10/10 constraints]
After SMT, in 26132ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 26136ms
Starting structural reductions in LTL mode, iteration 1 : 100/105 places, 272/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26338 ms. Remains : 100/105 places, 272/284 transitions.
[2024-06-02 19:57:02] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:57:02] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:57:02] [INFO ] Input system was already deterministic with 272 transitions.
[2024-06-02 19:57:02] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:57:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:57:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality16973010082144067649.gal : 1 ms
[2024-06-02 19:57:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality10169538057338161085.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/CTLCardinality16973010082144067649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10169538057338161085.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,1.41183e+06,2.05156,67248,2,3822,5,192451,6,0,671,195973,0


Converting to forward existential form...Done !
original formula: AX(AX(EF(((p47==1) * EX(((p79==0)&&(p83==1)))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U ((p47==1) * EX(((p79==0)&&(p83==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...555
(forward)formula 0,1,19.414,405112,1,0,596,2.03451e+06,563,308,5689,1.49592e+06,696
FORMULA FireWire-PT-01-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 9 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
[2024-06-02 19:57:21] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 19:57:21] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:57:21] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 19:57:21] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:57:21] [INFO ] Invariant cache hit.
[2024-06-02 19:57:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:57:21] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 19:57:21] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:57:21] [INFO ] Invariant cache hit.
[2024-06-02 19:57:21] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2024-06-02 19:57:24] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-02 19:57:24] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14637 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24814ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24818ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 270/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25029 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 19:57:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:57:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:57:46] [INFO ] Input system was already deterministic with 270 transitions.
[2024-06-02 19:57:46] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:57:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:57:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality15539994217594828025.gal : 1 ms
[2024-06-02 19:57:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality3497311507687653005.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/CTLCardinality15539994217594828025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3497311507687653005.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AX((EG((p4==1)) * E((p47==1) U ((E(((p92==0)||(p62==1)) U ((p27==0)||(p98==1))) + (p68==1)) + E((p62==1) U (p84==0)))))) + AX(!(E((((p15...197
=> equivalent forward existential formula: [(FwdU(EY((Init * !(!(EX(!((EG((p4==1)) * E((p47==1) U ((E(((p92==0)||(p62==1)) U ((p27==0)||(p98==1))) + (p68==...248
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...551
Hit Full ! (commute/partial/dont) 258/0/12
(forward)formula 0,0,9.44116,219076,1,0,506,778785,582,267,5751,892403,591
FORMULA FireWire-PT-01-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 281
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 98 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 98 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 96 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 96 transition count 267
Applied a total of 16 rules in 14 ms. Remains 96 /105 variables (removed 9) and now considering 267/284 (removed 17) transitions.
[2024-06-02 19:57:56] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
// Phase 1: matrix 241 rows 96 cols
[2024-06-02 19:57:56] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:57:56] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 19:57:56] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:57:56] [INFO ] Invariant cache hit.
[2024-06-02 19:57:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 19:57:56] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-02 19:57:56] [INFO ] Redundant transitions in 1 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 19:57:56] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:57:56] [INFO ] Invariant cache hit.
[2024-06-02 19:57:56] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:57:57] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:57:57] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-02 19:57:57] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:57:57] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:57:57] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:57:57] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/337 variables, and 144 constraints, problems are : Problem set: 0 solved, 264 unsolved in 8150 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 264/407 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:58:08] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/337 variables, and 409 constraints, problems are : Problem set: 0 solved, 264 unsolved in 15556 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints]
After SMT, in 23851ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 23855ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/105 places, 267/284 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24064 ms. Remains : 96/105 places, 267/284 transitions.
[2024-06-02 19:58:20] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:58:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:58:20] [INFO ] Input system was already deterministic with 267 transitions.
[2024-06-02 19:58:20] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:58:20] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:58:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality9676049377044377686.gal : 1 ms
[2024-06-02 19:58:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality11285480109459875791.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/CTLCardinality9676049377044377686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11285480109459875791.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EF(!(A((p86==1) U (p96==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!((p96==1)) U (!((p86==1)) * !((p96==1)))) + EG(!((p96==1)))))))))] = FALS...156
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t7, t8, t10, t15, t16, t17, t18, t19, t21, t23, t28, t29, t30, t31, t32, t34, t36...551
(forward)formula 0,0,29.2956,701592,1,0,747,4.10577e+06,563,384,5564,3.64938e+06,845
FORMULA FireWire-PT-01-CTLCardinality-2024-13 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 : 105/105 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 281
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 98 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 98 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 96 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 96 transition count 267
Applied a total of 16 rules in 17 ms. Remains 96 /105 variables (removed 9) and now considering 267/284 (removed 17) transitions.
[2024-06-02 19:58:50] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:58:50] [INFO ] Invariant cache hit.
[2024-06-02 19:58:50] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:58:50] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:58:50] [INFO ] Invariant cache hit.
[2024-06-02 19:58:50] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 19:58:50] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-02 19:58:50] [INFO ] Redundant transitions in 1 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 19:58:50] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:58:50] [INFO ] Invariant cache hit.
[2024-06-02 19:58:50] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:58:51] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 0 ms to minimize.
[2024-06-02 19:58:51] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-02 19:58:51] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:58:51] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:58:51] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:58:51] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/337 variables, and 144 constraints, problems are : Problem set: 0 solved, 264 unsolved in 8153 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 264/407 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:59:02] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/337 variables, and 409 constraints, problems are : Problem set: 0 solved, 264 unsolved in 15664 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints]
After SMT, in 23975ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 23979ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/105 places, 267/284 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24192 ms. Remains : 96/105 places, 267/284 transitions.
[2024-06-02 19:59:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:59:14] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:59:14] [INFO ] Input system was already deterministic with 267 transitions.
[2024-06-02 19:59:14] [INFO ] Flatten gal took : 12 ms
RANDOM walk for 7372 steps (465 resets) in 30 ms. (237 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-01-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 19:59:14] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:59:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15546526994606772741.gal : 1 ms
[2024-06-02 19:59:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11137341801325598316.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/ReachabilityCardinality15546526994606772741.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11137341801325598316.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 ...330
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 3 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
[2024-06-02 19:59:14] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 19:59:14] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:59:14] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 19:59:14] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:59:14] [INFO ] Invariant cache hit.
[2024-06-02 19:59:14] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:59:14] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 19:59:14] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:59:14] [INFO ] Invariant cache hit.
[2024-06-02 19:59:14] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 19:59:15] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:59:15] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:59:15] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:59:16] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:59:16] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:59:16] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:59:16] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:59:16] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:59:16] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:59:16] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-02 19:59:16] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 9953 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14666 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24751ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24755ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 270/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24938 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 19:59:39] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:59:39] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:59:39] [INFO ] Input system was already deterministic with 270 transitions.
[2024-06-02 19:59:39] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:59:39] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:59:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality4961831644881869178.gal : 2 ms
[2024-06-02 19:59:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality15478871788320810200.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/CTLCardinality4961831644881869178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15478871788320810200.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(AX(EF((p88==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U (p88==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...551
(forward)formula 0,0,10.235,252864,1,0,552,1.24106e+06,558,285,5642,929895,641
FORMULA FireWire-PT-01-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-02 19:59:49] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:59:49] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:59:49] [INFO ] Applying decomposition
[2024-06-02 19:59:49] [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/graph4176783838736647701.txt' '-o' '/tmp/graph4176783838736647701.bin' '-w' '/tmp/graph4176783838736647701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4176783838736647701.bin' '-l' '-1' '-v' '-w' '/tmp/graph4176783838736647701.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:59:49] [INFO ] Decomposing Gal with order
[2024-06-02 19:59:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:59:49] [INFO ] Removed a total of 412 redundant transitions.
[2024-06-02 19:59:49] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:59:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 6 ms.
[2024-06-02 19:59:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality2413266577843231141.gal : 2 ms
[2024-06-02 19:59:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality9501345501109398490.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/CTLCardinality2413266577843231141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9501345501109398490.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 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.54994e+06,20.7586,529176,3229,177,690875,2092,526,3.04451e+06,104,16419,0


Converting to forward existential form...Done !
original formula: AF((EG(AG((((i0.u19.p61==0)&&(i5.u26.p84==1))&&(i5.u24.p76==0)))) + AF((EF((i1.u21.p65==1)) * (i3.u8.p32==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((EG(!(E(TRUE U !((((i0.u19.p61==0)&&(i5.u26.p84==1))&&(i5.u24.p76==0)))))) + !(EG(!((E(TRUE U (i1.u...199
Reverse transition relation is NOT exact ! Due to transitions t2, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t96, t99, t100, t101, t102, t148, t153,...742
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,31.4438,536304,1,0,782563,5078,2935,3.30944e+06,478,33600,1584860
FORMULA FireWire-PT-01-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EF(AG(((i1.u20.p63==0)&&(i1.u5.p17==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(((i1.u20.p63==0)&&(i1.u5.p17==1)))))))] != FALSE
(forward)formula 1,1,91.2393,2172368,1,0,3.04329e+06,6917,2978,1.38867e+07,479,61656,5728580
FORMULA FireWire-PT-01-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(AG(((EX(((i0.u0.p2==0)&&(i4.u14.p45==1))) + EF((i1.u12.p40==0))) + (((i2.u33.p101==0)&&(i1.u3.p96==1))&&(i5.u24.p82==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((EX(((i0.u0.p2==0)&&(i4.u14.p45==1))) + E(TRUE U (i1.u12.p40==0))) + (((i2.u33.p101==...207
(forward)formula 2,0,146.493,2201936,1,0,3.0903e+06,6954,1800,1.40547e+07,283,61953,4392831
FORMULA FireWire-PT-01-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(EX(EF(((A(((i1.u3.p12==0)||(i4.u16.p53==1)) U ((i5.u26.p83==0)||(i1.u13.p42==1))) * A(((i6.u32.p77==0)||(i1.u3.p96==1)) U (i4.u14.p45=...224
=> equivalent forward existential formula: [FwdG(Init,!(EX(E(TRUE U ((!((E(!(((i5.u26.p83==0)||(i1.u13.p42==1))) U (!(((i1.u3.p12==0)||(i4.u16.p53==1))) * ...431
(forward)formula 3,0,191.416,2424088,1,0,3.3088e+06,6954,1673,1.56479e+07,273,61953,794664
FORMULA FireWire-PT-01-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

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

BK_STOP 1717358581613

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

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