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.r246-tall-171654351200234.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 MultiwaySync-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351200234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 18:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 111K May 18 16:43 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 MultiwaySync-PT-none-CTLFireability-2024-00
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2024-01
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2024-02
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2024-03
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2024-04
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2024-05
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2024-06
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2024-07
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2024-08
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2024-09
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2024-10
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2024-11
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2023-12
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2023-13
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2023-14
FORMULA_NAME MultiwaySync-PT-none-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716648916198

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiwaySync-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-25 14:55:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 14:55:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:55:17] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-25 14:55:17] [INFO ] Transformed 222 places.
[2024-05-25 14:55:17] [INFO ] Transformed 472 transitions.
[2024-05-25 14:55:17] [INFO ] Found NUPN structural information;
[2024-05-25 14:55:17] [INFO ] Parsed PT model containing 222 places and 472 transitions and 1496 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 83 transitions
Reduce redundant transitions removed 83 transitions.
Support contains 101 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 389/389 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 211 transition count 378
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 211 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 211 transition count 372
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 209 transition count 366
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 209 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 209 transition count 365
Applied a total of 33 rules in 39 ms. Remains 209 /222 variables (removed 13) and now considering 365/389 (removed 24) transitions.
[2024-05-25 14:55:17] [INFO ] Flow matrix only has 360 transitions (discarded 5 similar events)
// Phase 1: matrix 360 rows 209 cols
[2024-05-25 14:55:17] [INFO ] Computed 25 invariants in 19 ms
[2024-05-25 14:55:17] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-25 14:55:17] [INFO ] Flow matrix only has 360 transitions (discarded 5 similar events)
[2024-05-25 14:55:17] [INFO ] Invariant cache hit.
[2024-05-25 14:55:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 14:55:18] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-05-25 14:55:18] [INFO ] Flow matrix only has 360 transitions (discarded 5 similar events)
[2024-05-25 14:55:18] [INFO ] Invariant cache hit.
[2024-05-25 14:55:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-25 14:55:21] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 9 ms to minimize.
[2024-05-25 14:55:21] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-05-25 14:55:22] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-25 14:55:22] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-25 14:55:22] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-25 14:55:22] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-25 14:55:22] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-25 14:55:22] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 360/569 variables, 209/242 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (OVERLAPS) 0/569 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 243 constraints, problems are : Problem set: 0 solved, 364 unsolved in 13991 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 209/209 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 360/569 variables, 209/242 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 364/607 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-25 14:55:40] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-25 14:55:40] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 2/609 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 9 (OVERLAPS) 0/569 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 609 constraints, problems are : Problem set: 0 solved, 364 unsolved in 23949 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 209/209 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 10/10 constraints]
After SMT, in 38407ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 38425ms
Starting structural reductions in LTL mode, iteration 1 : 209/222 places, 365/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38964 ms. Remains : 209/222 places, 365/389 transitions.
Support contains 101 out of 209 places after structural reductions.
[2024-05-25 14:55:56] [INFO ] Flatten gal took : 68 ms
[2024-05-25 14:55:56] [INFO ] Flatten gal took : 28 ms
[2024-05-25 14:55:57] [INFO ] Input system was already deterministic with 365 transitions.
Support contains 100 out of 209 places (down from 101) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1435 ms. (27 steps per ms) remains 8/96 properties
BEST_FIRST walk for 40002 steps (8 resets) in 228 ms. (174 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/3 properties
[2024-05-25 14:55:57] [INFO ] Flow matrix only has 360 transitions (discarded 5 similar events)
[2024-05-25 14:55:57] [INFO ] Invariant cache hit.
[2024-05-25 14:55:57] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 165/203 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 360/563 variables, 203/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/569 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/569 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 209/209 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 165/203 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 360/563 variables, 203/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 14:55:58] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/569 variables, 6/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/569 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/569 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 237 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 209/209 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 511ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 365/365 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 209 transition count 363
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 207 transition count 363
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 581 edges and 207 vertex of which 38 are kept as prefixes of interest. Removing 169 places using SCC suffix rule.1 ms
Discarding 169 places :
Also discarding 171 output transitions
Drop transitions (Output transitions of discarded places.) removed 171 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 8 rules applied. Total rules applied 12 place count 38 transition count 185
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 126 place count 37 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 35 transition count 68
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 35 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 131 place count 35 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 34 transition count 64
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 34 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 34 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 138 place count 32 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 147 place count 32 transition count 52
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 31 transition count 51
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 31 transition count 51
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 149 place count 31 transition count 50
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 30 transition count 50
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 152 place count 30 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 158 place count 27 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 160 place count 27 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 164 place count 25 transition count 42
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 165 place count 24 transition count 35
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 24 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 24 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 24 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 169 place count 23 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 22 transition count 32
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 9 edges and 21 vertex of which 4 / 21 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
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 7 with 3 rules applied. Total rules applied 173 place count 18 transition count 31
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 180 place count 17 transition count 25
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 182 place count 17 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 184 place count 15 transition count 23
Applied a total of 184 rules in 92 ms. Remains 15 /209 variables (removed 194) and now considering 23/365 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 15/209 places, 23/365 transitions.
RANDOM walk for 2111 steps (426 resets) in 11 ms. (175 steps per ms) remains 0/1 properties
[2024-05-25 14:55:58] [INFO ] Flatten gal took : 23 ms
[2024-05-25 14:55:58] [INFO ] Flatten gal took : 26 ms
[2024-05-25 14:55:58] [INFO ] Input system was already deterministic with 365 transitions.
Computed a total of 11 stabilizing places and 17 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 208 transition count 363
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 363
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 205 transition count 359
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 205 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 358
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 204 transition count 355
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 204 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 204 transition count 354
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 58 place count 180 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 180 transition count 324
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 174 transition count 318
Applied a total of 76 rules in 127 ms. Remains 174 /209 variables (removed 35) and now considering 318/365 (removed 47) transitions.
[2024-05-25 14:55:58] [INFO ] Flow matrix only has 313 transitions (discarded 5 similar events)
// Phase 1: matrix 313 rows 174 cols
[2024-05-25 14:55:58] [INFO ] Computed 25 invariants in 3 ms
[2024-05-25 14:55:58] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-25 14:55:58] [INFO ] Flow matrix only has 313 transitions (discarded 5 similar events)
[2024-05-25 14:55:58] [INFO ] Invariant cache hit.
[2024-05-25 14:55:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 14:55:58] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-25 14:55:58] [INFO ] Redundant transitions in 15 ms returned []
Running 291 sub problems to find dead transitions.
[2024-05-25 14:55:58] [INFO ] Flow matrix only has 313 transitions (discarded 5 similar events)
[2024-05-25 14:55:58] [INFO ] Invariant cache hit.
[2024-05-25 14:55:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-25 14:56:00] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-25 14:56:00] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-25 14:56:00] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-25 14:56:00] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-25 14:56:00] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-25 14:56:00] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-25 14:56:00] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-25 14:56:00] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 1/174 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (OVERLAPS) 313/487 variables, 174/207 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 0/487 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 208 constraints, problems are : Problem set: 0 solved, 291 unsolved in 10342 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 174/174 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 1/174 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (OVERLAPS) 313/487 variables, 174/207 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 291/499 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-25 14:56:14] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-25 14:56:18] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 0/487 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 501 constraints, problems are : Problem set: 0 solved, 291 unsolved in 21622 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 174/174 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 10/10 constraints]
After SMT, in 32304ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 32307ms
Starting structural reductions in SI_CTL mode, iteration 1 : 174/209 places, 318/365 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32673 ms. Remains : 174/209 places, 318/365 transitions.
[2024-05-25 14:56:31] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:56:31] [INFO ] Flatten gal took : 14 ms
[2024-05-25 14:56:31] [INFO ] Input system was already deterministic with 318 transitions.
[2024-05-25 14:56:31] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:56:31] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:56:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1970231306194331302.gal : 10 ms
[2024-05-25 14:56:31] [INFO ] Time to serialize properties into /tmp/CTLFireability14867168847464894781.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/CTLFireability1970231306194331302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14867168847464894781.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.06398e+16,2.39037,66616,2,2095,5,249605,6,0,1015,288241,0


Converting to forward existential form...Done !
original formula: EF((EF(((p44==1)&&(p220==1))) + (((p79==0)||(p114==0)) * (((p97==1)&&(p111==1)) + (AG(EF(((p3==1)&&(p23==1)))) * EF((p190==0)))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * ((p44==1)&&(p220==1)))] != FALSE + ([((FwdU(Init,TRUE) * ((p79==0)||(p114==0))) ...321
(forward)formula 0,1,2.44401,66876,1,0,7,249605,9,1,1860,288241,3
FORMULA MultiwaySync-PT-none-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 205 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 205 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 204 transition count 349
Applied a total of 13 rules in 15 ms. Remains 204 /209 variables (removed 5) and now considering 349/365 (removed 16) transitions.
[2024-05-25 14:56:33] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-05-25 14:56:33] [INFO ] Computed 25 invariants in 3 ms
[2024-05-25 14:56:34] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-25 14:56:34] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 14:56:34] [INFO ] Invariant cache hit.
[2024-05-25 14:56:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 14:56:34] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 14:56:34] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 14:56:34] [INFO ] Invariant cache hit.
[2024-05-25 14:56:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 14:56:36] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-25 14:56:37] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-25 14:56:37] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-25 14:56:37] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-25 14:56:37] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-25 14:56:37] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-25 14:56:37] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-25 14:56:37] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12439 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 14:56:54] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-25 14:56:54] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 25674 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 38408ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 38411ms
Starting structural reductions in LTL mode, iteration 1 : 204/209 places, 349/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38788 ms. Remains : 204/209 places, 349/365 transitions.
[2024-05-25 14:57:12] [INFO ] Flatten gal took : 18 ms
[2024-05-25 14:57:12] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:57:12] [INFO ] Input system was already deterministic with 349 transitions.
[2024-05-25 14:57:12] [INFO ] Flatten gal took : 13 ms
[2024-05-25 14:57:12] [INFO ] Flatten gal took : 13 ms
[2024-05-25 14:57:12] [INFO ] Time to serialize gal into /tmp/CTLFireability15256823036497997301.gal : 3 ms
[2024-05-25 14:57:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7950639429920336840.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/CTLFireability15256823036497997301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7950639429920336840.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.19431e+19,6.71244,182312,2,7404,5,647277,6,0,1167,890353,0


Converting to forward existential form...Done !
original formula: (AG(AX(((AG((p70==1)) + AF((p120==1))) + (((p148==1)&&(p220==1))&&((p218==1)&&(p220==1)))))) + (E(((p121==1)&&(p137==1)) U ((p92==1)&&(p1...211
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(!(EX(!(((!(E(TRUE U !((p70==1)))) + !(EG(!((p120==1))))) + (((p148==1)&&(p220==1))&&((...636
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t36, t45, t47, t50, t64, t66, t69, t80, t82, t85, t94, t96, t99, t109, t111, t114, ...279
(forward)formula 0,0,22.1402,469864,1,0,628,2.69752e+06,732,312,8851,2.05529e+06,730
FORMULA MultiwaySync-PT-none-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 205 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 205 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 204 transition count 349
Applied a total of 13 rules in 8 ms. Remains 204 /209 variables (removed 5) and now considering 349/365 (removed 16) transitions.
[2024-05-25 14:57:35] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 14:57:35] [INFO ] Invariant cache hit.
[2024-05-25 14:57:35] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-25 14:57:35] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 14:57:35] [INFO ] Invariant cache hit.
[2024-05-25 14:57:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 14:57:35] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 14:57:35] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 14:57:35] [INFO ] Invariant cache hit.
[2024-05-25 14:57:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 14:57:38] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 5 ms to minimize.
[2024-05-25 14:57:38] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 5 ms to minimize.
[2024-05-25 14:57:38] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-25 14:57:38] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-25 14:57:38] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-25 14:57:38] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-25 14:57:39] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-25 14:57:39] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12283 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 14:57:54] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-25 14:57:55] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 25080 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 37654ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 37658ms
Starting structural reductions in LTL mode, iteration 1 : 204/209 places, 349/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37964 ms. Remains : 204/209 places, 349/365 transitions.
[2024-05-25 14:58:13] [INFO ] Flatten gal took : 13 ms
[2024-05-25 14:58:13] [INFO ] Flatten gal took : 12 ms
[2024-05-25 14:58:13] [INFO ] Input system was already deterministic with 349 transitions.
[2024-05-25 14:58:13] [INFO ] Flatten gal took : 13 ms
[2024-05-25 14:58:13] [INFO ] Flatten gal took : 12 ms
[2024-05-25 14:58:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17752232991829584580.gal : 3 ms
[2024-05-25 14:58:13] [INFO ] Time to serialize properties into /tmp/CTLFireability18029076035286459877.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/CTLFireability17752232991829584580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18029076035286459877.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.19431e+19,6.90482,181608,2,7404,5,647277,6,0,1167,890353,0


Converting to forward existential form...Done !
original formula: EG(AF(EX((p158==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX((p158==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t36, t45, t47, t50, t64, t66, t69, t80, t82, t85, t94, t96, t99, t109, t111, t114, ...279
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,29.9738,703288,1,0,619,5.11523e+06,726,308,8562,2.58518e+06,714
FORMULA MultiwaySync-PT-none-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 208 transition count 363
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 363
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 203 transition count 353
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 203 transition count 353
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 203 transition count 351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 202 transition count 348
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 202 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 202 transition count 347
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 65 place count 177 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 177 transition count 317
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 80 place count 172 transition count 312
Applied a total of 80 rules in 33 ms. Remains 172 /209 variables (removed 37) and now considering 312/365 (removed 53) transitions.
[2024-05-25 14:58:43] [INFO ] Flow matrix only has 307 transitions (discarded 5 similar events)
// Phase 1: matrix 307 rows 172 cols
[2024-05-25 14:58:43] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 14:58:43] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-25 14:58:43] [INFO ] Flow matrix only has 307 transitions (discarded 5 similar events)
[2024-05-25 14:58:43] [INFO ] Invariant cache hit.
[2024-05-25 14:58:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 14:58:43] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-25 14:58:43] [INFO ] Redundant transitions in 3 ms returned []
Running 285 sub problems to find dead transitions.
[2024-05-25 14:58:43] [INFO ] Flow matrix only has 307 transitions (discarded 5 similar events)
[2024-05-25 14:58:43] [INFO ] Invariant cache hit.
[2024-05-25 14:58:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-25 14:58:44] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-25 14:58:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-25 14:58:44] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-25 14:58:44] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-25 14:58:45] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-25 14:58:45] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-25 14:58:45] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-25 14:58:45] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 2/172 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 307/479 variables, 172/205 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 0/479 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 206 constraints, problems are : Problem set: 0 solved, 285 unsolved in 9068 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 172/172 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 2/172 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 307/479 variables, 172/205 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 285/491 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-25 14:58:57] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (OVERLAPS) 0/479 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 492 constraints, problems are : Problem set: 0 solved, 285 unsolved in 15640 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 172/172 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 9/9 constraints]
After SMT, in 24990ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 24993ms
Starting structural reductions in SI_CTL mode, iteration 1 : 172/209 places, 312/365 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25381 ms. Remains : 172/209 places, 312/365 transitions.
[2024-05-25 14:59:08] [INFO ] Flatten gal took : 9 ms
[2024-05-25 14:59:08] [INFO ] Flatten gal took : 8 ms
[2024-05-25 14:59:08] [INFO ] Input system was already deterministic with 312 transitions.
[2024-05-25 14:59:08] [INFO ] Flatten gal took : 8 ms
[2024-05-25 14:59:08] [INFO ] Flatten gal took : 9 ms
[2024-05-25 14:59:08] [INFO ] Time to serialize gal into /tmp/CTLFireability12274943946682819602.gal : 2 ms
[2024-05-25 14:59:08] [INFO ] Time to serialize properties into /tmp/CTLFireability5957931532833485178.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/CTLFireability12274943946682819602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5957931532833485178.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.12243e+16,1.28443,42928,2,1445,5,185403,6,0,1001,169722,0


Converting to forward existential form...Done !
original formula: EG(EF((!(A(!(((p75==1)&&(p220==1))) U ((p170==1)&&(p220==1)))) * EF((((p156==0)||(p170==0))||((p44==0)||(p220==0)))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (!(!((E(!(((p170==1)&&(p220==1))) U (!(!(((p75==1)&&(p220==1)))) * !(((p170==1)&&(p220==1)))...265
Reverse transition relation is NOT exact ! Due to transitions t15, t22, t32, t40, t41, t44, t52, t59, t189, t209, t211, t259, t261, t268, t270, t277, t279,...286
(forward)formula 0,1,14.8564,422312,1,0,852,2.06898e+06,658,412,7663,2.74898e+06,1027
FORMULA MultiwaySync-PT-none-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 208 transition count 362
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 205 transition count 362
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 203 edges and 205 vertex of which 105 / 205 are part of one of the 31 SCC in 2 ms
Free SCC test removed 74 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 81 rules applied. Total rules applied 86 place count 131 transition count 282
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 227 place count 100 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 227 place count 100 transition count 171
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 229 place count 99 transition count 171
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 245 place count 83 transition count 137
Iterating global reduction 2 with 16 rules applied. Total rules applied 261 place count 83 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 263 place count 83 transition count 135
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 270 place count 76 transition count 113
Iterating global reduction 3 with 7 rules applied. Total rules applied 277 place count 76 transition count 113
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 284 place count 76 transition count 106
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 304 place count 66 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 316 place count 66 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 328 place count 60 transition count 78
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 334 place count 54 transition count 59
Iterating global reduction 4 with 6 rules applied. Total rules applied 340 place count 54 transition count 59
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 346 place count 54 transition count 53
Applied a total of 346 rules in 28 ms. Remains 54 /209 variables (removed 155) and now considering 53/365 (removed 312) transitions.
// Phase 1: matrix 53 rows 54 cols
[2024-05-25 14:59:23] [INFO ] Computed 11 invariants in 8 ms
[2024-05-25 14:59:23] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-25 14:59:23] [INFO ] Invariant cache hit.
[2024-05-25 14:59:23] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-25 14:59:23] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-25 14:59:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 6/52 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-25 14:59:23] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 52/104 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 2/106 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/106 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/107 variables, and 66 constraints, problems are : Problem set: 0 solved, 39 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 6/52 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 52/104 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 39/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 2/106 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/107 variables, and 105 constraints, problems are : Problem set: 0 solved, 39 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
After SMT, in 1184ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1184ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/209 places, 53/365 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1324 ms. Remains : 54/209 places, 53/365 transitions.
[2024-05-25 14:59:24] [INFO ] Flatten gal took : 5 ms
[2024-05-25 14:59:24] [INFO ] Flatten gal took : 4 ms
[2024-05-25 14:59:24] [INFO ] Input system was already deterministic with 53 transitions.
[2024-05-25 14:59:24] [INFO ] Flatten gal took : 1 ms
[2024-05-25 14:59:24] [INFO ] Flatten gal took : 1 ms
[2024-05-25 14:59:24] [INFO ] Time to serialize gal into /tmp/CTLFireability3438763861138309869.gal : 1 ms
[2024-05-25 14:59:24] [INFO ] Time to serialize properties into /tmp/CTLFireability9072654201885832964.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/CTLFireability3438763861138309869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9072654201885832964.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.89824e+06,0.008741,3736,2,116,5,804,5,0,268,725,0


Converting to forward existential form...Done !
original formula: E(EF(AG((p145==1))) U (p202==1))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(E(TRUE U !((p145==1)))))) * (p202==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t42, t49, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...174
(forward)formula 0,0,0.030666,4844,1,0,96,8485,130,55,1625,5067,121
FORMULA MultiwaySync-PT-none-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 206 transition count 358
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 206 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 206 transition count 357
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 205 transition count 354
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 205 transition count 353
Applied a total of 10 rules in 7 ms. Remains 205 /209 variables (removed 4) and now considering 353/365 (removed 12) transitions.
[2024-05-25 14:59:25] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
// Phase 1: matrix 348 rows 205 cols
[2024-05-25 14:59:25] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 14:59:25] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-25 14:59:25] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2024-05-25 14:59:25] [INFO ] Invariant cache hit.
[2024-05-25 14:59:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 14:59:25] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 352 sub problems to find dead transitions.
[2024-05-25 14:59:25] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2024-05-25 14:59:25] [INFO ] Invariant cache hit.
[2024-05-25 14:59:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-25 14:59:28] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-25 14:59:28] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-25 14:59:28] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-25 14:59:28] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-25 14:59:29] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-25 14:59:29] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-25 14:59:29] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-25 14:59:29] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (OVERLAPS) 0/553 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 239 constraints, problems are : Problem set: 0 solved, 352 unsolved in 13053 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 352/591 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-25 14:59:46] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 9 (OVERLAPS) 0/553 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 592 constraints, problems are : Problem set: 0 solved, 352 unsolved in 23657 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 9/9 constraints]
After SMT, in 37007ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 37010ms
Starting structural reductions in LTL mode, iteration 1 : 205/209 places, 353/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37330 ms. Remains : 205/209 places, 353/365 transitions.
[2024-05-25 15:00:02] [INFO ] Flatten gal took : 15 ms
[2024-05-25 15:00:02] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:00:02] [INFO ] Input system was already deterministic with 353 transitions.
[2024-05-25 15:00:02] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:00:02] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:00:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9143298127865837718.gal : 2 ms
[2024-05-25 15:00:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14827313085724229171.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/CTLFireability9143298127865837718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14827313085724229171.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.27357e+19,6.18857,170384,2,7171,5,620598,6,0,1175,838564,0


Converting to forward existential form...Done !
original formula: AF(((!(A(AF(((p81==1)&&(p114==1))) U !(((p157==1)&&(p161==1))))) * EG((((p128==0)||(p149==0))&&(p184==0)))) * (A(AG(!(((p47==1)&&(p220==1...319
=> equivalent forward existential formula: [FwdG(Init,!(((!(!((E(!(!(((p157==1)&&(p161==1)))) U (!(!(EG(!(((p81==1)&&(p114==1)))))) * !(!(((p157==1)&&(p161...688
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t36, t45, t47, t50, t64, t66, t69, t80, t82, t85, t94, t96, t99, t109, t111, t114, ...279
Detected timeout of ITS tools.
[2024-05-25 15:00:32] [INFO ] Flatten gal took : 15 ms
[2024-05-25 15:00:32] [INFO ] Applying decomposition
[2024-05-25 15:00:32] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4689698682467374567.txt' '-o' '/tmp/graph4689698682467374567.bin' '-w' '/tmp/graph4689698682467374567.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4689698682467374567.bin' '-l' '-1' '-v' '-w' '/tmp/graph4689698682467374567.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:00:32] [INFO ] Decomposing Gal with order
[2024-05-25 15:00:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:00:32] [INFO ] Removed a total of 266 redundant transitions.
[2024-05-25 15:00:32] [INFO ] Flatten gal took : 121 ms
[2024-05-25 15:00:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 214 labels/synchronizations in 26 ms.
[2024-05-25 15:00:32] [INFO ] Time to serialize gal into /tmp/CTLFireability9565594075813966959.gal : 12 ms
[2024-05-25 15:00:32] [INFO ] Time to serialize properties into /tmp/CTLFireability1173930223625191167.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/CTLFireability9565594075813966959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1173930223625191167.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27357e+19,0.263459,14268,275,104,19677,3609,498,47733,150,18401,0


Converting to forward existential form...Done !
original formula: AF(((!(A(AF(((i3.u20.p81==1)&&(i3.u28.p114==1))) U !(((i5.u39.p157==1)&&(i5.u43.p161==1))))) * EG((((i4.u33.p128==0)||(i4.u36.p149==0))&&...438
=> equivalent forward existential formula: [FwdG(Init,!(((!(!((E(!(!(((i5.u39.p157==1)&&(i5.u43.p161==1)))) U (!(!(EG(!(((i3.u20.p81==1)&&(i3.u28.p114==1))...913
Reverse transition relation is NOT exact ! Due to transitions i0.t114, i0.t111, i0.t109, i1.t99, i1.t96, i1.t94, i2.t82, i2.t80, i2.u14.t85, i2.u14.t288, i...369
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,26.694,380700,1,0,689169,19966,3976,1.79944e+06,904,126016,292750
FORMULA MultiwaySync-PT-none-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 205 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 205 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 204 transition count 349
Applied a total of 13 rules in 15 ms. Remains 204 /209 variables (removed 5) and now considering 349/365 (removed 16) transitions.
[2024-05-25 15:00:59] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-05-25 15:00:59] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 15:00:59] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-25 15:00:59] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:00:59] [INFO ] Invariant cache hit.
[2024-05-25 15:00:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:00:59] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 15:00:59] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:00:59] [INFO ] Invariant cache hit.
[2024-05-25 15:00:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:01:02] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:01:02] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:01:02] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:01:03] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:01:03] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:01:03] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:01:03] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:01:03] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12382 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:01:19] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-25 15:01:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 25093 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 37770ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 37773ms
Starting structural reductions in LTL mode, iteration 1 : 204/209 places, 349/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38049 ms. Remains : 204/209 places, 349/365 transitions.
[2024-05-25 15:01:37] [INFO ] Flatten gal took : 12 ms
[2024-05-25 15:01:37] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:01:37] [INFO ] Input system was already deterministic with 349 transitions.
[2024-05-25 15:01:37] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:01:37] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:01:37] [INFO ] Time to serialize gal into /tmp/CTLFireability7555621763993316095.gal : 2 ms
[2024-05-25 15:01:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6334824747311754172.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/CTLFireability7555621763993316095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6334824747311754172.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.19431e+19,6.83977,180948,2,7404,5,647277,6,0,1167,890353,0


Converting to forward existential form...Done !
original formula: ((EG((EF(((p167==0)||(p220==0))) * AF((((p123==0)||(p149==0)) * EX(((p98==0)||(p106==0))))))) + EG((EG((p181==1)) * ((p98==0)||(p114==0))...276
=> equivalent forward existential formula: [((FwdU((Init * !((EG((E(TRUE U ((p167==0)||(p220==0))) * !(EG(!((((p123==0)||(p149==0)) * EX(((p98==0)||(p106==...354
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t36, t45, t47, t50, t64, t66, t69, t80, t82, t85, t94, t96, t99, t109, t111, t114, ...279
Detected timeout of ITS tools.
[2024-05-25 15:02:07] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:02:07] [INFO ] Applying decomposition
[2024-05-25 15:02:07] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1754486561031328787.txt' '-o' '/tmp/graph1754486561031328787.bin' '-w' '/tmp/graph1754486561031328787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1754486561031328787.bin' '-l' '-1' '-v' '-w' '/tmp/graph1754486561031328787.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:02:07] [INFO ] Decomposing Gal with order
[2024-05-25 15:02:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:02:07] [INFO ] Removed a total of 270 redundant transitions.
[2024-05-25 15:02:07] [INFO ] Flatten gal took : 17 ms
[2024-05-25 15:02:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 203 labels/synchronizations in 6 ms.
[2024-05-25 15:02:07] [INFO ] Time to serialize gal into /tmp/CTLFireability13228063993286297062.gal : 3 ms
[2024-05-25 15:02:07] [INFO ] Time to serialize properties into /tmp/CTLFireability12386312691549395605.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/CTLFireability13228063993286297062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12386312691549395605.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19431e+19,0.279958,15864,274,84,25102,2234,490,53333,134,10603,0


Converting to forward existential form...Done !
original formula: ((EG((EF(((i5.u41.p167==0)||(u60.p220==0))) * AF((((i4.u29.p123==0)||(i4.u36.p149==0)) * EX(((i3.u23.p98==0)||(i3.u24.p106==0))))))) + EG...380
=> equivalent forward existential formula: [((FwdU((Init * !((EG((E(TRUE U ((i5.u41.p167==0)||(u60.p220==0))) * !(EG(!((((i4.u29.p123==0)||(i4.u36.p149==0)...458
Reverse transition relation is NOT exact ! Due to transitions i0.t114, i0.t111, i0.t109, i1.t99, i1.t96, i1.t94, i2.t82, i2.u16.t80, i2.u16.t85, i2.u16.t28...361
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
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 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,1.16542,52032,1,0,117794,5915,3737,179654,774,24672,133329
FORMULA MultiwaySync-PT-none-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 209 transition count 364
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 364
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 204 transition count 354
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 204 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 204 transition count 352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 203 transition count 349
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 203 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 203 transition count 348
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 51 place count 185 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 57 place count 185 transition count 324
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 69 place count 179 transition count 318
Applied a total of 69 rules in 37 ms. Remains 179 /209 variables (removed 30) and now considering 318/365 (removed 47) transitions.
[2024-05-25 15:02:09] [INFO ] Flow matrix only has 313 transitions (discarded 5 similar events)
// Phase 1: matrix 313 rows 179 cols
[2024-05-25 15:02:09] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 15:02:09] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-25 15:02:09] [INFO ] Flow matrix only has 313 transitions (discarded 5 similar events)
[2024-05-25 15:02:09] [INFO ] Invariant cache hit.
[2024-05-25 15:02:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:02:09] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-05-25 15:02:09] [INFO ] Redundant transitions in 2 ms returned []
Running 317 sub problems to find dead transitions.
[2024-05-25 15:02:09] [INFO ] Flow matrix only has 313 transitions (discarded 5 similar events)
[2024-05-25 15:02:09] [INFO ] Invariant cache hit.
[2024-05-25 15:02:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-05-25 15:02:11] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:02:11] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:02:11] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:02:12] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:02:12] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-25 15:02:12] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:02:12] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-25 15:02:12] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 313/492 variables, 179/212 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 0/492 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 213 constraints, problems are : Problem set: 0 solved, 317 unsolved in 10580 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 179/179 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 313/492 variables, 179/212 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 317/530 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-05-25 15:02:25] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-25 15:02:25] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (OVERLAPS) 0/492 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 532 constraints, problems are : Problem set: 0 solved, 317 unsolved in 19188 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 179/179 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 10/10 constraints]
After SMT, in 30042ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 30045ms
Starting structural reductions in SI_CTL mode, iteration 1 : 179/209 places, 318/365 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30502 ms. Remains : 179/209 places, 318/365 transitions.
[2024-05-25 15:02:39] [INFO ] Flatten gal took : 15 ms
[2024-05-25 15:02:39] [INFO ] Flatten gal took : 17 ms
[2024-05-25 15:02:39] [INFO ] Input system was already deterministic with 318 transitions.
[2024-05-25 15:02:39] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:02:39] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:02:39] [INFO ] Time to serialize gal into /tmp/CTLFireability7777212927083202556.gal : 3 ms
[2024-05-25 15:02:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7845879620960457314.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/CTLFireability7777212927083202556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7845879620960457314.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.23243e+17,2.08121,53424,2,2909,5,208170,6,0,1036,224972,0


Converting to forward existential form...Done !
original formula: (EF((E(((p9==1)&&(p220==1)) U ((AG(((p130==1)&&(p141==1))) + (p211==1)) + ((p182==1)&&(p220==1)))) + ((p92==1)&&(p106==1)))) * EG(((EF(((...404
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U (E(((p9==1)&&(p220==1)) U ((!(E(TRUE U !(((p130==1)&&(p141==1))))) + (p211==1)) + ((p182=...562
Reverse transition relation is NOT exact ! Due to transitions t21, t28, t38, t46, t53, t60, t219, t221, t256, t258, t265, t267, t274, t276, t281, t282, t28...288
Detected timeout of ITS tools.
[2024-05-25 15:03:09] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:03:09] [INFO ] Applying decomposition
[2024-05-25 15:03:09] [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/graph9399707173936720251.txt' '-o' '/tmp/graph9399707173936720251.bin' '-w' '/tmp/graph9399707173936720251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9399707173936720251.bin' '-l' '-1' '-v' '-w' '/tmp/graph9399707173936720251.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:03:09] [INFO ] Decomposing Gal with order
[2024-05-25 15:03:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:03:09] [INFO ] Removed a total of 247 redundant transitions.
[2024-05-25 15:03:09] [INFO ] Flatten gal took : 16 ms
[2024-05-25 15:03:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 209 labels/synchronizations in 5 ms.
[2024-05-25 15:03:09] [INFO ] Time to serialize gal into /tmp/CTLFireability18022280667994646787.gal : 3 ms
[2024-05-25 15:03:09] [INFO ] Time to serialize properties into /tmp/CTLFireability476641713648656900.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/CTLFireability18022280667994646787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability476641713648656900.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.23243e+17,0.182343,11512,243,134,13848,2966,443,35766,163,12699,0


Converting to forward existential form...Done !
original formula: (EF((E(((i0.u2.p9==1)&&(i16.u50.p220==1)) U ((AG(((i4.u28.p130==1)&&(i4.u32.p141==1))) + (u47.p211==1)) + ((u37.p182==1)&&(i16.u50.p220==...573
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U (E(((i0.u2.p9==1)&&(i16.u50.p220==1)) U ((!(E(TRUE U !(((i4.u28.p130==1)&&(i4.u32.p141==1...755
Reverse transition relation is NOT exact ! Due to transitions i0.t258, i0.t60, i0.u5.t256, i1.t267, i1.t53, i1.u11.t265, i2.t46, i2.u12.t274, i2.u12.t276, ...389
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,17.894,245416,1,0,427658,24720,3295,908336,999,140724,183427
FORMULA MultiwaySync-PT-none-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 207 transition count 361
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 207 transition count 361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 206 transition count 358
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 206 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 206 transition count 357
Applied a total of 7 rules in 6 ms. Remains 206 /209 variables (removed 3) and now considering 357/365 (removed 8) transitions.
[2024-05-25 15:03:27] [INFO ] Flow matrix only has 352 transitions (discarded 5 similar events)
// Phase 1: matrix 352 rows 206 cols
[2024-05-25 15:03:27] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 15:03:27] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-25 15:03:27] [INFO ] Flow matrix only has 352 transitions (discarded 5 similar events)
[2024-05-25 15:03:27] [INFO ] Invariant cache hit.
[2024-05-25 15:03:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:03:28] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2024-05-25 15:03:28] [INFO ] Flow matrix only has 352 transitions (discarded 5 similar events)
[2024-05-25 15:03:28] [INFO ] Invariant cache hit.
[2024-05-25 15:03:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-25 15:03:30] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-25 15:03:31] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:03:31] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:03:31] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:03:31] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:03:31] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:03:31] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:03:31] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (OVERLAPS) 352/558 variables, 206/239 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 0/558 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 240 constraints, problems are : Problem set: 0 solved, 356 unsolved in 12850 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 206/206 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (OVERLAPS) 352/558 variables, 206/239 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 356/596 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-25 15:03:48] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (OVERLAPS) 0/558 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 597 constraints, problems are : Problem set: 0 solved, 356 unsolved in 22676 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 206/206 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 9/9 constraints]
After SMT, in 35839ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 35844ms
Starting structural reductions in LTL mode, iteration 1 : 206/209 places, 357/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36074 ms. Remains : 206/209 places, 357/365 transitions.
[2024-05-25 15:04:03] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:04:03] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:04:03] [INFO ] Input system was already deterministic with 357 transitions.
[2024-05-25 15:04:03] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:04:03] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:04:03] [INFO ] Time to serialize gal into /tmp/CTLFireability434163175802746294.gal : 3 ms
[2024-05-25 15:04:03] [INFO ] Time to serialize properties into /tmp/CTLFireability3128097422499091625.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/CTLFireability434163175802746294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3128097422499091625.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 -...282
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.50942e+19,12.5091,321744,2,12565,5,1.13419e+06,6,0,1183,1.45448e+06,0


Converting to forward existential form...Done !
original formula: AX((AX(((EG(((p121==0)||(p137==0))) + ((p94==1)&&(p102==1))) + ((p5==1)&&(p15==1)))) + A(AX((((p140==1)||((p130==1)&&(p137==1)))||((p63==...204
=> equivalent forward existential formula: [(((EY((EY(Init) * !(!((E(!(EX(!(E(TRUE U !(((p3==1)&&(p15==1))))))) U (!(!(EX(!((((p140==1)||((p130==1)&&(p137=...385
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t36, t45, t47, t50, t64, t66, t69, t80, t82, t85, t94, t96, t99, t109, t111, t114, ...279
(forward)formula 0,1,28.2714,503256,1,0,634,3.51384e+06,750,321,8799,1.97217e+06,748
FORMULA MultiwaySync-PT-none-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 206 transition count 358
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 206 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 206 transition count 357
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 205 transition count 354
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 205 transition count 353
Applied a total of 10 rules in 13 ms. Remains 205 /209 variables (removed 4) and now considering 353/365 (removed 12) transitions.
[2024-05-25 15:04:32] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
// Phase 1: matrix 348 rows 205 cols
[2024-05-25 15:04:32] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 15:04:32] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-25 15:04:32] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2024-05-25 15:04:32] [INFO ] Invariant cache hit.
[2024-05-25 15:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:04:32] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 352 sub problems to find dead transitions.
[2024-05-25 15:04:32] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2024-05-25 15:04:32] [INFO ] Invariant cache hit.
[2024-05-25 15:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-25 15:04:35] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:04:35] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-25 15:04:35] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:04:35] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:04:36] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:04:36] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:04:36] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-25 15:04:36] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (OVERLAPS) 0/553 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 239 constraints, problems are : Problem set: 0 solved, 352 unsolved in 12582 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 352/591 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-25 15:04:52] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 9 (OVERLAPS) 0/553 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 592 constraints, problems are : Problem set: 0 solved, 352 unsolved in 21178 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 9/9 constraints]
After SMT, in 34020ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 34024ms
Starting structural reductions in LTL mode, iteration 1 : 205/209 places, 353/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34287 ms. Remains : 205/209 places, 353/365 transitions.
[2024-05-25 15:05:06] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:05:06] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:05:06] [INFO ] Input system was already deterministic with 353 transitions.
[2024-05-25 15:05:06] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:05:06] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:05:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10321944468488886389.gal : 2 ms
[2024-05-25 15:05:06] [INFO ] Time to serialize properties into /tmp/CTLFireability18104636376841306265.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/CTLFireability10321944468488886389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18104636376841306265.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.41547e+19,6.76614,185880,2,7641,5,649259,6,0,1175,899276,0


Converting to forward existential form...Done !
original formula: AG(E(((p183==1)&&(p220==1)) U (((E((p19==1) U (p217==1)) + (p193==1)) + (!((EG((p71==1)) * (p158==1))) + ((p123==1)&&(p137==1)))) + ((EX(...263
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p183==1)&&(p220==1)) U (((E((p19==1) U (p217==1)) + (p193==1)) + (!((EG((p71==1)) * (p...317
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t36, t45, t47, t50, t64, t66, t69, t80, t82, t85, t94, t96, t99, t109, t111, t114, ...279
Detected timeout of ITS tools.
[2024-05-25 15:05:36] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:05:36] [INFO ] Applying decomposition
[2024-05-25 15:05:36] [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/graph15234872343644435357.txt' '-o' '/tmp/graph15234872343644435357.bin' '-w' '/tmp/graph15234872343644435357.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15234872343644435357.bin' '-l' '-1' '-v' '-w' '/tmp/graph15234872343644435357.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:05:36] [INFO ] Decomposing Gal with order
[2024-05-25 15:05:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:05:36] [INFO ] Removed a total of 267 redundant transitions.
[2024-05-25 15:05:36] [INFO ] Flatten gal took : 16 ms
[2024-05-25 15:05:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 209 labels/synchronizations in 6 ms.
[2024-05-25 15:05:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10819428703103337754.gal : 6 ms
[2024-05-25 15:05:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4441287448175455516.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/CTLFireability10819428703103337754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4441287448175455516.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.41547e+19,0.326002,17452,283,122,27046,4752,512,52952,158,22924,0


Converting to forward existential form...Done !
original formula: AG(E(((u43.p183==1)&&(u56.p220==1)) U (((E((i0.u2.p19==1) U (u55.p217==1)) + (u47.p193==1)) + (!((EG((i2.u15.p71==1)) * (i5.u41.p158==1))...355
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((u43.p183==1)&&(u56.p220==1)) U (((E((i0.u2.p19==1) U (u55.p217==1)) + (u47.p193==1)) +...409
Reverse transition relation is NOT exact ! Due to transitions i0.t111, i0.t109, i0.u5.t114, i1.t99, i1.t96, i1.t94, i2.t82, i2.t80, i2.u13.t85, i2.u13.t292...368
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,0.76843,32500,1,0,70812,9238,3688,83233,936,33216,85940
FORMULA MultiwaySync-PT-none-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 205 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 205 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 204 transition count 349
Applied a total of 13 rules in 4 ms. Remains 204 /209 variables (removed 5) and now considering 349/365 (removed 16) transitions.
[2024-05-25 15:05:37] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-05-25 15:05:37] [INFO ] Computed 25 invariants in 4 ms
[2024-05-25 15:05:37] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-25 15:05:37] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:05:37] [INFO ] Invariant cache hit.
[2024-05-25 15:05:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:05:37] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 15:05:37] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:05:37] [INFO ] Invariant cache hit.
[2024-05-25 15:05:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:05:40] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-25 15:05:40] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-25 15:05:40] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-25 15:05:40] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:05:41] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:05:41] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:05:41] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:05:41] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12191 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:05:57] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-25 15:05:57] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 24512 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 36973ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 36977ms
Starting structural reductions in LTL mode, iteration 1 : 204/209 places, 349/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37205 ms. Remains : 204/209 places, 349/365 transitions.
[2024-05-25 15:06:14] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:06:14] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:06:14] [INFO ] Input system was already deterministic with 349 transitions.
[2024-05-25 15:06:14] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:06:14] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:06:14] [INFO ] Time to serialize gal into /tmp/CTLFireability534770326759397676.gal : 2 ms
[2024-05-25 15:06:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12458819009349741631.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/CTLFireability534770326759397676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12458819009349741631.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.19431e+19,6.85057,182344,2,7404,5,647277,6,0,1167,890353,0


Converting to forward existential form...Done !
original formula: AX((EF(((p108==0)||(p220==0))) * EF((((AG((p214==1)) * (p184==0)) + (((p49==1)&&(p220==1))&&((p193==1)&&((p98==0)||(p106==0))))) * EG(((p...179
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U ((p108==0)||(p220==0)))))] = FALSE * [(EY(Init) * !(E(TRUE U (((!(E(TRUE U !((p214==1))...276
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t36, t45, t47, t50, t64, t66, t69, t80, t82, t85, t94, t96, t99, t109, t111, t114, ...279
Detected timeout of ITS tools.
[2024-05-25 15:06:44] [INFO ] Flatten gal took : 13 ms
[2024-05-25 15:06:44] [INFO ] Applying decomposition
[2024-05-25 15:06:44] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10753720340589452587.txt' '-o' '/tmp/graph10753720340589452587.bin' '-w' '/tmp/graph10753720340589452587.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10753720340589452587.bin' '-l' '-1' '-v' '-w' '/tmp/graph10753720340589452587.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:06:44] [INFO ] Decomposing Gal with order
[2024-05-25 15:06:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:06:45] [INFO ] Removed a total of 263 redundant transitions.
[2024-05-25 15:06:45] [INFO ] Flatten gal took : 14 ms
[2024-05-25 15:06:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 4 ms.
[2024-05-25 15:06:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15636212338077215236.gal : 2 ms
[2024-05-25 15:06:45] [INFO ] Time to serialize properties into /tmp/CTLFireability2400793452677831278.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/CTLFireability15636212338077215236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2400793452677831278.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.19431e+19,0.313459,16412,288,102,26468,2690,520,53195,133,13816,0


Converting to forward existential form...Done !
original formula: AX((EF(((i3.u25.p108==0)||(u59.p220==0))) * EF((((AG((u57.p214==1)) * (u47.p184==0)) + (((i1.u12.p49==1)&&(u59.p220==1))&&((u50.p193==1)&...238
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U ((i3.u25.p108==0)||(u59.p220==0)))))] = FALSE * [(EY(Init) * !(E(TRUE U (((!(E(TRUE U !...335
Reverse transition relation is NOT exact ! Due to transitions i0.t114, i0.t111, i0.t109, i1.t99, i1.t96, i1.t94, i2.t82, i2.t80, i2.u14.t85, i2.u14.t288, i...365
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,0.655386,26444,1,0,57305,5559,3214,74345,731,20244,79702
FORMULA MultiwaySync-PT-none-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 206 transition count 356
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 206 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 206 transition count 354
Applied a total of 8 rules in 7 ms. Remains 206 /209 variables (removed 3) and now considering 354/365 (removed 11) transitions.
[2024-05-25 15:06:45] [INFO ] Flow matrix only has 349 transitions (discarded 5 similar events)
// Phase 1: matrix 349 rows 206 cols
[2024-05-25 15:06:45] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 15:06:45] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-25 15:06:45] [INFO ] Flow matrix only has 349 transitions (discarded 5 similar events)
[2024-05-25 15:06:45] [INFO ] Invariant cache hit.
[2024-05-25 15:06:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:06:45] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2024-05-25 15:06:45] [INFO ] Flow matrix only has 349 transitions (discarded 5 similar events)
[2024-05-25 15:06:45] [INFO ] Invariant cache hit.
[2024-05-25 15:06:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-25 15:06:48] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-25 15:06:48] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:06:49] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-25 15:06:49] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-25 15:06:49] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:06:49] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:06:49] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:06:49] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 349/555 variables, 206/239 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-25 15:06:53] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-25 15:07:01] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/555 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 10 (OVERLAPS) 0/555 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 353 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 242 constraints, problems are : Problem set: 0 solved, 353 unsolved in 23254 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 206/206 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 349/555 variables, 206/241 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 353/595 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 353 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 595 constraints, problems are : Problem set: 0 solved, 353 unsolved in 16625 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 206/206 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 10/10 constraints]
After SMT, in 40143ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 40146ms
Starting structural reductions in LTL mode, iteration 1 : 206/209 places, 354/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40363 ms. Remains : 206/209 places, 354/365 transitions.
[2024-05-25 15:07:26] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:07:26] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:07:26] [INFO ] Input system was already deterministic with 354 transitions.
[2024-05-25 15:07:26] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:07:26] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:07:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5247341159630553327.gal : 2 ms
[2024-05-25 15:07:26] [INFO ] Time to serialize properties into /tmp/CTLFireability18323657998527129731.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/CTLFireability5247341159630553327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18323657998527129731.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.36341e+19,6.87325,186128,2,7316,5,662021,6,0,1180,924025,0


Converting to forward existential form...Done !
original formula: EF(((((p41==1)&&(p220==1)) * ((p82==0) * (EF(AX(((p108==1)&&(p220==1)))) + A(AX((p73==1)) U (p187!=1))))) * (AF((p171==1)) + AF(((p81==1)...171
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (((p41==1)&&(p220==1)) * ((p82==0) * (E(TRUE U !(EX(!(((p108==1)&&(p220==1)))))) + !((E(!(...502
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t36, t45, t47, t50, t64, t66, t69, t81, t83, t86, t95, t97, t100, t110, t112, t115,...280
(forward)formula 0,1,12.8,236124,1,0,637,1.63452e+06,746,320,8395,975111,742
FORMULA MultiwaySync-PT-none-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 205 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 205 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 204 transition count 349
Applied a total of 13 rules in 11 ms. Remains 204 /209 variables (removed 5) and now considering 349/365 (removed 16) transitions.
[2024-05-25 15:07:39] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-05-25 15:07:39] [INFO ] Computed 25 invariants in 3 ms
[2024-05-25 15:07:39] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-25 15:07:39] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:07:39] [INFO ] Invariant cache hit.
[2024-05-25 15:07:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:07:39] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 15:07:39] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:07:39] [INFO ] Invariant cache hit.
[2024-05-25 15:07:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:07:42] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:07:42] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:07:42] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:07:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-25 15:07:42] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-25 15:07:42] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-25 15:07:42] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-25 15:07:43] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12311 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:07:58] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-25 15:07:58] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 23656 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 36226ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 36228ms
Starting structural reductions in LTL mode, iteration 1 : 204/209 places, 349/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36447 ms. Remains : 204/209 places, 349/365 transitions.
[2024-05-25 15:08:15] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:08:15] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:08:15] [INFO ] Input system was already deterministic with 349 transitions.
[2024-05-25 15:08:15] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:08:15] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:08:15] [INFO ] Time to serialize gal into /tmp/CTLFireability8602893923805393074.gal : 2 ms
[2024-05-25 15:08:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1209746846098353898.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/CTLFireability8602893923805393074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1209746846098353898.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.19431e+19,6.52908,181840,2,7404,5,647277,6,0,1167,890353,0


Converting to forward existential form...Done !
original formula: AG(((!(A(EF((p176==1)) U ((p14!=1) * AG(((p155==1)&&(p173==1)))))) + AG((((p26==0)&&((p34==0)||(p42==0)))||((p112==1)&&(p220==1))))) + (A...258
=> equivalent forward existential formula: ([FwdG(FwdU((FwdU(Init,TRUE) * !((!(!((E(!(((p14!=1) * !(E(TRUE U !(((p155==1)&&(p173==1))))))) U (!(E(TRUE U (p...817
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t36, t45, t47, t50, t64, t66, t69, t80, t82, t85, t94, t96, t99, t109, t111, t114, ...279
Detected timeout of ITS tools.
[2024-05-25 15:08:45] [INFO ] Flatten gal took : 12 ms
[2024-05-25 15:08:45] [INFO ] Applying decomposition
[2024-05-25 15:08:45] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14300916077453577641.txt' '-o' '/tmp/graph14300916077453577641.bin' '-w' '/tmp/graph14300916077453577641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14300916077453577641.bin' '-l' '-1' '-v' '-w' '/tmp/graph14300916077453577641.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:08:45] [INFO ] Decomposing Gal with order
[2024-05-25 15:08:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:08:45] [INFO ] Removed a total of 267 redundant transitions.
[2024-05-25 15:08:45] [INFO ] Flatten gal took : 15 ms
[2024-05-25 15:08:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 200 labels/synchronizations in 3 ms.
[2024-05-25 15:08:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16601167404601648517.gal : 2 ms
[2024-05-25 15:08:45] [INFO ] Time to serialize properties into /tmp/CTLFireability15296450444188674336.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/CTLFireability16601167404601648517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15296450444188674336.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19431e+19,0.280608,16140,302,91,26347,2505,530,51985,144,11022,0


Converting to forward existential form...Done !
original formula: AG(((!(A(EF((i6.u39.p176==1)) U ((i0.u6.p14!=1) * AG(((i6.u40.p155==1)&&(i6.u45.p173==1)))))) + AG((((i0.u6.p26==0)&&((i1.u8.p34==0)||(i1...355
=> equivalent forward existential formula: ([FwdG(FwdU((FwdU(Init,TRUE) * !((!(!((E(!(((i0.u6.p14!=1) * !(E(TRUE U !(((i6.u40.p155==1)&&(i6.u45.p173==1))))...1051
Reverse transition relation is NOT exact ! Due to transitions i0.t114, i0.t111, i0.t109, i1.t99, i1.t96, i1.t94, i2.t82, i2.t80, i2.u14.t85, i2.u14.t288, i...357
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,1.12835,49404,1,0,101680,8891,3819,176833,811,25735,115038
FORMULA MultiwaySync-PT-none-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 205 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 205 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 204 transition count 349
Applied a total of 13 rules in 4 ms. Remains 204 /209 variables (removed 5) and now considering 349/365 (removed 16) transitions.
[2024-05-25 15:08:46] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:08:46] [INFO ] Invariant cache hit.
[2024-05-25 15:08:46] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-25 15:08:46] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:08:46] [INFO ] Invariant cache hit.
[2024-05-25 15:08:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:08:47] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 15:08:47] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:08:47] [INFO ] Invariant cache hit.
[2024-05-25 15:08:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:08:49] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-25 15:08:49] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:08:50] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:08:50] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-25 15:08:50] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:08:50] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-25 15:08:50] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-25 15:08:50] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 11943 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:09:06] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-25 15:09:06] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 23357 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 35563ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 35566ms
Starting structural reductions in LTL mode, iteration 1 : 204/209 places, 349/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35784 ms. Remains : 204/209 places, 349/365 transitions.
[2024-05-25 15:09:22] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:09:22] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:09:22] [INFO ] Input system was already deterministic with 349 transitions.
[2024-05-25 15:09:22] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:09:22] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:09:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16248850481629197449.gal : 2 ms
[2024-05-25 15:09:22] [INFO ] Time to serialize properties into /tmp/CTLFireability200952535880004253.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/CTLFireability16248850481629197449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability200952535880004253.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.19431e+19,6.42192,182220,2,7404,5,647277,6,0,1167,890353,0


Converting to forward existential form...Done !
original formula: (AG((((EF(((p182==1)&&(p220==1))) + (p27==0)) + ((p140==0)||(p220==0))) + (!(E((p66==1) U ((p35==1)&&(p220==1)))) + EF(((p73==1)&&(p220==...324
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * !(((E(TRUE U ((p182==1)&&(p220==1))) + (p27==0)) + ((p140==0)||(p220==0))))) * !(E(T...567
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t36, t45, t47, t50, t64, t66, t69, t80, t82, t85, t94, t96, t99, t109, t111, t114, ...279
(forward)formula 0,1,15.9339,361880,1,0,644,2.48804e+06,751,326,8618,1.45051e+06,761
FORMULA MultiwaySync-PT-none-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 205 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 205 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 204 transition count 349
Applied a total of 13 rules in 13 ms. Remains 204 /209 variables (removed 5) and now considering 349/365 (removed 16) transitions.
[2024-05-25 15:09:38] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:09:38] [INFO ] Invariant cache hit.
[2024-05-25 15:09:38] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-25 15:09:38] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:09:38] [INFO ] Invariant cache hit.
[2024-05-25 15:09:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:09:38] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 15:09:38] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:09:38] [INFO ] Invariant cache hit.
[2024-05-25 15:09:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:09:41] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:09:41] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-25 15:09:41] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-25 15:09:41] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
[2024-05-25 15:09:42] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:09:42] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:09:42] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:09:42] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 11986 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:09:58] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:09:58] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 24487 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 36728ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 36731ms
Starting structural reductions in LTL mode, iteration 1 : 204/209 places, 349/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36960 ms. Remains : 204/209 places, 349/365 transitions.
[2024-05-25 15:10:15] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:10:15] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:10:15] [INFO ] Input system was already deterministic with 349 transitions.
[2024-05-25 15:10:15] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:10:15] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:10:15] [INFO ] Time to serialize gal into /tmp/CTLFireability17253173999434571716.gal : 1 ms
[2024-05-25 15:10:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16611200411198241073.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/CTLFireability17253173999434571716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16611200411198241073.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.19431e+19,6.70173,181672,2,7404,5,647277,6,0,1167,890353,0


Converting to forward existential form...Done !
original formula: (EX(E(AF(((p202!=1)||(((p70==1)&&(p97==1))&&(p111==1)))) U E(((((p76==1)&&(p121==1))&&(p149==1))||((p9==1)&&(p220==1))) U (!(((p124==1)&&...211
=> equivalent forward existential formula: ([(Init * !(EX(E(!(EG(!(((p202!=1)||(((p70==1)&&(p97==1))&&(p111==1)))))) U E(((((p76==1)&&(p121==1))&&(p149==1)...308
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t36, t45, t47, t50, t64, t66, t69, t80, t82, t85, t94, t96, t99, t109, t111, t114, ...279
(forward)formula 0,0,21.3261,453288,1,0,616,2.60452e+06,729,303,8745,1.93472e+06,714
FORMULA MultiwaySync-PT-none-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 205 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 205 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 204 transition count 349
Applied a total of 13 rules in 8 ms. Remains 204 /209 variables (removed 5) and now considering 349/365 (removed 16) transitions.
[2024-05-25 15:10:37] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:10:37] [INFO ] Invariant cache hit.
[2024-05-25 15:10:37] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-25 15:10:37] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:10:37] [INFO ] Invariant cache hit.
[2024-05-25 15:10:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:10:37] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 15:10:37] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:10:37] [INFO ] Invariant cache hit.
[2024-05-25 15:10:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:10:40] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:10:40] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:10:40] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-25 15:10:40] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:10:40] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:10:40] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:10:40] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:10:41] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12036 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:10:56] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:10:57] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 24097 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 36390ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 36393ms
Starting structural reductions in LTL mode, iteration 1 : 204/209 places, 349/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36609 ms. Remains : 204/209 places, 349/365 transitions.
[2024-05-25 15:11:13] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:11:13] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:11:13] [INFO ] Input system was already deterministic with 349 transitions.
[2024-05-25 15:11:13] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:11:13] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:11:13] [INFO ] Time to serialize gal into /tmp/CTLFireability7077183450073385833.gal : 1 ms
[2024-05-25 15:11:13] [INFO ] Time to serialize properties into /tmp/CTLFireability14843207429654375899.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/CTLFireability7077183450073385833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14843207429654375899.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.19431e+19,6.52414,181252,2,7404,5,647277,6,0,1167,890353,0


Converting to forward existential form...Done !
original formula: A((p41==1) U ((!(((p144==1)&&(p220==1))) * EG(!(((((p133==1)&&(p149==1))||((p117==1)&&(p220==1))) + AX(((p216==1)&&(p220==1))))))) * A(!(...240
=> equivalent forward existential formula: [((Init * !(EG(!(((!(((p144==1)&&(p220==1))) * EG(!(((((p133==1)&&(p149==1))||((p117==1)&&(p220==1))) + !(EX(!((...1288
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t36, t45, t47, t50, t64, t66, t69, t80, t82, t85, t94, t96, t99, t109, t111, t114, ...279
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-25 15:11:43] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:11:43] [INFO ] Applying decomposition
[2024-05-25 15:11:43] [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/graph5121165363582557057.txt' '-o' '/tmp/graph5121165363582557057.bin' '-w' '/tmp/graph5121165363582557057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5121165363582557057.bin' '-l' '-1' '-v' '-w' '/tmp/graph5121165363582557057.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:11:43] [INFO ] Decomposing Gal with order
[2024-05-25 15:11:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:11:43] [INFO ] Removed a total of 272 redundant transitions.
[2024-05-25 15:11:43] [INFO ] Flatten gal took : 15 ms
[2024-05-25 15:11:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 191 labels/synchronizations in 4 ms.
[2024-05-25 15:11:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14506884364610854579.gal : 2 ms
[2024-05-25 15:11:43] [INFO ] Time to serialize properties into /tmp/CTLFireability10203328831830502782.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/CTLFireability14506884364610854579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10203328831830502782.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19431e+19,0.388345,20648,356,95,38792,2613,541,61321,133,11020,0


Converting to forward existential form...Done !
original formula: A((i1.u13.p41==1) U ((!(((i4.u36.p144==1)&&(u61.p220==1))) * EG(!(((((i4.u33.p133==1)&&(i4.u37.p149==1))||((i3.u24.p117==1)&&(u61.p220==1...321
=> equivalent forward existential formula: [((Init * !(EG(!(((!(((i4.u36.p144==1)&&(u61.p220==1))) * EG(!(((((i4.u33.p133==1)&&(i4.u37.p149==1))||((i3.u24....1631
Reverse transition relation is NOT exact ! Due to transitions i0.t114, i0.t111, i0.t109, i1.t99, i1.t96, i1.t94, i2.t82, i2.t80, i2.u17.t85, i2.u17.t288, i...353
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,1.55203,65792,1,0,159265,6596,4069,215224,774,23157,169067
FORMULA MultiwaySync-PT-none-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-25 15:11:45] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:11:45] [INFO ] Flatten gal took : 8 ms
Total runtime 988161 ms.

BK_STOP 1716649905586

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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="MultiwaySync-PT-none"
export BK_EXAMINATION="CTLFireability"
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 MultiwaySync-PT-none, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654351200234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiwaySync-PT-none.tgz
mv MultiwaySync-PT-none execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;