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.r576-smll-171734919900034.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 MedleyA-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919900034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 75K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717353330569

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:35:32] [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-06-02 18:35:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:35:33] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-06-02 18:35:33] [INFO ] Transformed 115 places.
[2024-06-02 18:35:33] [INFO ] Transformed 257 transitions.
[2024-06-02 18:35:33] [INFO ] Found NUPN structural information;
[2024-06-02 18:35:33] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 107 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Support contains 68 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 254/254 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 109 transition count 242
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 109 transition count 242
Applied a total of 12 rules in 51 ms. Remains 109 /115 variables (removed 6) and now considering 242/254 (removed 12) transitions.
[2024-06-02 18:35:33] [INFO ] Flow matrix only has 241 transitions (discarded 1 similar events)
// Phase 1: matrix 241 rows 109 cols
[2024-06-02 18:35:33] [INFO ] Computed 20 invariants in 19 ms
[2024-06-02 18:35:33] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-06-02 18:35:33] [INFO ] Flow matrix only has 241 transitions (discarded 1 similar events)
[2024-06-02 18:35:33] [INFO ] Invariant cache hit.
[2024-06-02 18:35:34] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:35:34] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-02 18:35:34] [INFO ] Flow matrix only has 241 transitions (discarded 1 similar events)
[2024-06-02 18:35:34] [INFO ] Invariant cache hit.
[2024-06-02 18:35:34] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-02 18:35:37] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 22 ms to minimize.
[2024-06-02 18:35:37] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 4 ms to minimize.
[2024-06-02 18:35:37] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:35:37] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:35:37] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:35:37] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:35:37] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:35:38] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 3 ms to minimize.
[2024-06-02 18:35:38] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-02 18:35:38] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:35:38] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:35:38] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-06-02 18:35:38] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 240/349 variables, 109/142 constraints. Problems are: Problem set: 0 solved, 241 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 93/235 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 1/350 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 0/350 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 236 constraints, problems are : Problem set: 0 solved, 241 unsolved in 13931 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-02 18:35:50] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-06-02 18:35:50] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:35:50] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 240/349 variables, 109/145 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 93/238 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 241/479 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-02 18:35:53] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-06-02 18:35:54] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:35:54] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-02 18:35:58] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-02 18:36:01] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:36:02] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 13 (OVERLAPS) 1/350 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 486 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 22/22 constraints]
After SMT, in 44535ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 44586ms
Starting structural reductions in LTL mode, iteration 1 : 109/115 places, 242/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45667 ms. Remains : 109/115 places, 242/254 transitions.
Support contains 68 out of 109 places after structural reductions.
[2024-06-02 18:36:19] [INFO ] Flatten gal took : 100 ms
[2024-06-02 18:36:19] [INFO ] Flatten gal took : 47 ms
[2024-06-02 18:36:19] [INFO ] Input system was already deterministic with 242 transitions.
Support contains 65 out of 109 places (down from 68) after GAL structural reductions.
RANDOM walk for 40000 steps (2998 resets) in 3989 ms. (10 steps per ms) remains 22/60 properties
BEST_FIRST walk for 4001 steps (47 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (34 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (47 resets) in 40 ms. (97 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4002 steps (42 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (23 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (22 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (53 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (24 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (48 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (43 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (42 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (46 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (49 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (29 resets) in 25 ms. (153 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (43 resets) in 43 ms. (91 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (43 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (35 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (43 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (48 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
[2024-06-02 18:36:21] [INFO ] Flow matrix only has 241 transitions (discarded 1 similar events)
[2024-06-02 18:36:21] [INFO ] Invariant cache hit.
[2024-06-02 18:36:21] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp41 is UNSAT
At refinement iteration 1 (OVERLAPS) 66/97 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 11/108 variables, 5/20 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 239/347 variables, 108/128 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 93/221 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 2/349 variables, 1/222 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1/350 variables, 1/223 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/350 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 223 constraints, problems are : Problem set: 1 solved, 18 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/96 variables, 15/15 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-02 18:36:22] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:36:22] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 2/17 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 12/108 variables, 5/22 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 239/347 variables, 108/130 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 93/223 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 7/230 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/230 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 2/349 variables, 1/231 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 10/241 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/241 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 1/350 variables, 1/242 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/242 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 0/350 variables, 0/242 constraints. Problems are: Problem set: 2 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 242 constraints, problems are : Problem set: 2 solved, 17 unsolved in 2552 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 17/19 constraints, Known Traps: 2/2 constraints]
After SMT, in 3793ms problems are : Problem set: 2 solved, 17 unsolved
Finished Parikh walk after 12136 steps, including 399 resets, run visited all 4 properties in 222 ms. (steps per millisecond=54 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 17 properties in 3507 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-05-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:36:28] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:36:28] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:36:28] [INFO ] Input system was already deterministic with 242 transitions.
Computed a total of 15 stabilizing places and 90 stable transitions
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 14 place count 96 transition count 218
Iterating global reduction 2 with 11 rules applied. Total rules applied 25 place count 96 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 96 transition count 215
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 93 transition count 212
Applied a total of 34 rules in 67 ms. Remains 93 /109 variables (removed 16) and now considering 212/242 (removed 30) transitions.
[2024-06-02 18:36:28] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
// Phase 1: matrix 211 rows 93 cols
[2024-06-02 18:36:28] [INFO ] Computed 20 invariants in 9 ms
[2024-06-02 18:36:28] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 18:36:28] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
[2024-06-02 18:36:28] [INFO ] Invariant cache hit.
[2024-06-02 18:36:28] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:36:28] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-06-02 18:36:28] [INFO ] Redundant transitions in 53 ms returned []
Running 211 sub problems to find dead transitions.
[2024-06-02 18:36:29] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
[2024-06-02 18:36:29] [INFO ] Invariant cache hit.
[2024-06-02 18:36:29] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-02 18:36:31] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 210/303 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 93/207 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 1/304 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/304 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 208 constraints, problems are : Problem set: 0 solved, 211 unsolved in 11536 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 210/303 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 93/207 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 211/418 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-02 18:36:44] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 1/304 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 12 (OVERLAPS) 0/304 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 420 constraints, problems are : Problem set: 0 solved, 211 unsolved in 15838 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 2/2 constraints]
After SMT, in 27573ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 27583ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/109 places, 212/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28056 ms. Remains : 93/109 places, 212/242 transitions.
[2024-06-02 18:36:56] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:36:56] [INFO ] Flatten gal took : 31 ms
[2024-06-02 18:36:56] [INFO ] Input system was already deterministic with 212 transitions.
[2024-06-02 18:36:56] [INFO ] Flatten gal took : 28 ms
[2024-06-02 18:36:56] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:36:56] [INFO ] Time to serialize gal into /tmp/CTLFireability1205348905291090937.gal : 9 ms
[2024-06-02 18:36:56] [INFO ] Time to serialize properties into /tmp/CTLFireability4728837218603979405.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1205348905291090937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4728837218603979405.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.3283e+09,1.97216,46544,2,5895,5,191017,6,0,578,174724,0


Converting to forward existential form...Done !
original formula: AG((EG((p89==0)) * (((p3==0)||(p11==0))||((p69==0)||(p98==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG((p89==0))))] = FALSE * [(FwdU(Init,TRUE) * !((((p3==0)||(p11==0))||((p69==0)||(p98==0)...169
(forward)formula 0,0,1.98617,46544,1,0,8,191017,9,2,601,174724,1
FORMULA MedleyA-PT-05-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 108 transition count 240
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 13 place count 97 transition count 220
Iterating global reduction 0 with 10 rules applied. Total rules applied 23 place count 97 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 97 transition count 217
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 94 transition count 214
Applied a total of 32 rules in 46 ms. Remains 94 /109 variables (removed 15) and now considering 214/242 (removed 28) transitions.
[2024-06-02 18:36:58] [INFO ] Flow matrix only has 213 transitions (discarded 1 similar events)
// Phase 1: matrix 213 rows 94 cols
[2024-06-02 18:36:58] [INFO ] Computed 20 invariants in 5 ms
[2024-06-02 18:36:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 18:36:58] [INFO ] Flow matrix only has 213 transitions (discarded 1 similar events)
[2024-06-02 18:36:58] [INFO ] Invariant cache hit.
[2024-06-02 18:36:59] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:36:59] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-06-02 18:36:59] [INFO ] Redundant transitions in 41 ms returned []
Running 213 sub problems to find dead transitions.
[2024-06-02 18:36:59] [INFO ] Flow matrix only has 213 transitions (discarded 1 similar events)
[2024-06-02 18:36:59] [INFO ] Invariant cache hit.
[2024-06-02 18:36:59] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 18:37:01] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 212/306 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 1/307 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/307 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 209 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9949 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 212/306 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 213/421 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 18:37:14] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 1/307 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 18:37:26] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:37:26] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/307 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 14 (OVERLAPS) 0/307 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 425 constraints, problems are : Problem set: 0 solved, 213 unsolved in 28431 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 4/4 constraints]
After SMT, in 38575ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 38588ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/109 places, 214/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38967 ms. Remains : 94/109 places, 214/242 transitions.
[2024-06-02 18:37:37] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:37:37] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:37:37] [INFO ] Input system was already deterministic with 214 transitions.
[2024-06-02 18:37:37] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:37:37] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:37:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17041170712800035237.gal : 6 ms
[2024-06-02 18:37:37] [INFO ] Time to serialize properties into /tmp/CTLFireability1244698479695040293.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/CTLFireability17041170712800035237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1244698479695040293.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.46464e+09,3.52954,84896,2,6588,5,324285,6,0,584,331142,0


Converting to forward existential form...Done !
original formula: A((p56==1) U AG(A(((p34==1) * AF((((p69==1)&&(p98==1))&&((p100==1)&&(p113==1))))) U !(E((p54==1) U (((p110==1)&&(p112==1))&&(p114==1)))))...157
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((E(!(!(E((p54==1) U (((p110==1)&&(p112==1))&&(p114==1))))) U (!(((p34==1) * !(EG...937
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t12, t15, t16, t17, t18, t20, t23, t24, t25, t30, t31, t33, t...395
Detected timeout of ITS tools.
[2024-06-02 18:38:07] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:38:07] [INFO ] Applying decomposition
[2024-06-02 18:38:07] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2335332021182688009.txt' '-o' '/tmp/graph2335332021182688009.bin' '-w' '/tmp/graph2335332021182688009.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2335332021182688009.bin' '-l' '-1' '-v' '-w' '/tmp/graph2335332021182688009.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:38:08] [INFO ] Decomposing Gal with order
[2024-06-02 18:38:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:38:08] [INFO ] Removed a total of 379 redundant transitions.
[2024-06-02 18:38:08] [INFO ] Flatten gal took : 77 ms
[2024-06-02 18:38:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 13 ms.
[2024-06-02 18:38:08] [INFO ] Time to serialize gal into /tmp/CTLFireability8514094033534816737.gal : 5 ms
[2024-06-02 18:38:08] [INFO ] Time to serialize properties into /tmp/CTLFireability1041437986703662333.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/CTLFireability8514094033534816737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1041437986703662333.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.46464e+09,0.240512,10972,407,67,12381,1570,309,34027,107,2233,0


Converting to forward existential form...Done !
original formula: A((u13.p56==1) U AG(A(((i5.u24.p34==1) * AF((((i2.u14.p69==1)&&(i3.u22.p98==1))&&((i5.u26.p100==1)&&(i5.u28.p113==1))))) U !(E((u13.p54==...221
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((E(!(!(E((u13.p54==1) U (((i5.u26.p110==1)&&(i5.u27.p112==1))&&(i5.u28.p114==1))...1271
Reverse transition relation is NOT exact ! Due to transitions t165, t167, t210, t212, u13.t24, u13.t25, u13.t30, u13.t31, u13.t33, u13.t34, i0.i0.t65, i0.i...573
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,0,6.54219,130828,1,0,192642,4024,2136,499713,566,8553,258029
FORMULA MedleyA-PT-05-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 13 place count 97 transition count 220
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 97 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 97 transition count 217
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 2 with 6 rules applied. Total rules applied 32 place count 94 transition count 214
Applied a total of 32 rules in 36 ms. Remains 94 /109 variables (removed 15) and now considering 214/242 (removed 28) transitions.
[2024-06-02 18:38:14] [INFO ] Flow matrix only has 213 transitions (discarded 1 similar events)
// Phase 1: matrix 213 rows 94 cols
[2024-06-02 18:38:14] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:38:15] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 18:38:15] [INFO ] Flow matrix only has 213 transitions (discarded 1 similar events)
[2024-06-02 18:38:15] [INFO ] Invariant cache hit.
[2024-06-02 18:38:15] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:38:15] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-06-02 18:38:15] [INFO ] Redundant transitions in 32 ms returned []
Running 213 sub problems to find dead transitions.
[2024-06-02 18:38:15] [INFO ] Flow matrix only has 213 transitions (discarded 1 similar events)
[2024-06-02 18:38:15] [INFO ] Invariant cache hit.
[2024-06-02 18:38:15] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 18:38:17] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 212/306 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 1/307 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/307 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 209 constraints, problems are : Problem set: 0 solved, 213 unsolved in 13062 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 212/306 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 213/421 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 1/307 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 0/307 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 422 constraints, problems are : Problem set: 0 solved, 213 unsolved in 15418 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 1/1 constraints]
After SMT, in 28664ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 28671ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/109 places, 214/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29043 ms. Remains : 94/109 places, 214/242 transitions.
[2024-06-02 18:38:43] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:38:43] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:38:44] [INFO ] Input system was already deterministic with 214 transitions.
[2024-06-02 18:38:44] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:38:44] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:38:44] [INFO ] Time to serialize gal into /tmp/CTLFireability13944139256969899561.gal : 5 ms
[2024-06-02 18:38:44] [INFO ] Time to serialize properties into /tmp/CTLFireability7058241242439966846.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/CTLFireability13944139256969899561.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7058241242439966846.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.49874e+09,1.74599,46296,2,4511,5,190244,6,0,584,162142,0


Converting to forward existential form...Done !
original formula: EF((EF((p28==1)) + (AF(E(((p81==1)&&(p84==1)) U (p1==1))) * (AF((p56!=1)) + ((p3==1)&&(p32==1))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * (p28==1))] != FALSE + ([((FwdU(Init,TRUE) * !(EG(!(E(((p81==1)&&(p84==1)) U (p1=...298
(forward)formula 0,1,1.92777,46296,1,0,7,190244,9,1,1178,162142,3
FORMULA MedleyA-PT-05-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 222
Applied a total of 20 rules in 6 ms. Remains 99 /109 variables (removed 10) and now considering 222/242 (removed 20) transitions.
[2024-06-02 18:38:46] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
// Phase 1: matrix 221 rows 99 cols
[2024-06-02 18:38:46] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 18:38:46] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 18:38:46] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:38:46] [INFO ] Invariant cache hit.
[2024-06-02 18:38:46] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:38:46] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-02 18:38:46] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:38:46] [INFO ] Invariant cache hit.
[2024-06-02 18:38:46] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 18:38:48] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:38:49] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 18:38:50] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 220/319 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 93/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 216 constraints, problems are : Problem set: 0 solved, 221 unsolved in 15371 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 221/436 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 437 constraints, problems are : Problem set: 0 solved, 221 unsolved in 14035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints]
After SMT, in 29630ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 29635ms
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 222/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29972 ms. Remains : 99/109 places, 222/242 transitions.
[2024-06-02 18:39:16] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:39:16] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:39:16] [INFO ] Input system was already deterministic with 222 transitions.
[2024-06-02 18:39:16] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:39:16] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:16] [INFO ] Time to serialize gal into /tmp/CTLFireability6375867947028363165.gal : 3 ms
[2024-06-02 18:39:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14521169887651813815.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/CTLFireability6375867947028363165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14521169887651813815.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.47538e+09,2.63113,69380,2,7029,5,284591,6,0,611,250564,0


Converting to forward existential form...Done !
original formula: (EX((AG((p75==0)) + ((EF((((p1==0)||(p100==0))||(p109==0))) + EG((((p36==0)||(p65==0))||((p69==0)||(p77==0))))) * E((((((p1==1)&&(p100==1...345
=> equivalent forward existential formula: ([(Init * !(EX((!(E(TRUE U !((p75==0)))) + ((E(TRUE U (((p1==0)||(p100==0))||(p109==0))) + EG((((p36==0)||(p65==...553
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t9, t10, t11, t12, t13, t14, t15, t20, t21, t22, t23, t31, t32, t44, t46,...378
Detected timeout of ITS tools.
[2024-06-02 18:39:46] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:46] [INFO ] Applying decomposition
[2024-06-02 18:39:46] [INFO ] Flatten gal took : 14 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/graph10257323753538868466.txt' '-o' '/tmp/graph10257323753538868466.bin' '-w' '/tmp/graph10257323753538868466.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10257323753538868466.bin' '-l' '-1' '-v' '-w' '/tmp/graph10257323753538868466.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:39:46] [INFO ] Decomposing Gal with order
[2024-06-02 18:39:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:39:46] [INFO ] Removed a total of 410 redundant transitions.
[2024-06-02 18:39:46] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:39:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 7 ms.
[2024-06-02 18:39:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16144229388819838514.gal : 4 ms
[2024-06-02 18:39:46] [INFO ] Time to serialize properties into /tmp/CTLFireability14256369183332100314.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/CTLFireability16144229388819838514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14256369183332100314.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,2.47538e+09,0.246372,8616,307,69,9773,528,293,20877,85,1867,0


Converting to forward existential form...Done !
original formula: (EX((AG((i3.u18.p75==0)) + ((EF((((i4.u27.p1==0)||(i4.u23.p100==0))||(i4.u27.p109==0))) + EG((((i1.i1.u8.p36==0)||(i1.i1.u15.p65==0))||((...524
=> equivalent forward existential formula: ([(Init * !(EX((!(E(TRUE U !((i3.u18.p75==0)))) + ((E(TRUE U (((i4.u27.p1==0)||(i4.u23.p100==0))||(i4.u27.p109==...796
Reverse transition relation is NOT exact ! Due to transitions t175, t177, u22.t3, u22.t4, u22.t5, u22.t6, u22.t7, u22.t9, u22.t10, u22.t11, u22.t12, u22.t1...544
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,10.151,252144,1,0,387164,1506,2166,1.32304e+06,413,3953,361983
FORMULA MedleyA-PT-05-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 15 place count 95 transition count 216
Iterating global reduction 2 with 12 rules applied. Total rules applied 27 place count 95 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 95 transition count 213
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 92 transition count 210
Applied a total of 36 rules in 30 ms. Remains 92 /109 variables (removed 17) and now considering 210/242 (removed 32) transitions.
[2024-06-02 18:39:56] [INFO ] Flow matrix only has 209 transitions (discarded 1 similar events)
// Phase 1: matrix 209 rows 92 cols
[2024-06-02 18:39:56] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:39:56] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 18:39:56] [INFO ] Flow matrix only has 209 transitions (discarded 1 similar events)
[2024-06-02 18:39:56] [INFO ] Invariant cache hit.
[2024-06-02 18:39:56] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:39:56] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-06-02 18:39:56] [INFO ] Redundant transitions in 56 ms returned []
Running 209 sub problems to find dead transitions.
[2024-06-02 18:39:57] [INFO ] Flow matrix only has 209 transitions (discarded 1 similar events)
[2024-06-02 18:39:57] [INFO ] Invariant cache hit.
[2024-06-02 18:39:57] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 18:39:59] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 208/300 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 93/206 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 1/301 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 0/301 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 207 constraints, problems are : Problem set: 0 solved, 209 unsolved in 11879 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 208/300 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 93/206 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 209/415 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 1/301 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 11 (OVERLAPS) 0/301 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 416 constraints, problems are : Problem set: 0 solved, 209 unsolved in 15668 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 1/1 constraints]
After SMT, in 27738ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 27742ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/109 places, 210/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28238 ms. Remains : 92/109 places, 210/242 transitions.
[2024-06-02 18:40:24] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:40:24] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:40:24] [INFO ] Input system was already deterministic with 210 transitions.
[2024-06-02 18:40:24] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:40:24] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:40:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8621003536638018171.gal : 15 ms
[2024-06-02 18:40:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18113888581181705691.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8621003536638018171.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18113888581181705691.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality18113888581181705691.prop.
RANDOM walk for 40000 steps (3104 resets) in 333 ms. (119 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (288 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 29
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :29 after 46
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :46 after 581
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :581 after 7106
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7106 after 26536
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :26536 after 321651
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :321651 after 1.84266e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.84266e+06 after 1.25419e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.25419e+07 after 5.1485e+07
Reachability property MedleyA-PT-05-CTLFireability-2024-04 is true.
FORMULA MedleyA-PT-05-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.38006e+08,1.80236,39188,2,6688,17,154417,6,0,572,134240,0
Total reachable state count : 238005960

Verifying 1 reachability properties.
Reachability property MedleyA-PT-05-CTLFireability-2024-04 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-05-CTLFireability-2024-04,23472,1.84365,39188,2,526,17,154417,7,0,584,134240,0
Interrupted probabilistic random walk after 1370168 steps, run timeout after 3001 ms. (steps per millisecond=456 ) properties seen :0 out of 1
Probabilistic random walk after 1370168 steps, saw 215019 distinct states, run finished after 3011 ms. (steps per millisecond=455 ) properties seen :0
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 15 place count 95 transition count 216
Iterating global reduction 2 with 12 rules applied. Total rules applied 27 place count 95 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 95 transition count 213
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 92 transition count 210
Applied a total of 36 rules in 42 ms. Remains 92 /109 variables (removed 17) and now considering 210/242 (removed 32) transitions.
[2024-06-02 18:40:28] [INFO ] Flow matrix only has 209 transitions (discarded 1 similar events)
[2024-06-02 18:40:28] [INFO ] Invariant cache hit.
[2024-06-02 18:40:28] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 18:40:28] [INFO ] Flow matrix only has 209 transitions (discarded 1 similar events)
[2024-06-02 18:40:28] [INFO ] Invariant cache hit.
[2024-06-02 18:40:28] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:40:28] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-06-02 18:40:28] [INFO ] Redundant transitions in 54 ms returned []
Running 209 sub problems to find dead transitions.
[2024-06-02 18:40:28] [INFO ] Flow matrix only has 209 transitions (discarded 1 similar events)
[2024-06-02 18:40:28] [INFO ] Invariant cache hit.
[2024-06-02 18:40:28] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 18:40:31] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 208/300 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 93/206 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 1/301 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 0/301 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 207 constraints, problems are : Problem set: 0 solved, 209 unsolved in 12213 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 208/300 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 93/206 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 209/415 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 1/301 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 11 (OVERLAPS) 0/301 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 416 constraints, problems are : Problem set: 0 solved, 209 unsolved in 14599 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 1/1 constraints]
After SMT, in 27028ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 27033ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/109 places, 210/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27536 ms. Remains : 92/109 places, 210/242 transitions.
[2024-06-02 18:40:55] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:40:55] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:40:55] [INFO ] Input system was already deterministic with 210 transitions.
[2024-06-02 18:40:55] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:40:55] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:40:55] [INFO ] Time to serialize gal into /tmp/CTLFireability16670304116824104307.gal : 4 ms
[2024-06-02 18:40:55] [INFO ] Time to serialize properties into /tmp/CTLFireability9761078677908170126.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/CTLFireability16670304116824104307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9761078677908170126.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.19461e+09,3.14546,74816,2,5727,5,284842,6,0,572,289859,0


Converting to forward existential form...Done !
original formula: EF(EG(((p3==1)&&(p8==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p3==1)&&(p8==1)))] != FALSE
Hit Full ! (commute/partial/dont) 161/47/49
(forward)formula 0,1,5.8782,96200,1,0,10,472290,19,2,3677,323151,9
FORMULA MedleyA-PT-05-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 14 place count 96 transition count 218
Iterating global reduction 2 with 11 rules applied. Total rules applied 25 place count 96 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 96 transition count 216
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 94 transition count 214
Applied a total of 31 rules in 23 ms. Remains 94 /109 variables (removed 15) and now considering 214/242 (removed 28) transitions.
[2024-06-02 18:41:01] [INFO ] Flow matrix only has 213 transitions (discarded 1 similar events)
// Phase 1: matrix 213 rows 94 cols
[2024-06-02 18:41:01] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:41:01] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 18:41:01] [INFO ] Flow matrix only has 213 transitions (discarded 1 similar events)
[2024-06-02 18:41:01] [INFO ] Invariant cache hit.
[2024-06-02 18:41:01] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:41:01] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-06-02 18:41:01] [INFO ] Redundant transitions in 28 ms returned []
Running 213 sub problems to find dead transitions.
[2024-06-02 18:41:01] [INFO ] Flow matrix only has 213 transitions (discarded 1 similar events)
[2024-06-02 18:41:01] [INFO ] Invariant cache hit.
[2024-06-02 18:41:01] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 18:41:03] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:41:04] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 212/306 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 93/209 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 1/307 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/307 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 210 constraints, problems are : Problem set: 0 solved, 213 unsolved in 10119 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 212/306 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 93/209 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 213/422 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 18:41:15] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 1/307 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (OVERLAPS) 0/307 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 424 constraints, problems are : Problem set: 0 solved, 213 unsolved in 14361 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 3/3 constraints]
After SMT, in 24626ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 24629ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/109 places, 214/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24947 ms. Remains : 94/109 places, 214/242 transitions.
[2024-06-02 18:41:26] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:41:26] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:41:26] [INFO ] Input system was already deterministic with 214 transitions.
[2024-06-02 18:41:26] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:41:26] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:41:26] [INFO ] Time to serialize gal into /tmp/CTLFireability17004872525401739421.gal : 2 ms
[2024-06-02 18:41:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6420376670082110111.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/CTLFireability17004872525401739421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6420376670082110111.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.38033e+09,2.0712,49512,2,6108,5,205041,6,0,584,181320,0


Converting to forward existential form...Done !
original formula: EF(((((p36==1)&&(p65==1))&&((p69==1)&&(p77==1))) * (((EG((((p36==1)&&(p37==1))&&(p62==1))) + (p93==1)) + (((p72==1)&&(p95==1))||(((p34==1...219
=> equivalent forward existential formula: (([FwdG(((FwdU(Init,TRUE) * (((p36==1)&&(p65==1))&&((p69==1)&&(p77==1)))) * (((p1==0)||(p69==0))||(p74==0))),(((...501
(forward)formula 0,1,4.16693,67988,1,0,15,342911,21,5,3515,181320,9
FORMULA MedleyA-PT-05-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 222
Applied a total of 20 rules in 3 ms. Remains 99 /109 variables (removed 10) and now considering 222/242 (removed 20) transitions.
[2024-06-02 18:41:30] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
// Phase 1: matrix 221 rows 99 cols
[2024-06-02 18:41:30] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:41:30] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:41:30] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:41:30] [INFO ] Invariant cache hit.
[2024-06-02 18:41:30] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:41:31] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-02 18:41:31] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:41:31] [INFO ] Invariant cache hit.
[2024-06-02 18:41:31] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 18:41:33] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/320 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 214 constraints, problems are : Problem set: 0 solved, 221 unsolved in 13939 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 221/434 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 435 constraints, problems are : Problem set: 0 solved, 221 unsolved in 15231 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
After SMT, in 29340ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 29342ms
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 222/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29618 ms. Remains : 99/109 places, 222/242 transitions.
[2024-06-02 18:42:00] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:42:00] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:42:00] [INFO ] Input system was already deterministic with 222 transitions.
[2024-06-02 18:42:00] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:42:00] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:42:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9431052331006418169.gal : 4 ms
[2024-06-02 18:42:00] [INFO ] Time to serialize properties into /tmp/CTLFireability1235408854918246984.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/CTLFireability9431052331006418169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1235408854918246984.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,2.72928e+09,2.64383,55364,2,6962,5,225323,6,0,611,199251,0


Converting to forward existential form...Done !
original formula: E(EG(((AG(((((p67==1)&&(p100==1))&&(p113==1))||(p94==1))) + !(EX((((p3==1)&&(p11==1))&&(p67==1))))) + E(A((p17==1) U (p23==1)) U (((p2==1...200
=> equivalent forward existential formula: [(FwdU(Init,EG(((!(E(TRUE U !(((((p67==1)&&(p100==1))&&(p113==1))||(p94==1))))) + !(EX((((p3==1)&&(p11==1))&&(p6...321
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t11, t12, t18, t19, t20, t21, t29, t30, t42, t44, t45, t47, t48, ...324
Detected timeout of ITS tools.
[2024-06-02 18:42:30] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:42:30] [INFO ] Applying decomposition
[2024-06-02 18:42:30] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14206199535985109182.txt' '-o' '/tmp/graph14206199535985109182.bin' '-w' '/tmp/graph14206199535985109182.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14206199535985109182.bin' '-l' '-1' '-v' '-w' '/tmp/graph14206199535985109182.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:42:30] [INFO ] Decomposing Gal with order
[2024-06-02 18:42:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:42:30] [INFO ] Removed a total of 367 redundant transitions.
[2024-06-02 18:42:30] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:42:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 7 ms.
[2024-06-02 18:42:30] [INFO ] Time to serialize gal into /tmp/CTLFireability7538290060770049764.gal : 3 ms
[2024-06-02 18:42:30] [INFO ] Time to serialize properties into /tmp/CTLFireability1840963864432542703.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/CTLFireability7538290060770049764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1840963864432542703.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,2.72928e+09,0.215012,9944,329,85,12012,612,325,26467,110,1714,0


Converting to forward existential form...Done !
original formula: E(EG(((AG(((((i4.u24.p67==1)&&(i4.u21.p100==1))&&(i4.u27.p113==1))||(u20.p94==1))) + !(EX((((i0.u5.p3==1)&&(i0.u2.p11==1))&&(i4.u24.p67==...278
=> equivalent forward existential formula: [(FwdU(Init,EG(((!(E(TRUE U !(((((i4.u24.p67==1)&&(i4.u21.p100==1))&&(i4.u27.p113==1))||(u20.p94==1))))) + !(EX(...411
Reverse transition relation is NOT exact ! Due to transitions u20.t3, u20.t4, u20.t5, u20.t6, u20.t7, u20.t8, u20.t9, u20.t11, u20.t12, i0.t221, i0.t71, i0...503
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 222
Applied a total of 20 rules in 3 ms. Remains 99 /109 variables (removed 10) and now considering 222/242 (removed 20) transitions.
[2024-06-02 18:43:00] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
// Phase 1: matrix 221 rows 99 cols
[2024-06-02 18:43:00] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:43:00] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 18:43:00] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:43:00] [INFO ] Invariant cache hit.
[2024-06-02 18:43:01] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:43:01] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-02 18:43:01] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:43:01] [INFO ] Invariant cache hit.
[2024-06-02 18:43:01] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 18:43:03] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/320 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 214 constraints, problems are : Problem set: 0 solved, 221 unsolved in 14585 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 221/434 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 435 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16276 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
After SMT, in 31073ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 31077ms
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 222/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31494 ms. Remains : 99/109 places, 222/242 transitions.
[2024-06-02 18:43:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:43:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:43:32] [INFO ] Input system was already deterministic with 222 transitions.
[2024-06-02 18:43:32] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:43:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:43:32] [INFO ] Time to serialize gal into /tmp/CTLFireability16948071238050626862.gal : 4 ms
[2024-06-02 18:43:32] [INFO ] Time to serialize properties into /tmp/CTLFireability5668996467074087695.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/CTLFireability16948071238050626862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5668996467074087695.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.66233e+09,3.0094,62748,2,8196,5,251781,6,0,611,250916,0


Converting to forward existential form...Done !
original formula: EX(AG(!(E((p89==1) U (p55==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(E((p89==1) U (p55==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t14, t15, t18, t19, t20, t21, t23, t26, t28, t29, ...369
Detected timeout of ITS tools.
[2024-06-02 18:44:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:44:02] [INFO ] Applying decomposition
[2024-06-02 18:44:02] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5747512071111504431.txt' '-o' '/tmp/graph5747512071111504431.bin' '-w' '/tmp/graph5747512071111504431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5747512071111504431.bin' '-l' '-1' '-v' '-w' '/tmp/graph5747512071111504431.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:44:02] [INFO ] Decomposing Gal with order
[2024-06-02 18:44:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:44:02] [INFO ] Removed a total of 442 redundant transitions.
[2024-06-02 18:44:02] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:44:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 7 ms.
[2024-06-02 18:44:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3650960536010768385.gal : 2 ms
[2024-06-02 18:44:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9853651024022252528.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/CTLFireability3650960536010768385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9853651024022252528.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,2.66233e+09,0.218481,10484,414,32,13210,190,347,30380,53,504,0


Converting to forward existential form...Done !
original formula: EX(AG(!(E((i4.u25.p89==1) U (i2.u15.p55==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(E((i4.u25.p89==1) U (i2.u15.p55==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t70, i0.i0.t71, i0.i0.t221, i0.i0.u3.t73, i0.i0.u3.t74, i0.i0.u5.t68, i0.i1.t56, i0.i1....597
(forward)formula 0,0,2.07461,53780,1,0,83549,365,2317,229188,238,706,143191
FORMULA MedleyA-PT-05-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 100 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 100 transition count 224
Applied a total of 18 rules in 3 ms. Remains 100 /109 variables (removed 9) and now considering 224/242 (removed 18) transitions.
[2024-06-02 18:44:04] [INFO ] Flow matrix only has 223 transitions (discarded 1 similar events)
// Phase 1: matrix 223 rows 100 cols
[2024-06-02 18:44:04] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 18:44:04] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 18:44:04] [INFO ] Flow matrix only has 223 transitions (discarded 1 similar events)
[2024-06-02 18:44:04] [INFO ] Invariant cache hit.
[2024-06-02 18:44:04] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:44:04] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-06-02 18:44:04] [INFO ] Flow matrix only has 223 transitions (discarded 1 similar events)
[2024-06-02 18:44:04] [INFO ] Invariant cache hit.
[2024-06-02 18:44:04] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 18:44:06] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 222/322 variables, 100/121 constraints. Problems are: Problem set: 0 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 93/214 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 1/323 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/323 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 215 constraints, problems are : Problem set: 0 solved, 223 unsolved in 11337 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 100/100 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 18:44:17] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 222/322 variables, 100/122 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 93/215 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 223/438 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 1/323 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (OVERLAPS) 0/323 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 439 constraints, problems are : Problem set: 0 solved, 223 unsolved in 17671 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 100/100 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints]
After SMT, in 29135ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 29138ms
Starting structural reductions in LTL mode, iteration 1 : 100/109 places, 224/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29446 ms. Remains : 100/109 places, 224/242 transitions.
[2024-06-02 18:44:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:44:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:44:34] [INFO ] Input system was already deterministic with 224 transitions.
[2024-06-02 18:44:34] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:44:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:44:34] [INFO ] Time to serialize gal into /tmp/CTLFireability16139055640678498683.gal : 3 ms
[2024-06-02 18:44:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7770063421336390792.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/CTLFireability16139055640678498683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7770063421336390792.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.92743e+09,3.04422,62124,2,7986,5,256004,6,0,617,230145,0


Converting to forward existential form...Done !
original formula: E(((EF(EG((p81!=1))) + ((p3==1)&&(p32==1))) + (EX(((AF((((p3==1)&&(p32==1))&&((p69==1)&&(p74==1)))) + (((p69==1)&&(p98==1))&&((p100==1)&&...665
=> equivalent forward existential formula: [((FwdU(Init,((E(TRUE U EG((p81!=1))) + ((p3==1)&&(p32==1))) + (EX(((!(EG(!((((p3==1)&&(p32==1))&&((p69==1)&&(p7...1085
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t15, t20, t21, t22, t23, t31, t32, t34, t35, ...339
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 18:45:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:45:04] [INFO ] Applying decomposition
[2024-06-02 18:45:04] [INFO ] Flatten gal took : 10 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/graph17130950588154735865.txt' '-o' '/tmp/graph17130950588154735865.bin' '-w' '/tmp/graph17130950588154735865.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17130950588154735865.bin' '-l' '-1' '-v' '-w' '/tmp/graph17130950588154735865.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:45:04] [INFO ] Decomposing Gal with order
[2024-06-02 18:45:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:45:04] [INFO ] Removed a total of 387 redundant transitions.
[2024-06-02 18:45:04] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:45:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 7 ms.
[2024-06-02 18:45:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14116576195351934507.gal : 2 ms
[2024-06-02 18:45:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5452595695327189921.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/CTLFireability14116576195351934507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5452595695327189921.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,2.92743e+09,0.220766,10256,352,61,12044,844,340,29909,103,1381,0


Converting to forward existential form...Done !
original formula: E(((EF(EG((i2.u18.p81!=1))) + ((i0.i1.u0.p3==1)&&(i0.i1.u6.p32==1))) + (EX(((AF((((i0.i1.u0.p3==1)&&(i0.i1.u6.p32==1))&&((i2.u14.p69==1)&...1008
=> equivalent forward existential formula: [((FwdU(Init,((E(TRUE U EG((i2.u18.p81!=1))) + ((i0.i1.u0.p3==1)&&(i0.i1.u6.p32==1))) + (EX(((!(EG(!((((i0.i1.u0...1590
Reverse transition relation is NOT exact ! Due to transitions u13.t31, u13.t32, u13.t34, u13.t35, i0.i0.t72, i0.i0.t73, i0.i0.t223, i0.i0.u3.t75, i0.i0.u3....520
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,1,7.28284,141200,1,0,216554,2864,2742,506883,613,5339,256170
FORMULA MedleyA-PT-05-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 15 place count 95 transition count 216
Iterating global reduction 2 with 12 rules applied. Total rules applied 27 place count 95 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 95 transition count 213
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 2 with 6 rules applied. Total rules applied 36 place count 92 transition count 210
Applied a total of 36 rules in 21 ms. Remains 92 /109 variables (removed 17) and now considering 210/242 (removed 32) transitions.
[2024-06-02 18:45:11] [INFO ] Flow matrix only has 209 transitions (discarded 1 similar events)
// Phase 1: matrix 209 rows 92 cols
[2024-06-02 18:45:11] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 18:45:11] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 18:45:11] [INFO ] Flow matrix only has 209 transitions (discarded 1 similar events)
[2024-06-02 18:45:11] [INFO ] Invariant cache hit.
[2024-06-02 18:45:11] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:45:12] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-06-02 18:45:12] [INFO ] Redundant transitions in 36 ms returned []
Running 209 sub problems to find dead transitions.
[2024-06-02 18:45:12] [INFO ] Flow matrix only has 209 transitions (discarded 1 similar events)
[2024-06-02 18:45:12] [INFO ] Invariant cache hit.
[2024-06-02 18:45:12] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 18:45:14] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 208/300 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 93/206 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 1/301 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 0/301 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 207 constraints, problems are : Problem set: 0 solved, 209 unsolved in 11507 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 208/300 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 93/206 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 209/415 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 1/301 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 11 (OVERLAPS) 0/301 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 416 constraints, problems are : Problem set: 0 solved, 209 unsolved in 15315 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 1/1 constraints]
After SMT, in 26967ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 26970ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/109 places, 210/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27498 ms. Remains : 92/109 places, 210/242 transitions.
[2024-06-02 18:45:39] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:45:39] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:45:39] [INFO ] Input system was already deterministic with 210 transitions.
[2024-06-02 18:45:39] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:45:39] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:45:39] [INFO ] Time to serialize gal into /tmp/CTLFireability15980418803756107531.gal : 2 ms
[2024-06-02 18:45:39] [INFO ] Time to serialize properties into /tmp/CTLFireability1627813796662480975.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/CTLFireability15980418803756107531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1627813796662480975.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.19461e+09,3.22668,75896,2,5727,5,284842,6,0,572,289859,0


Converting to forward existential form...Done !
original formula: AF((EF((EG((((p3==1)&&(p32==1))&&((p100==1)&&(p103==1)))) * AF((((p36==0)||(p65==0))||((p100==0)||(p105==0)))))) + ((AG((((p36==0)||(p44=...244
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (EG((((p3==1)&&(p32==1))&&((p100==1)&&(p103==1)))) * !(EG(!((((p36==0)||(p65==0))||((p100...313
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t15, t16, t17, t18, t24, t25, t37, t39, t40, t42, t43, t46, t47, ...346
Detected timeout of ITS tools.
[2024-06-02 18:46:09] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:46:09] [INFO ] Applying decomposition
[2024-06-02 18:46:09] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5920765708995055623.txt' '-o' '/tmp/graph5920765708995055623.bin' '-w' '/tmp/graph5920765708995055623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5920765708995055623.bin' '-l' '-1' '-v' '-w' '/tmp/graph5920765708995055623.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:46:09] [INFO ] Decomposing Gal with order
[2024-06-02 18:46:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:46:09] [INFO ] Removed a total of 379 redundant transitions.
[2024-06-02 18:46:09] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:46:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 6 ms.
[2024-06-02 18:46:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8361785524669233432.gal : 2 ms
[2024-06-02 18:46:09] [INFO ] Time to serialize properties into /tmp/CTLFireability4493429045143260072.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/CTLFireability8361785524669233432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4493429045143260072.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.19461e+09,0.121907,8068,290,64,7927,333,310,22234,92,825,0


Converting to forward existential form...Done !
original formula: AF((EF((EG((((i0.i1.u0.p3==1)&&(i0.i1.u6.p32==1))&&((i4.u26.p100==1)&&(i4.u23.p103==1)))) * AF((((i1.u13.p36==0)||(i1.u13.p65==0))||((i4....371
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (EG((((i0.i1.u0.p3==1)&&(i0.i1.u6.p32==1))&&((i4.u26.p100==1)&&(i4.u23.p103==1)))) * !(EG...440
Reverse transition relation is NOT exact ! Due to transitions t162, t164, t206, t208, i0.i0.t61, i0.i0.t62, i0.i0.t197, i0.i0.u3.t64, i0.i0.u3.t65, i0.i0.u...481
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,1,2.45113,70900,1,0,113020,3011,2227,330139,481,13295,126972
FORMULA MedleyA-PT-05-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 220
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 220
Applied a total of 22 rules in 2 ms. Remains 98 /109 variables (removed 11) and now considering 220/242 (removed 22) transitions.
[2024-06-02 18:46:11] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
// Phase 1: matrix 219 rows 98 cols
[2024-06-02 18:46:11] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:46:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 18:46:11] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 18:46:11] [INFO ] Invariant cache hit.
[2024-06-02 18:46:12] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:46:12] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-06-02 18:46:12] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 18:46:12] [INFO ] Invariant cache hit.
[2024-06-02 18:46:12] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-02 18:46:14] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/317 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 213 constraints, problems are : Problem set: 0 solved, 219 unsolved in 13287 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 219/431 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 432 constraints, problems are : Problem set: 0 solved, 219 unsolved in 15220 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 1/1 constraints]
After SMT, in 28735ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 28744ms
Starting structural reductions in LTL mode, iteration 1 : 98/109 places, 220/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29071 ms. Remains : 98/109 places, 220/242 transitions.
[2024-06-02 18:46:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:46:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:46:40] [INFO ] Input system was already deterministic with 220 transitions.
[2024-06-02 18:46:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:46:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:46:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11402348850609546126.gal : 2 ms
[2024-06-02 18:46:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6536080113573758000.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/CTLFireability11402348850609546126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6536080113573758000.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.39146e+09,2.8134,56864,2,6254,5,228382,6,0,605,220668,0


Converting to forward existential form...Done !
original formula: E(((p55==1) * !(AG((EX((((p36==1)&&(p50==1))&&(p67==1))) * AX((((p36==1)&&(p44==1))&&(p67==1))))))) U AG(AX(EF(((((p34==1)&&(p100==1))&&(...202
=> equivalent forward existential formula: [(FwdU(Init,((p55==1) * !(!(E(TRUE U !((EX((((p36==1)&&(p50==1))&&(p67==1))) * !(EX(!((((p36==1)&&(p44==1))&&(p6...290
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t9, t10, t13, t16, t17, t18, t19, t21, t24, t26, t27, t28, t34, t35, ...402
Detected timeout of ITS tools.
[2024-06-02 18:47:10] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:47:10] [INFO ] Applying decomposition
[2024-06-02 18:47:10] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3484870577559856892.txt' '-o' '/tmp/graph3484870577559856892.bin' '-w' '/tmp/graph3484870577559856892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3484870577559856892.bin' '-l' '-1' '-v' '-w' '/tmp/graph3484870577559856892.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:47:11] [INFO ] Decomposing Gal with order
[2024-06-02 18:47:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:47:11] [INFO ] Removed a total of 397 redundant transitions.
[2024-06-02 18:47:11] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:47:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2024-06-02 18:47:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3777856768621143768.gal : 2 ms
[2024-06-02 18:47:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8265478284502413969.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/CTLFireability3777856768621143768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8265478284502413969.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,2.39146e+09,0.150989,8644,400,58,9194,318,311,22983,92,684,0


Converting to forward existential form...Done !
original formula: E(((i2.u12.p55==1) * !(AG((EX((((i2.u6.p36==1)&&(i1.u11.p50==1))&&(i5.u27.p67==1))) * AX((((i2.u6.p36==1)&&(i1.u9.p44==1))&&(i5.u27.p67==...288
=> equivalent forward existential formula: [(FwdU(Init,((i2.u12.p55==1) * !(!(E(TRUE U !((EX((((i2.u6.p36==1)&&(i1.u11.p50==1))&&(i5.u27.p67==1))) * !(EX(!...376
Reverse transition relation is NOT exact ! Due to transitions t173, t175, t177, t179, i0.t219, i0.t69, i0.t68, i0.u2.t71, i0.u2.t72, i0.u4.t66, i0.u5.t53, ...573
(forward)formula 0,0,4.54656,121372,1,0,174273,5108,2162,598720,488,28591,245615
FORMULA MedleyA-PT-05-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 218
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 218
Applied a total of 24 rules in 2 ms. Remains 97 /109 variables (removed 12) and now considering 218/242 (removed 24) transitions.
[2024-06-02 18:47:15] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 18:47:15] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 18:47:15] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 18:47:15] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:47:15] [INFO ] Invariant cache hit.
[2024-06-02 18:47:15] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:47:15] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:47:15] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:47:15] [INFO ] Invariant cache hit.
[2024-06-02 18:47:15] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:47:17] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 12592 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 18362 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 31096ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 31099ms
Starting structural reductions in LTL mode, iteration 1 : 97/109 places, 218/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31391 ms. Remains : 97/109 places, 218/242 transitions.
[2024-06-02 18:47:47] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:47:47] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:47:47] [INFO ] Input system was already deterministic with 218 transitions.
[2024-06-02 18:47:47] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:47:47] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:47:47] [INFO ] Time to serialize gal into /tmp/CTLFireability17771036120997657808.gal : 2 ms
[2024-06-02 18:47:47] [INFO ] Time to serialize properties into /tmp/CTLFireability13750906544759429130.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/CTLFireability17771036120997657808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13750906544759429130.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,2.19389e+09,2.12947,50564,2,5366,5,203096,6,0,599,177228,0


Converting to forward existential form...Done !
original formula: AX(EF(AG(AX((((p36==0)||(p50==0))||((p69==0)||(p98==0)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(!(EX(!((((p36==0)||(p50==0))||((p69==0)||(p98==0))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t9, t10, t16, t17, t18, t19, t27, t28, t40, t42, t43, t45, t46, t51, t52,...353
(forward)formula 0,1,14.0691,268288,1,0,372,1.41696e+06,456,149,5385,1.00214e+06,486
FORMULA MedleyA-PT-05-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 218
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 218
Applied a total of 24 rules in 2 ms. Remains 97 /109 variables (removed 12) and now considering 218/242 (removed 24) transitions.
[2024-06-02 18:48:01] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:48:01] [INFO ] Invariant cache hit.
[2024-06-02 18:48:01] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 18:48:01] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:48:01] [INFO ] Invariant cache hit.
[2024-06-02 18:48:01] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:48:01] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:48:01] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:48:01] [INFO ] Invariant cache hit.
[2024-06-02 18:48:01] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:48:03] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 12667 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15519 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 28325ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 28328ms
Starting structural reductions in LTL mode, iteration 1 : 97/109 places, 218/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28614 ms. Remains : 97/109 places, 218/242 transitions.
[2024-06-02 18:48:29] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:48:29] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:48:29] [INFO ] Input system was already deterministic with 218 transitions.
[2024-06-02 18:48:29] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:48:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:48:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16891264587332113366.gal : 2 ms
[2024-06-02 18:48:29] [INFO ] Time to serialize properties into /tmp/CTLFireability18187345491873659332.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/CTLFireability16891264587332113366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18187345491873659332.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,2.19389e+09,1.99626,50300,2,5366,5,203096,6,0,599,177228,0


Converting to forward existential form...Done !
original formula: AX(EF(EG((E(((p81==1)&&(p84==1)) U (p1==1)) + ((AF((p62==1)) * (p9==1)) * (p12==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EG((E(((p81==1)&&(p84==1)) U (p1==1)) + ((!(EG(!((p62==1)))) * (p9==1)) * (p12==1)))))))...164
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t9, t10, t16, t17, t18, t19, t27, t28, t40, t42, t43, t45, t46, t51, t52,...353
Detected timeout of ITS tools.
[2024-06-02 18:48:59] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:48:59] [INFO ] Applying decomposition
[2024-06-02 18:48:59] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8115881372454142843.txt' '-o' '/tmp/graph8115881372454142843.bin' '-w' '/tmp/graph8115881372454142843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8115881372454142843.bin' '-l' '-1' '-v' '-w' '/tmp/graph8115881372454142843.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:49:00] [INFO ] Decomposing Gal with order
[2024-06-02 18:49:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:49:00] [INFO ] Removed a total of 431 redundant transitions.
[2024-06-02 18:49:00] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:49:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 4 ms.
[2024-06-02 18:49:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17361098004170624196.gal : 2 ms
[2024-06-02 18:49:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6596622191049701173.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/CTLFireability17361098004170624196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6596622191049701173.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,2.19389e+09,0.115969,8080,282,23,8281,140,321,19965,47,367,0


Converting to forward existential form...Done !
original formula: AX(EF(EG((E(((i2.u20.p81==1)&&(i2.u21.p84==1)) U (i4.u29.p1==1)) + ((AF((i1.i1.u14.p62==1)) * (i0.i0.u2.p9==1)) * (i0.i0.u3.p12==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EG((E(((i2.u20.p81==1)&&(i2.u21.p84==1)) U (i4.u29.p1==1)) + ((!(EG(!((i1.i1.u14.p62==1)...213
Reverse transition relation is NOT exact ! Due to transitions t170, t172, t174, t176, i0.i0.t66, i0.i0.t67, i0.i0.t217, i0.i0.u3.t69, i0.i0.u3.t70, i0.i0.u...516
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,1,3.57786,99424,1,0,146904,481,2211,499147,217,1240,175121
FORMULA MedleyA-PT-05-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 108 transition count 240
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 3 place count 107 transition count 240
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 14 place count 96 transition count 218
Iterating global reduction 0 with 11 rules applied. Total rules applied 25 place count 96 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 96 transition count 215
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 0 with 6 rules applied. Total rules applied 34 place count 93 transition count 212
Applied a total of 34 rules in 16 ms. Remains 93 /109 variables (removed 16) and now considering 212/242 (removed 30) transitions.
[2024-06-02 18:49:03] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
// Phase 1: matrix 211 rows 93 cols
[2024-06-02 18:49:03] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 18:49:03] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 18:49:03] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
[2024-06-02 18:49:03] [INFO ] Invariant cache hit.
[2024-06-02 18:49:04] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:49:04] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-06-02 18:49:04] [INFO ] Redundant transitions in 48 ms returned []
Running 211 sub problems to find dead transitions.
[2024-06-02 18:49:04] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
[2024-06-02 18:49:04] [INFO ] Invariant cache hit.
[2024-06-02 18:49:04] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-02 18:49:06] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:49:06] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:49:06] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 210/303 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 93/209 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 1/304 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/304 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 210 constraints, problems are : Problem set: 0 solved, 211 unsolved in 12338 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 210/303 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 93/209 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 211/420 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 1/304 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (OVERLAPS) 0/304 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 421 constraints, problems are : Problem set: 0 solved, 211 unsolved in 15264 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 3/3 constraints]
After SMT, in 27784ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 27788ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/109 places, 212/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28250 ms. Remains : 93/109 places, 212/242 transitions.
[2024-06-02 18:49:31] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:49:31] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:49:31] [INFO ] Input system was already deterministic with 212 transitions.
[2024-06-02 18:49:31] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:49:31] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:49:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15327544735718597794.gal : 2 ms
[2024-06-02 18:49:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7819082700668240583.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/CTLFireability15327544735718597794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7819082700668240583.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.19523e+09,2.05738,51708,2,5429,5,201518,6,0,578,185514,0


Converting to forward existential form...Done !
original formula: EF((((EF(((p20==1)||(((p69==1)&&(p98==1))&&((p100==1)&&(p113==1))))) * (p3==1)) * ((p17==1)&&(p69==1))) * ((p98==1) * ((AG(EF(((p48==1)&&...250
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * ((E(TRUE U ((p20==1)||(((p69==1)&&(p98==1))&&((p100==1)&&(p113==1))))) * (p3==1)) * ((p1...634
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t15, t16, t17, t18, t24, t25, t37, t39, t40, t42, t43, t46, t47, ...367
Detected timeout of ITS tools.
[2024-06-02 18:50:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:50:02] [INFO ] Applying decomposition
[2024-06-02 18:50:02] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17054589997876470648.txt' '-o' '/tmp/graph17054589997876470648.bin' '-w' '/tmp/graph17054589997876470648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17054589997876470648.bin' '-l' '-1' '-v' '-w' '/tmp/graph17054589997876470648.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:50:02] [INFO ] Decomposing Gal with order
[2024-06-02 18:50:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:50:02] [INFO ] Removed a total of 379 redundant transitions.
[2024-06-02 18:50:02] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:50:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 3 ms.
[2024-06-02 18:50:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1389699746240978026.gal : 19 ms
[2024-06-02 18:50:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8083097162403413159.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/CTLFireability1389699746240978026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8083097162403413159.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.19523e+09,0.134348,7320,292,75,7519,324,318,12815,98,633,0


Converting to forward existential form...Done !
original formula: EF((((EF(((i4.u5.p20==1)||(((i2.u14.p69==1)&&(i3.u21.p98==1))&&((i5.u27.p100==1)&&(i5.u28.p113==1))))) * (i4.u5.p3==1)) * ((i0.u4.p17==1)...375
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * ((E(TRUE U ((i4.u5.p20==1)||(((i2.u14.p69==1)&&(i3.u21.p98==1))&&((i5.u27.p100==1)&&(i5....879
Reverse transition relation is NOT exact ! Due to transitions t163, t165, t199, t208, t210, i0.t198, i0.t64, i0.t63, i0.u0.t57, i0.u2.t66, i0.u2.t67, i0.u4...517
(forward)formula 0,1,0.998394,27912,1,0,44811,1915,2073,111810,510,5137,86275
FORMULA MedleyA-PT-05-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-06-02 18:50:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:50:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:50:03] [INFO ] Applying decomposition
[2024-06-02 18:50:03] [INFO ] Flatten gal took : 10 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/graph1164696121087792644.txt' '-o' '/tmp/graph1164696121087792644.bin' '-w' '/tmp/graph1164696121087792644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1164696121087792644.bin' '-l' '-1' '-v' '-w' '/tmp/graph1164696121087792644.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:50:03] [INFO ] Decomposing Gal with order
[2024-06-02 18:50:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:50:03] [INFO ] Removed a total of 315 redundant transitions.
[2024-06-02 18:50:03] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:50:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 3 ms.
[2024-06-02 18:50:03] [INFO ] Time to serialize gal into /tmp/CTLFireability17514446678879011233.gal : 2 ms
[2024-06-02 18:50:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10536611814347357695.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/CTLFireability17514446678879011233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10536611814347357695.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,4.51728e+09,0.639774,14864,795,260,19472,1136,282,50671,171,6402,0


Converting to forward existential form...Done !
original formula: E(EG(((AG(((((i4.u22.p67==1)&&(i4.u19.p100==1))&&(i4.u25.p113==1))||(u18.p94==1))) + !(EX((((u5.p3==1)&&(i0.u2.p11==1))&&(i4.u22.p67==1))...266
=> equivalent forward existential formula: [(FwdU(Init,EG(((!(E(TRUE U !(((((i4.u22.p67==1)&&(i4.u19.p100==1))&&(i4.u25.p113==1))||(u18.p94==1))))) + !(EX(...393
Reverse transition relation is NOT exact ! Due to transitions u18.t3, u18.t4, u18.t5, u18.t6, u18.t7, u18.t8, u18.t9, u18.t10, u18.t11, u18.t12, u18.t13, u...880
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,196.279,2203020,1,0,2.9307e+06,52350,678,7.5388e+06,432,519257,831090
FORMULA MedleyA-PT-05-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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

BK_STOP 1717354400228

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="MedleyA-PT-05"
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 MedleyA-PT-05, 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 r576-smll-171734919900034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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