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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 110K 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-15-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717369149030

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 22:59:11] [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 22:59:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:59:11] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2024-06-02 22:59:11] [INFO ] Transformed 192 places.
[2024-06-02 22:59:11] [INFO ] Transformed 475 transitions.
[2024-06-02 22:59:11] [INFO ] Found NUPN structural information;
[2024-06-02 22:59:12] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 104 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 473/473 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 175 transition count 451
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 175 transition count 451
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 43 place count 175 transition count 442
Applied a total of 43 rules in 54 ms. Remains 175 /192 variables (removed 17) and now considering 442/473 (removed 31) transitions.
// Phase 1: matrix 442 rows 175 cols
[2024-06-02 22:59:12] [INFO ] Computed 7 invariants in 39 ms
[2024-06-02 22:59:12] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-06-02 22:59:12] [INFO ] Invariant cache hit.
[2024-06-02 22:59:13] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
Running 441 sub problems to find dead transitions.
[2024-06-02 22:59:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-06-02 22:59:19] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 28 ms to minimize.
[2024-06-02 22:59:19] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 4 ms to minimize.
[2024-06-02 22:59:19] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-06-02 22:59:20] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 3 ms to minimize.
[2024-06-02 22:59:20] [INFO ] Deduced a trap composed of 114 places in 194 ms of which 3 ms to minimize.
[2024-06-02 22:59:20] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 4 ms to minimize.
[2024-06-02 22:59:20] [INFO ] Deduced a trap composed of 101 places in 172 ms of which 3 ms to minimize.
[2024-06-02 22:59:21] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 3 ms to minimize.
[2024-06-02 22:59:21] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-06-02 22:59:21] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 2 ms to minimize.
[2024-06-02 22:59:22] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 3 ms to minimize.
[2024-06-02 22:59:22] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
[2024-06-02 22:59:23] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-06-02 22:59:26] [INFO ] Deduced a trap composed of 93 places in 197 ms of which 3 ms to minimize.
[2024-06-02 22:59:26] [INFO ] Deduced a trap composed of 114 places in 137 ms of which 3 ms to minimize.
[2024-06-02 22:59:27] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-06-02 22:59:27] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:59:27] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 3 ms to minimize.
[2024-06-02 22:59:28] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 3 ms to minimize.
[2024-06-02 22:59:28] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-06-02 22:59:34] [INFO ] Deduced a trap composed of 128 places in 220 ms of which 3 ms to minimize.
[2024-06-02 22:59:34] [INFO ] Deduced a trap composed of 119 places in 200 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-06-02 22:59:38] [INFO ] Deduced a trap composed of 119 places in 195 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-06-02 22:59:42] [INFO ] Deduced a trap composed of 118 places in 209 ms of which 3 ms to minimize.
[2024-06-02 22:59:43] [INFO ] Deduced a trap composed of 119 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/617 variables, and 32 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/175 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (OVERLAPS) 442/617 variables, 175/207 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/617 variables, 441/648 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-06-02 22:59:56] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/617 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/617 variables, and 649 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 26/26 constraints]
After SMT, in 60733ms problems are : Problem set: 0 solved, 441 unsolved
Search for dead transitions found 0 dead transitions in 60787ms
Starting structural reductions in LTL mode, iteration 1 : 175/192 places, 442/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61798 ms. Remains : 175/192 places, 442/473 transitions.
Support contains 104 out of 175 places after structural reductions.
[2024-06-02 23:00:14] [INFO ] Flatten gal took : 119 ms
[2024-06-02 23:00:14] [INFO ] Flatten gal took : 39 ms
[2024-06-02 23:00:14] [INFO ] Input system was already deterministic with 442 transitions.
RANDOM walk for 40000 steps (8 resets) in 3008 ms. (13 steps per ms) remains 88/99 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 86/88 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 85/86 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 84/85 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 84/84 properties
[2024-06-02 23:00:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 1 (OVERLAPS) 83/175 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 80 unsolved
[2024-06-02 23:00:17] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 3 ms to minimize.
[2024-06-02 23:00:18] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:00:18] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-06-02 23:00:18] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 4/11 constraints. Problems are: Problem set: 4 solved, 80 unsolved
[2024-06-02 23:00:19] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 2 ms to minimize.
[2024-06-02 23:00:19] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 2 ms to minimize.
[2024-06-02 23:00:19] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 3 ms to minimize.
[2024-06-02 23:00:19] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 3 ms to minimize.
[2024-06-02 23:00:19] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 8 ms to minimize.
[2024-06-02 23:00:20] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 6/17 constraints. Problems are: Problem set: 4 solved, 80 unsolved
[2024-06-02 23:00:20] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 3 ms to minimize.
[2024-06-02 23:00:20] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 3 ms to minimize.
[2024-06-02 23:00:21] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 3/20 constraints. Problems are: Problem set: 4 solved, 80 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/617 variables, and 20 constraints, problems are : Problem set: 4 solved, 80 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/175 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 4 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 80 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp41 is UNSAT
At refinement iteration 1 (OVERLAPS) 86/175 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 13/20 constraints. Problems are: Problem set: 6 solved, 78 unsolved
[2024-06-02 23:00:22] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 4 ms to minimize.
[2024-06-02 23:00:23] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:00:23] [INFO ] Deduced a trap composed of 119 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 3/23 constraints. Problems are: Problem set: 6 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/23 constraints. Problems are: Problem set: 6 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 442/617 variables, 175/198 constraints. Problems are: Problem set: 6 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/617 variables, 78/276 constraints. Problems are: Problem set: 6 solved, 78 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/617 variables, and 276 constraints, problems are : Problem set: 6 solved, 78 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 78/84 constraints, Known Traps: 16/16 constraints]
After SMT, in 10143ms problems are : Problem set: 6 solved, 78 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 442/442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 175 transition count 436
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 169 transition count 433
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 166 transition count 433
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 18 place count 166 transition count 428
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 161 transition count 428
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 33 place count 156 transition count 420
Iterating global reduction 3 with 5 rules applied. Total rules applied 38 place count 156 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 156 transition count 419
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 57 place count 147 transition count 410
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 146 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 68 place count 146 transition count 406
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 145 transition count 405
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 145 transition count 405
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 77 place count 145 transition count 398
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 84 place count 138 transition count 398
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 86 place count 138 transition count 396
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 87 place count 138 transition count 396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 88 place count 137 transition count 395
Applied a total of 88 rules in 205 ms. Remains 137 /175 variables (removed 38) and now considering 395/442 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 137/175 places, 395/442 transitions.
RANDOM walk for 40000 steps (8 resets) in 1094 ms. (36 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4000 steps (8 resets) in 58 ms. (67 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 65 ms. (60 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4000 steps (8 resets) in 70 ms. (56 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 70 ms. (56 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 55 ms. (71 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 78/78 properties
Interrupted probabilistic random walk after 378053 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :72 out of 78
Probabilistic random walk after 378053 steps, saw 63129 distinct states, run finished after 3006 ms. (steps per millisecond=125 ) properties seen :72
// Phase 1: matrix 395 rows 137 cols
[2024-06-02 23:00:31] [INFO ] Computed 7 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 118/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:00:31] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 4 ms to minimize.
[2024-06-02 23:00:31] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 392/525 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:00:31] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 7/532 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/532 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 147 constraints, problems are : Problem set: 0 solved, 6 unsolved in 744 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 118/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:00:32] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:00:32] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 392/525 variables, 133/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 7/532 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/532 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 155 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1243 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 2002ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 7437 ms.
Support contains 15 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 395/395 transitions.
Graph (trivial) has 115 edges and 137 vertex of which 5 / 137 are part of one of the 2 SCC in 9 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 134 transition count 378
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 122 transition count 378
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 25 place count 122 transition count 373
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 37 place count 115 transition count 373
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 121 edges and 115 vertex of which 38 / 115 are part of one of the 12 SCC in 1 ms
Free SCC test removed 26 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 89 transition count 372
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 117 transitions.
Iterating post reduction 3 with 117 rules applied. Total rules applied 156 place count 89 transition count 255
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 169 place count 76 transition count 214
Iterating global reduction 4 with 13 rules applied. Total rules applied 182 place count 76 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 183 place count 76 transition count 213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 183 place count 76 transition count 212
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 75 transition count 212
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 197 place count 69 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 200 place count 69 transition count 203
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 214 place count 62 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 215 place count 62 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 7 with 85 rules applied. Total rules applied 300 place count 62 transition count 168
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 302 place count 62 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 304 place count 60 transition count 166
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 304 place count 60 transition count 162
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 312 place count 56 transition count 162
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 313 place count 55 transition count 156
Iterating global reduction 9 with 1 rules applied. Total rules applied 314 place count 55 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 316 place count 54 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 318 place count 53 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 319 place count 53 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 321 place count 52 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 326 place count 52 transition count 155
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 332 place count 52 transition count 149
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 338 place count 46 transition count 149
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 339 place count 46 transition count 149
Applied a total of 339 rules in 91 ms. Remains 46 /137 variables (removed 91) and now considering 149/395 (removed 246) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 46/137 places, 149/395 transitions.
RANDOM walk for 40000 steps (7196 resets) in 176 ms. (225 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (30 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
[2024-06-02 23:00:40] [INFO ] Flow matrix only has 144 transitions (discarded 5 similar events)
// Phase 1: matrix 144 rows 46 cols
[2024-06-02 23:00:40] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:00:40] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:00:41] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:00:41] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 144/190 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 61 constraints, problems are : Problem set: 0 solved, 2 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:00:41] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 144/190 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:00:41] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/190 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 65 constraints, problems are : Problem set: 0 solved, 2 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 634ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 511 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 149/149 transitions.
Graph (trivial) has 29 edges and 46 vertex of which 3 / 46 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 44 transition count 144
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 42 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 40 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 40 transition count 132
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 0 with 4 rules applied. Total rules applied 13 place count 38 transition count 130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 21 place count 34 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 34 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 33 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 32 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 32 transition count 137
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 39 place count 32 transition count 130
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 32 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 30 transition count 128
Applied a total of 43 rules in 34 ms. Remains 30 /46 variables (removed 16) and now considering 128/149 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 30/46 places, 128/149 transitions.
RANDOM walk for 40000 steps (2593 resets) in 1074 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 398 ms. (100 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 191 steps, run visited all 1 properties in 7 ms. (steps per millisecond=27 )
Probabilistic random walk after 191 steps, saw 100 distinct states, run finished after 15 ms. (steps per millisecond=12 ) properties seen :1
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-06-02 23:00:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 23:00:42] [INFO ] Flatten gal took : 50 ms
FORMULA MedleyA-PT-15-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 23:00:42] [INFO ] Flatten gal took : 54 ms
[2024-06-02 23:00:42] [INFO ] Input system was already deterministic with 442 transitions.
Support contains 89 out of 175 places (down from 96) after GAL structural reductions.
Computed a total of 15 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 442/442 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 143 transition count 385
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 143 transition count 385
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 81 place count 143 transition count 368
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 141 transition count 364
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 141 transition count 364
Applied a total of 85 rules in 27 ms. Remains 141 /175 variables (removed 34) and now considering 364/442 (removed 78) transitions.
// Phase 1: matrix 364 rows 141 cols
[2024-06-02 23:00:42] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:00:42] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-02 23:00:42] [INFO ] Invariant cache hit.
[2024-06-02 23:00:43] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 23:00:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:00:47] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-06-02 23:00:47] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:00:47] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:00:47] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:00:47] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:00:47] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:00:47] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 2 ms to minimize.
[2024-06-02 23:00:48] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 2 ms to minimize.
[2024-06-02 23:00:48] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 3 ms to minimize.
[2024-06-02 23:00:48] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 2 ms to minimize.
[2024-06-02 23:00:48] [INFO ] Deduced a trap composed of 86 places in 179 ms of which 2 ms to minimize.
[2024-06-02 23:00:48] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 2 ms to minimize.
[2024-06-02 23:00:48] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 5 ms to minimize.
[2024-06-02 23:00:49] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
[2024-06-02 23:00:49] [INFO ] Deduced a trap composed of 94 places in 183 ms of which 2 ms to minimize.
[2024-06-02 23:00:49] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 4 ms to minimize.
[2024-06-02 23:00:49] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 2 ms to minimize.
[2024-06-02 23:00:50] [INFO ] Deduced a trap composed of 97 places in 168 ms of which 3 ms to minimize.
[2024-06-02 23:00:50] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2024-06-02 23:00:50] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:00:51] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:00:51] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:00:52] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:00:56] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:00:59] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:01:07] [INFO ] Deduced a trap composed of 103 places in 178 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:01:12] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 175 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 363/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 538 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60251ms
Starting structural reductions in LTL mode, iteration 1 : 141/175 places, 364/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60655 ms. Remains : 141/175 places, 364/442 transitions.
[2024-06-02 23:01:43] [INFO ] Flatten gal took : 33 ms
[2024-06-02 23:01:43] [INFO ] Flatten gal took : 33 ms
[2024-06-02 23:01:43] [INFO ] Input system was already deterministic with 364 transitions.
[2024-06-02 23:01:43] [INFO ] Flatten gal took : 31 ms
[2024-06-02 23:01:43] [INFO ] Flatten gal took : 31 ms
[2024-06-02 23:01:43] [INFO ] Time to serialize gal into /tmp/CTLFireability1831204495925276677.gal : 18 ms
[2024-06-02 23:01:43] [INFO ] Time to serialize properties into /tmp/CTLFireability16601226565752995860.ctl : 4 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/CTLFireability1831204495925276677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16601226565752995860.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.81482e+06,0.860798,20080,2,4314,5,47091,6,0,930,65677,0


Converting to forward existential form...Done !
original formula: AF((AG(AX((p14==0))) * (p110==0)))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(!(EX(!((p14==0))))))) * (p110==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...508
(forward)formula 0,0,12.4037,294388,1,0,936,1.5439e+06,757,527,7836,1.42971e+06,984
FORMULA MedleyA-PT-15-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 442/442 transitions.
Graph (trivial) has 183 edges and 175 vertex of which 9 / 175 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 168 transition count 414
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 147 transition count 413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 146 transition count 413
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 45 place count 146 transition count 405
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 61 place count 138 transition count 405
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 89 place count 110 transition count 352
Iterating global reduction 3 with 28 rules applied. Total rules applied 117 place count 110 transition count 352
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 133 place count 110 transition count 336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 133 place count 110 transition count 335
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 135 place count 109 transition count 335
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 157 place count 98 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 98 transition count 323
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 161 place count 95 transition count 315
Iterating global reduction 5 with 3 rules applied. Total rules applied 164 place count 95 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 174 place count 95 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 176 place count 94 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 93 transition count 303
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 101 edges and 91 vertex of which 34 / 91 are part of one of the 14 SCC in 1 ms
Free SCC test removed 20 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 180 place count 71 transition count 303
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 6 with 63 rules applied. Total rules applied 243 place count 71 transition count 240
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 248 place count 66 transition count 182
Iterating global reduction 7 with 5 rules applied. Total rules applied 253 place count 66 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 255 place count 66 transition count 180
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 8 with 4 rules applied. Total rules applied 259 place count 64 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 8 with 56 rules applied. Total rules applied 315 place count 64 transition count 122
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 8 with 4 rules applied. Total rules applied 319 place count 64 transition count 118
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 323 place count 60 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 323 place count 60 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 325 place count 59 transition count 117
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 326 place count 58 transition count 113
Iterating global reduction 10 with 1 rules applied. Total rules applied 327 place count 58 transition count 113
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 10 with 4 rules applied. Total rules applied 331 place count 56 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 334 place count 56 transition count 108
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 2 rules applied. Total rules applied 336 place count 56 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 338 place count 54 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 338 place count 54 transition count 105
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 340 place count 53 transition count 105
Applied a total of 340 rules in 76 ms. Remains 53 /175 variables (removed 122) and now considering 105/442 (removed 337) transitions.
// Phase 1: matrix 105 rows 53 cols
[2024-06-02 23:01:56] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:01:56] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 23:01:56] [INFO ] Invariant cache hit.
[2024-06-02 23:01:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:01:56] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-06-02 23:01:56] [INFO ] Redundant transitions in 35 ms returned [101, 103, 104]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 97 sub problems to find dead transitions.
// Phase 1: matrix 102 rows 53 cols
[2024-06-02 23:01:56] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:01:56] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/53 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-02 23:01:57] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
[2024-06-02 23:01:57] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-02 23:01:57] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:01:57] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:01:57] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-06-02 23:01:57] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-06-02 23:01:57] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 101/154 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/154 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/155 variables, and 81 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3342 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 53/53 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 101/154 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 97/178 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/155 variables, and 178 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2531 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 53/53 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints]
After SMT, in 5917ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 5919ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/175 places, 102/442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 51 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 50 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 50 transition count 98
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 2 with 1 rules applied. Total rules applied 8 place count 50 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9 place count 49 transition count 97
Applied a total of 9 rules in 15 ms. Remains 49 /53 variables (removed 4) and now considering 97/102 (removed 5) transitions.
// Phase 1: matrix 97 rows 49 cols
[2024-06-02 23:02:02] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:02:02] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 23:02:02] [INFO ] Invariant cache hit.
[2024-06-02 23:02:02] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:02:02] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 49/175 places, 97/442 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 6386 ms. Remains : 49/175 places, 97/442 transitions.
[2024-06-02 23:02:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:02:02] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:02:02] [INFO ] Input system was already deterministic with 97 transitions.
[2024-06-02 23:02:02] [INFO ] Flatten gal took : 5 ms
[2024-06-02 23:02:02] [INFO ] Flatten gal took : 5 ms
[2024-06-02 23:02:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12764840988156979815.gal : 3 ms
[2024-06-02 23:02:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17683595588921691465.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/CTLFireability12764840988156979815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17683595588921691465.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,11066,0.120579,7280,2,1401,5,12978,5,0,294,12556,0


Converting to forward existential form...Done !
original formula: (EF(!(A(!((((p13==1)&&(p51==1))&&((p188==1)&&(p92==1)))) U !(EG((p84==1)))))) + AG(!(E((p175==1) U A((((p9==1)&&(p54==1))&&(p191==1)) U (...168
=> equivalent forward existential formula: [((FwdU(FwdU((Init * !(E(TRUE U !(!((E(!(!(EG((p84==1)))) U (!(!((((p13==1)&&(p51==1))&&((p188==1)&&(p92==1)))))...335
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t14, t15, t16, t17, t19, t21, t23, t27, t30, t32, t34, t37, t64, t76, t79, t83, t84...260
Fast SCC detection found an SCC at level 0
(forward)formula 0,1,1.04504,30528,1,0,217,133723,240,113,2449,92712,248
FORMULA MedleyA-PT-15-CTLFireability-2024-02 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 : 175/175 places, 442/442 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 148 transition count 393
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 148 transition count 393
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 68 place count 148 transition count 379
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 147 transition count 377
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 147 transition count 377
Applied a total of 70 rules in 8 ms. Remains 147 /175 variables (removed 28) and now considering 377/442 (removed 65) transitions.
// Phase 1: matrix 377 rows 147 cols
[2024-06-02 23:02:03] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:02:03] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 23:02:03] [INFO ] Invariant cache hit.
[2024-06-02 23:02:04] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2024-06-02 23:02:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 23:02:07] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-06-02 23:02:07] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:02:08] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:02:08] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:02:08] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:02:08] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:02:08] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:02:08] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 2 ms to minimize.
[2024-06-02 23:02:08] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:02:08] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 3 ms to minimize.
[2024-06-02 23:02:09] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 3 ms to minimize.
[2024-06-02 23:02:09] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:02:09] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:02:10] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 3 ms to minimize.
[2024-06-02 23:02:10] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:02:10] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
[2024-06-02 23:02:10] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:02:10] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 3 ms to minimize.
[2024-06-02 23:02:10] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 23:02:13] [INFO ] Deduced a trap composed of 105 places in 184 ms of which 3 ms to minimize.
[2024-06-02 23:02:13] [INFO ] Deduced a trap composed of 96 places in 187 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 23:02:17] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 3 ms to minimize.
[2024-06-02 23:02:18] [INFO ] Deduced a trap composed of 86 places in 201 ms of which 2 ms to minimize.
[2024-06-02 23:02:18] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 2 ms to minimize.
[2024-06-02 23:02:19] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (OVERLAPS) 377/524 variables, 147/179 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 23:02:28] [INFO ] Deduced a trap composed of 96 places in 163 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/524 variables, and 180 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 377/524 variables, 147/180 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 376/556 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/524 variables, and 556 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 26/26 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 147/175 places, 377/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60600 ms. Remains : 147/175 places, 377/442 transitions.
[2024-06-02 23:03:04] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:03:04] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:03:04] [INFO ] Input system was already deterministic with 377 transitions.
[2024-06-02 23:03:04] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:03:04] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:03:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17456503271575530053.gal : 9 ms
[2024-06-02 23:03:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5036683366486609149.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/CTLFireability17456503271575530053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5036683366486609149.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AG(A((p36==1) U (p10==1))) + (A((!(EF(((p100==1)&&(p148==1)))) * (p32==1)) U (((AX(((p100==1)&&(p157==1))) * EF((p55==1))) * ((p71==1)&&...360
=> equivalent forward existential formula: (((([(EY(((FwdU((Init * !(!(E(TRUE U !(!((E(!((p10==1)) U (!((p36==1)) * !((p10==1)))) + EG(!((p10==1)))))))))),...2331
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t14, t16, t21, t22, t25, t26, t33, t34, t36, t37, t39, t40, t43, t46, t48, t52, t56,...564
(forward)formula 0,0,4.30322,101468,1,0,692,508735,790,353,8072,403402,806
FORMULA MedleyA-PT-15-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 442/442 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 146 transition count 390
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 146 transition count 390
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 68 place count 146 transition count 380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 144 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 144 transition count 376
Applied a total of 72 rules in 8 ms. Remains 144 /175 variables (removed 31) and now considering 376/442 (removed 66) transitions.
// Phase 1: matrix 376 rows 144 cols
[2024-06-02 23:03:08] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:03:09] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 23:03:09] [INFO ] Invariant cache hit.
[2024-06-02 23:03:09] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-06-02 23:03:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 23:03:13] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:03:13] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:03:13] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:03:13] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:03:13] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 2 ms to minimize.
[2024-06-02 23:03:13] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 3 ms to minimize.
[2024-06-02 23:03:14] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 2 ms to minimize.
[2024-06-02 23:03:14] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:03:14] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-06-02 23:03:14] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 2 ms to minimize.
[2024-06-02 23:03:15] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 3 ms to minimize.
[2024-06-02 23:03:15] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 2 ms to minimize.
[2024-06-02 23:03:15] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2024-06-02 23:03:15] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:03:15] [INFO ] Deduced a trap composed of 105 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:03:15] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:03:16] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:03:16] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:03:16] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 23:03:17] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:03:18] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
[2024-06-02 23:03:18] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-06-02 23:03:18] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 376/520 variables, 144/174 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 23:03:24] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 23:03:29] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/520 variables, and 176 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 376/520 variables, 144/176 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 375/551 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 23:03:50] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 552 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 26/26 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in LTL mode, iteration 1 : 144/175 places, 376/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60706 ms. Remains : 144/175 places, 376/442 transitions.
[2024-06-02 23:04:09] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:04:09] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:04:09] [INFO ] Input system was already deterministic with 376 transitions.
[2024-06-02 23:04:09] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:04:09] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:04:09] [INFO ] Time to serialize gal into /tmp/CTLFireability12376330521405510046.gal : 6 ms
[2024-06-02 23:04:09] [INFO ] Time to serialize properties into /tmp/CTLFireability11570948407161330840.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/CTLFireability12376330521405510046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11570948407161330840.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.03342e+06,1.14983,26080,2,5250,5,68812,6,0,954,95614,0


Converting to forward existential form...Done !
original formula: (A(((p106==1)&&(p163==1)) U AG(EF(((p71==1)&&(p163==1))))) * E((((p87==1)&&(p163==1)) + EF((p185==1))) U EX(!(((p139==1)&&(p98==1))))))
=> equivalent forward existential formula: [(EY(FwdU((Init * !((E(!(!(E(TRUE U !(E(TRUE U ((p71==1)&&(p163==1))))))) U (!(((p106==1)&&(p163==1))) * !(!(E(T...346
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t15, t20, t21, t24, t25, t32, t33, t35, t38, t39, t42, t43, t44, t47, t49, t53, t57, ...533
(forward)formula 0,0,17.3491,387288,1,0,770,2.49357e+06,786,389,8141,1.52426e+06,913
FORMULA MedleyA-PT-15-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 442/442 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 143 transition count 385
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 143 transition count 385
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 81 place count 143 transition count 368
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 141 transition count 364
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 141 transition count 364
Applied a total of 85 rules in 11 ms. Remains 141 /175 variables (removed 34) and now considering 364/442 (removed 78) transitions.
// Phase 1: matrix 364 rows 141 cols
[2024-06-02 23:04:27] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:04:27] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-02 23:04:27] [INFO ] Invariant cache hit.
[2024-06-02 23:04:27] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 23:04:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:04:32] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
[2024-06-02 23:04:33] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 5 ms to minimize.
[2024-06-02 23:04:33] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 2 ms to minimize.
[2024-06-02 23:04:33] [INFO ] Deduced a trap composed of 87 places in 196 ms of which 2 ms to minimize.
[2024-06-02 23:04:33] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 2 ms to minimize.
[2024-06-02 23:04:33] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 2 ms to minimize.
[2024-06-02 23:04:34] [INFO ] Deduced a trap composed of 86 places in 181 ms of which 13 ms to minimize.
[2024-06-02 23:04:34] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:04:34] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:04:34] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 3 ms to minimize.
[2024-06-02 23:04:35] [INFO ] Deduced a trap composed of 94 places in 183 ms of which 4 ms to minimize.
[2024-06-02 23:04:35] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:04:35] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:04:35] [INFO ] Deduced a trap composed of 97 places in 178 ms of which 2 ms to minimize.
[2024-06-02 23:04:36] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2024-06-02 23:04:36] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:04:36] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:04:37] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 3 ms to minimize.
[2024-06-02 23:04:37] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:04:41] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:04:43] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:04:51] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:04:54] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 175 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 363/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 538 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Starting structural reductions in LTL mode, iteration 1 : 141/175 places, 364/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60800 ms. Remains : 141/175 places, 364/442 transitions.
[2024-06-02 23:05:28] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:05:28] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:05:28] [INFO ] Input system was already deterministic with 364 transitions.
[2024-06-02 23:05:28] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:05:28] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:05:28] [INFO ] Time to serialize gal into /tmp/CTLFireability8683165896297160936.gal : 6 ms
[2024-06-02 23:05:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7661202386173927099.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/CTLFireability8683165896297160936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7661202386173927099.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.81482e+06,0.736671,20200,2,4314,5,47091,6,0,930,65677,0


Converting to forward existential form...Done !
original formula: AG(EX(EX(TRUE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EX(TRUE))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...508
(forward)formula 0,1,2.53959,59684,1,0,625,277058,743,330,7572,204723,734
FORMULA MedleyA-PT-15-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 442/442 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 147 transition count 390
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 147 transition count 390
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 72 place count 147 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 146 transition count 372
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 146 transition count 372
Applied a total of 74 rules in 8 ms. Remains 146 /175 variables (removed 29) and now considering 372/442 (removed 70) transitions.
// Phase 1: matrix 372 rows 146 cols
[2024-06-02 23:05:30] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:05:30] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 23:05:30] [INFO ] Invariant cache hit.
[2024-06-02 23:05:31] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2024-06-02 23:05:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:05:34] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:05:35] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:05:35] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-06-02 23:05:35] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 3 ms to minimize.
[2024-06-02 23:05:35] [INFO ] Deduced a trap composed of 87 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:05:35] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 3 ms to minimize.
[2024-06-02 23:05:35] [INFO ] Deduced a trap composed of 81 places in 171 ms of which 2 ms to minimize.
[2024-06-02 23:05:36] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 3 ms to minimize.
[2024-06-02 23:05:36] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:05:37] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 3 ms to minimize.
[2024-06-02 23:05:37] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 2 ms to minimize.
[2024-06-02 23:05:37] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 3 ms to minimize.
[2024-06-02 23:05:37] [INFO ] Deduced a trap composed of 94 places in 181 ms of which 3 ms to minimize.
[2024-06-02 23:05:37] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 3 ms to minimize.
[2024-06-02 23:05:39] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:05:40] [INFO ] Deduced a trap composed of 94 places in 164 ms of which 3 ms to minimize.
[2024-06-02 23:05:41] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 3 ms to minimize.
[2024-06-02 23:05:41] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:05:45] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:05:48] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:05:50] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 8 (OVERLAPS) 372/518 variables, 146/174 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/518 variables, and 174 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:06:03] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:06:04] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:06:04] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:06:04] [INFO ] Deduced a trap composed of 111 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/518 variables, 146/178 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 371/549 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 8 (OVERLAPS) 0/518 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Int declared 518/518 variables, and 549 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 25/25 constraints]
After SMT, in 60259ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Starting structural reductions in LTL mode, iteration 1 : 146/175 places, 372/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60721 ms. Remains : 146/175 places, 372/442 transitions.
[2024-06-02 23:06:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:06:31] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:06:31] [INFO ] Input system was already deterministic with 372 transitions.
[2024-06-02 23:06:31] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:06:31] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:06:31] [INFO ] Time to serialize gal into /tmp/CTLFireability12806573133227445804.gal : 5 ms
[2024-06-02 23:06:31] [INFO ] Time to serialize properties into /tmp/CTLFireability17149735392385687348.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/CTLFireability12806573133227445804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17149735392385687348.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.9543e+06,0.843098,22872,2,4537,5,55988,6,0,958,77106,0


Converting to forward existential form...Done !
original formula: (E(!((EG((p171==1)) + ((p99!=1) * AG((p5==1))))) U ((A((((p28==1)&&(p54==1))&&(p191==1)) U ((p100==1)&&(p140==1))) + (p145==1)) + EG(EX((...311
=> equivalent forward existential formula: ([(FwdU((Init * !(E(!((EG((p171==1)) + ((p99!=1) * !(E(TRUE U !((p5==1))))))) U ((!((E(!(((p100==1)&&(p140==1)))...821
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t16, t21, t22, t25, t26, t33, t34, t36, t37, t40, t41, t42, t45, t48, t50, t54, t58,...524
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,29.6849,630552,1,0,1050,4.07923e+06,806,652,8163,3.25369e+06,1224
FORMULA MedleyA-PT-15-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 442/442 transitions.
Graph (trivial) has 200 edges and 175 vertex of which 9 / 175 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 168 transition count 411
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 144 transition count 411
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 49 place count 144 transition count 402
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 67 place count 135 transition count 402
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 96 place count 106 transition count 347
Iterating global reduction 2 with 29 rules applied. Total rules applied 125 place count 106 transition count 347
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 141 place count 106 transition count 331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 141 place count 106 transition count 330
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 105 transition count 330
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 104 transition count 326
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 104 transition count 326
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 169 place count 92 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 92 transition count 313
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 173 place count 89 transition count 306
Iterating global reduction 4 with 3 rules applied. Total rules applied 176 place count 89 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 190 place count 89 transition count 292
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 4 with 4 rules applied. Total rules applied 194 place count 87 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 86 transition count 289
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 107 edges and 84 vertex of which 36 / 84 are part of one of the 14 SCC in 0 ms
Free SCC test removed 22 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 198 place count 62 transition count 289
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 5 with 83 rules applied. Total rules applied 281 place count 62 transition count 206
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 287 place count 56 transition count 149
Iterating global reduction 6 with 6 rules applied. Total rules applied 293 place count 56 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 295 place count 56 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 299 place count 54 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 340 place count 54 transition count 104
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 5 rules applied. Total rules applied 345 place count 54 transition count 99
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 350 place count 49 transition count 99
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 351 place count 48 transition count 96
Iterating global reduction 9 with 1 rules applied. Total rules applied 352 place count 48 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 356 place count 46 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 359 place count 46 transition count 91
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 2 rules applied. Total rules applied 361 place count 46 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 363 place count 44 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 363 place count 44 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 365 place count 43 transition count 88
Applied a total of 365 rules in 80 ms. Remains 43 /175 variables (removed 132) and now considering 88/442 (removed 354) transitions.
// Phase 1: matrix 88 rows 43 cols
[2024-06-02 23:07:01] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:07:01] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 23:07:01] [INFO ] Invariant cache hit.
[2024-06-02 23:07:01] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:07:01] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-06-02 23:07:01] [INFO ] Redundant transitions in 22 ms returned [85, 87]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 80 sub problems to find dead transitions.
// Phase 1: matrix 86 rows 43 cols
[2024-06-02 23:07:01] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 23:07:01] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-02 23:07:02] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:07:02] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-02 23:07:02] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:07:02] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
[2024-06-02 23:07:02] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:07:02] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-06-02 23:07:02] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:07:02] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:07:02] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:07:02] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/129 variables, and 74 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2083 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 85/128 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 80/154 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/129 variables, and 154 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1816 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 10/10 constraints]
After SMT, in 3946ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3947ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/175 places, 86/442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 42 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 41 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 41 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 41 transition count 82
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 40 transition count 82
Applied a total of 7 rules in 10 ms. Remains 40 /43 variables (removed 3) and now considering 82/86 (removed 4) transitions.
// Phase 1: matrix 82 rows 40 cols
[2024-06-02 23:07:05] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:07:05] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 23:07:05] [INFO ] Invariant cache hit.
[2024-06-02 23:07:05] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:07:05] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 40/175 places, 82/442 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4503 ms. Remains : 40/175 places, 82/442 transitions.
[2024-06-02 23:07:05] [INFO ] Flatten gal took : 5 ms
[2024-06-02 23:07:05] [INFO ] Flatten gal took : 5 ms
[2024-06-02 23:07:05] [INFO ] Input system was already deterministic with 82 transitions.
[2024-06-02 23:07:05] [INFO ] Flatten gal took : 5 ms
[2024-06-02 23:07:05] [INFO ] Flatten gal took : 5 ms
[2024-06-02 23:07:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3510450643946392859.gal : 1 ms
[2024-06-02 23:07:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13393323534911203696.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/ReachabilityCardinality3510450643946392859.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13393323534911203696.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 5505 steps (1386 resets) in 53 ms. (101 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-15-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 442/442 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 145 transition count 388
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 145 transition count 388
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 77 place count 145 transition count 371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 144 transition count 369
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 144 transition count 369
Applied a total of 79 rules in 8 ms. Remains 144 /175 variables (removed 31) and now considering 369/442 (removed 73) transitions.
// Phase 1: matrix 369 rows 144 cols
[2024-06-02 23:07:06] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:07:06] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 23:07:06] [INFO ] Invariant cache hit.
[2024-06-02 23:07:06] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-02 23:07:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 23:07:11] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:07:11] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:07:11] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 3 ms to minimize.
[2024-06-02 23:07:11] [INFO ] Deduced a trap composed of 88 places in 154 ms of which 3 ms to minimize.
[2024-06-02 23:07:11] [INFO ] Deduced a trap composed of 88 places in 161 ms of which 3 ms to minimize.
[2024-06-02 23:07:11] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 3 ms to minimize.
[2024-06-02 23:07:12] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:07:12] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 3 ms to minimize.
[2024-06-02 23:07:12] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 2 ms to minimize.
[2024-06-02 23:07:12] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:07:13] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-06-02 23:07:13] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:07:13] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 2 ms to minimize.
[2024-06-02 23:07:13] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:07:14] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2024-06-02 23:07:14] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 2 ms to minimize.
[2024-06-02 23:07:14] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2024-06-02 23:07:14] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:07:16] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 23:07:17] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 3 ms to minimize.
[2024-06-02 23:07:17] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
[2024-06-02 23:07:17] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:07:18] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 23:07:21] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 23:07:25] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:07:25] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 369/513 variables, 144/177 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 23:07:34] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/513 variables, and 178 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 369/513 variables, 144/178 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 368/546 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/513 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 546 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 27/27 constraints]
After SMT, in 60257ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60264ms
Starting structural reductions in LTL mode, iteration 1 : 144/175 places, 369/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60754 ms. Remains : 144/175 places, 369/442 transitions.
[2024-06-02 23:08:06] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:08:06] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:08:06] [INFO ] Input system was already deterministic with 369 transitions.
[2024-06-02 23:08:06] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:08:06] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:08:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9145089388489495036.gal : 3 ms
[2024-06-02 23:08:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16332729147361350339.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/CTLFireability9145089388489495036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16332729147361350339.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.88152e+06,0.80108,22332,2,4508,5,53321,6,0,947,72645,0


Converting to forward existential form...Done !
original formula: E(((E(EX(!(AX((p29==1)))) U ((((p108!=1)||(p84==1)) * EG((p4==1))) * AG(((p67==1)&&(p162==1))))) + AG(E((p97==1) U ((p67==1)&&(p162==1)))...308
=> equivalent forward existential formula: [FwdG((FwdU(Init,((E(EX(!(!(EX(!((p29==1)))))) U ((((p108!=1)||(p84==1)) * EG((p4==1))) * !(E(TRUE U !(((p67==1)...418
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t64,...529
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,18.6805,417240,1,0,954,2.26561e+06,789,571,8343,1.92637e+06,1179
FORMULA MedleyA-PT-15-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 442/442 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 145 transition count 389
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 145 transition count 389
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 67 place count 145 transition count 382
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 143 transition count 378
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 143 transition count 378
Applied a total of 71 rules in 14 ms. Remains 143 /175 variables (removed 32) and now considering 378/442 (removed 64) transitions.
// Phase 1: matrix 378 rows 143 cols
[2024-06-02 23:08:25] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:08:25] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 23:08:25] [INFO ] Invariant cache hit.
[2024-06-02 23:08:26] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2024-06-02 23:08:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-06-02 23:08:30] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-06-02 23:08:30] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:08:30] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:08:30] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-06-02 23:08:31] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 3 ms to minimize.
[2024-06-02 23:08:31] [INFO ] Deduced a trap composed of 94 places in 167 ms of which 3 ms to minimize.
[2024-06-02 23:08:31] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 3 ms to minimize.
[2024-06-02 23:08:31] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 3 ms to minimize.
[2024-06-02 23:08:31] [INFO ] Deduced a trap composed of 83 places in 187 ms of which 3 ms to minimize.
[2024-06-02 23:08:32] [INFO ] Deduced a trap composed of 88 places in 171 ms of which 3 ms to minimize.
[2024-06-02 23:08:32] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:08:32] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 3 ms to minimize.
[2024-06-02 23:08:32] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 3 ms to minimize.
[2024-06-02 23:08:32] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:08:33] [INFO ] Deduced a trap composed of 81 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:08:33] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-06-02 23:08:36] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 3 ms to minimize.
[2024-06-02 23:08:36] [INFO ] Deduced a trap composed of 94 places in 152 ms of which 3 ms to minimize.
[2024-06-02 23:08:37] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/521 variables, 143/169 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/521 variables, and 169 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-06-02 23:09:00] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:09:00] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 2 ms to minimize.
[2024-06-02 23:09:00] [INFO ] Deduced a trap composed of 99 places in 173 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/521 variables, 143/172 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 377/549 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 549 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 22/22 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Starting structural reductions in LTL mode, iteration 1 : 143/175 places, 378/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60688 ms. Remains : 143/175 places, 378/442 transitions.
[2024-06-02 23:09:26] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:09:26] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:09:26] [INFO ] Input system was already deterministic with 378 transitions.
[2024-06-02 23:09:26] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:09:26] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:09:26] [INFO ] Time to serialize gal into /tmp/CTLFireability11410284019117148415.gal : 5 ms
[2024-06-02 23:09:26] [INFO ] Time to serialize properties into /tmp/CTLFireability11406988220835086293.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/CTLFireability11410284019117148415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11406988220835086293.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88152e+06,1.07568,23196,2,4657,5,55012,6,0,952,75016,0


Converting to forward existential form...Done !
original formula: EX((((p132==0) * ((A(!(((p106==1)&&(p162==1))) U ((p78==1)&&(p169==1))) + (((p9==1)&&(p44==1))&&(p191==1))) + ((((EX((p132==1)) * AF(((p1...330
=> equivalent forward existential formula: (([((((EY(Init) * ((p77==0)||(p157==0))) * (p132==0)) * !(EG(!(((p78==1)&&(p169==1)))))) * !(E(!(((p78==1)&&(p16...666
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t42, t43, t46, t48, t50, t54, t58,...524
(forward)formula 0,1,27.1198,606056,1,0,1005,3.78758e+06,807,563,8344,3.21527e+06,1243
FORMULA MedleyA-PT-15-CTLFireability-2024-09 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 : 175/175 places, 442/442 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 146 transition count 391
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 146 transition count 391
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 75 place count 146 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 145 transition count 372
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 145 transition count 372
Applied a total of 77 rules in 9 ms. Remains 145 /175 variables (removed 30) and now considering 372/442 (removed 70) transitions.
// Phase 1: matrix 372 rows 145 cols
[2024-06-02 23:09:53] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:09:54] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-02 23:09:54] [INFO ] Invariant cache hit.
[2024-06-02 23:09:54] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2024-06-02 23:09:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:09:59] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-06-02 23:09:59] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:09:59] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:09:59] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 2 ms to minimize.
[2024-06-02 23:09:59] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 3 ms to minimize.
[2024-06-02 23:09:59] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 4 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 6 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 84 places in 198 ms of which 3 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 97 places in 159 ms of which 2 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 2 ms to minimize.
[2024-06-02 23:10:01] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:10:01] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 2 ms to minimize.
[2024-06-02 23:10:02] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:10:02] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
[2024-06-02 23:10:02] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-06-02 23:10:02] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:10:05] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:10:05] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:10:10] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (OVERLAPS) 372/517 variables, 145/172 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:10:19] [INFO ] Deduced a trap composed of 79 places in 171 ms of which 3 ms to minimize.
[2024-06-02 23:10:20] [INFO ] Deduced a trap composed of 101 places in 164 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 517/517 variables, and 174 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 372/517 variables, 145/174 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 371/545 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:10:36] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 546 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 23/23 constraints]
After SMT, in 60270ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60278ms
Starting structural reductions in LTL mode, iteration 1 : 145/175 places, 372/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60777 ms. Remains : 145/175 places, 372/442 transitions.
[2024-06-02 23:10:54] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:10:54] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:10:54] [INFO ] Input system was already deterministic with 372 transitions.
[2024-06-02 23:10:54] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:10:54] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:10:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2180031596768736624.gal : 4 ms
[2024-06-02 23:10:54] [INFO ] Time to serialize properties into /tmp/CTLFireability1043576120917407313.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/CTLFireability2180031596768736624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1043576120917407313.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.07284e+06,1.00146,23664,2,4815,5,56808,6,0,954,78300,0


Converting to forward existential form...Done !
original formula: E((p147!=1) U EX(!(((!(E(((p94==1)&&(p156==1)) U (p32==1))) + (p154==1)) + ((((p93==1)&&(p159==1))&&(p147==1))||(p95==1))))))
=> equivalent forward existential formula: [(FwdU(((EY(FwdU(Init,(p147!=1))) * !(((((p93==1)&&(p159==1))&&(p147==1))||(p95==1)))) * !((p154==1))),((p94==1)...190
Hit Full ! (commute/partial/dont) 363/0/9
Hit Full ! (commute/partial/dont) 335/35/37
(forward)formula 0,1,1.52868,25776,1,0,18,66442,26,5,2132,92447,10
FORMULA MedleyA-PT-15-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 442/442 transitions.
Graph (trivial) has 170 edges and 175 vertex of which 6 / 175 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 170 transition count 416
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 149 transition count 416
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 43 place count 149 transition count 407
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 61 place count 140 transition count 407
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 87 place count 114 transition count 358
Iterating global reduction 2 with 26 rules applied. Total rules applied 113 place count 114 transition count 358
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 126 place count 114 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 126 place count 114 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 113 transition count 344
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 112 transition count 340
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 112 transition count 340
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 152 place count 101 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 101 transition count 328
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 156 place count 98 transition count 321
Iterating global reduction 4 with 3 rules applied. Total rules applied 159 place count 98 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 167 place count 98 transition count 313
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 97 transition count 312
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 97 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 96 transition count 311
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 95 edges and 94 vertex of which 26 / 94 are part of one of the 11 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 174 place count 79 transition count 311
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 200 place count 79 transition count 285
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 201 place count 78 transition count 270
Iterating global reduction 6 with 1 rules applied. Total rules applied 202 place count 78 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 203 place count 78 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 205 place count 77 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 7 with 99 rules applied. Total rules applied 304 place count 77 transition count 169
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 7 with 4 rules applied. Total rules applied 308 place count 77 transition count 165
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 312 place count 73 transition count 165
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 314 place count 71 transition count 157
Iterating global reduction 9 with 2 rules applied. Total rules applied 316 place count 71 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 318 place count 70 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 319 place count 70 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 321 place count 69 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 322 place count 69 transition count 153
Applied a total of 322 rules in 55 ms. Remains 69 /175 variables (removed 106) and now considering 153/442 (removed 289) transitions.
// Phase 1: matrix 153 rows 69 cols
[2024-06-02 23:10:56] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:10:56] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 23:10:56] [INFO ] Invariant cache hit.
[2024-06-02 23:10:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:10:56] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-06-02 23:10:56] [INFO ] Redundant transitions in 56 ms returned [68, 70, 71, 72, 73, 74, 76, 77, 81, 83, 84, 85, 86, 142, 143, 145, 147, 149, 150, 152]
Found 20 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 20 transitions
Redundant transitions reduction (with SMT) removed 20 transitions.
Running 128 sub problems to find dead transitions.
// Phase 1: matrix 133 rows 69 cols
[2024-06-02 23:10:56] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:10:56] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 2/69 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 23:10:57] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:10:57] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-02 23:10:57] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-06-02 23:10:57] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-02 23:10:57] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:10:57] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-06-02 23:10:57] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:10:58] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 132/201 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 16/98 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/202 variables, and 98 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5086 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 69/69 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 132/201 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 16/98 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 128/226 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/202 variables, and 226 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4646 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 69/69 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 8/8 constraints]
After SMT, in 9760ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 9763ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/175 places, 133/442 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 10038 ms. Remains : 69/175 places, 133/442 transitions.
[2024-06-02 23:11:06] [INFO ] Flatten gal took : 3 ms
[2024-06-02 23:11:06] [INFO ] Flatten gal took : 4 ms
[2024-06-02 23:11:06] [INFO ] Input system was already deterministic with 133 transitions.
[2024-06-02 23:11:06] [INFO ] Flatten gal took : 4 ms
[2024-06-02 23:11:06] [INFO ] Flatten gal took : 4 ms
[2024-06-02 23:11:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8528706452162396571.gal : 1 ms
[2024-06-02 23:11:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17758311168923350217.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/CTLFireability8528706452162396571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17758311168923350217.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,41874,0.201239,7208,2,1398,5,12011,5,0,410,12783,0


Converting to forward existential form...Done !
original formula: AG((AF(!(E(AF((p152==1)) U ((p28==1)||(p129==1))))) * ((EG((((p18==0)||(p35==0))||(p191==0))) + EG(((p96==1)&&(p157==1)))) + (!(A(A(((p93...256
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(!(E(!(EG(!((p152==1)))) U ((p28==1)||(p129==1))))))] = FALSE * ([FwdG(((FwdU(Init,TRUE)...704
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t17, t20, t23, t26, t30, t32, t33, t35, t37, t39, t43, t44, t45, t46, t47, t48, t50,...341
(forward)formula 0,0,1.33995,32476,1,0,378,154900,331,222,3080,128286,417
FORMULA MedleyA-PT-15-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 442/442 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 144 transition count 387
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 144 transition count 387
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 76 place count 144 transition count 373
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 142 transition count 369
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 142 transition count 369
Applied a total of 80 rules in 5 ms. Remains 142 /175 variables (removed 33) and now considering 369/442 (removed 73) transitions.
// Phase 1: matrix 369 rows 142 cols
[2024-06-02 23:11:07] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:11:07] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 23:11:07] [INFO ] Invariant cache hit.
[2024-06-02 23:11:08] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-02 23:11:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 23:11:11] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-06-02 23:11:12] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:11:12] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:11:12] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-06-02 23:11:12] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:11:12] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:11:12] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2024-06-02 23:11:12] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 3 ms to minimize.
[2024-06-02 23:11:12] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-06-02 23:11:13] [INFO ] Deduced a trap composed of 82 places in 172 ms of which 2 ms to minimize.
[2024-06-02 23:11:13] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-06-02 23:11:13] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:11:13] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:11:14] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 7 ms to minimize.
[2024-06-02 23:11:14] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:11:14] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:11:14] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:11:14] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:11:15] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2024-06-02 23:11:15] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 369/511 variables, 142/169 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/511 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 169 constraints, problems are : Problem set: 0 solved, 368 unsolved in 23986 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 369/511 variables, 142/169 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 368/537 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/511 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 537 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 20/20 constraints]
After SMT, in 54141ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 54145ms
Starting structural reductions in LTL mode, iteration 1 : 142/175 places, 369/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54499 ms. Remains : 142/175 places, 369/442 transitions.
[2024-06-02 23:12:02] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:12:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:12:02] [INFO ] Input system was already deterministic with 369 transitions.
[2024-06-02 23:12:02] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:12:02] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:12:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1030619447107896149.gal : 2 ms
[2024-06-02 23:12:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6421669775272181987.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/CTLFireability1030619447107896149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6421669775272181987.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.84817e+06,1.11426,23396,2,4745,5,56105,6,0,939,77674,0


Converting to forward existential form...Done !
original formula: AG(EF(AX(AX(E((p65==1) U (((p25==1)&&(p48==1))&&(p188==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(!(EX(!(E((p65==1) U (((p25==1)&&(p48==1))&&(p188==1))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...514
(forward)formula 0,0,6.04715,130224,1,0,903,764463,761,471,7681,525772,1027
FORMULA MedleyA-PT-15-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 442/442 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 145 transition count 388
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 145 transition count 388
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 77 place count 145 transition count 371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 143 transition count 367
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 143 transition count 367
Applied a total of 81 rules in 4 ms. Remains 143 /175 variables (removed 32) and now considering 367/442 (removed 75) transitions.
// Phase 1: matrix 367 rows 143 cols
[2024-06-02 23:12:08] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:12:08] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 23:12:08] [INFO ] Invariant cache hit.
[2024-06-02 23:12:08] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2024-06-02 23:12:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:12:13] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-06-02 23:12:13] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:12:13] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
[2024-06-02 23:12:13] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 2 ms to minimize.
[2024-06-02 23:12:13] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 3 ms to minimize.
[2024-06-02 23:12:14] [INFO ] Deduced a trap composed of 82 places in 161 ms of which 3 ms to minimize.
[2024-06-02 23:12:14] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
[2024-06-02 23:12:14] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 3 ms to minimize.
[2024-06-02 23:12:14] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 3 ms to minimize.
[2024-06-02 23:12:14] [INFO ] Deduced a trap composed of 93 places in 187 ms of which 3 ms to minimize.
[2024-06-02 23:12:15] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 3 ms to minimize.
[2024-06-02 23:12:15] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:12:15] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 2 ms to minimize.
[2024-06-02 23:12:16] [INFO ] Deduced a trap composed of 72 places in 166 ms of which 2 ms to minimize.
[2024-06-02 23:12:16] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:12:16] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:12:17] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:12:19] [INFO ] Deduced a trap composed of 78 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:12:19] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 3 ms to minimize.
[2024-06-02 23:12:19] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:12:24] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (OVERLAPS) 367/510 variables, 143/171 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/510 variables, and 171 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:12:42] [INFO ] Deduced a trap composed of 108 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:12:44] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:12:44] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (OVERLAPS) 367/510 variables, 143/174 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 366/540 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:12:52] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 541 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 25/25 constraints]
After SMT, in 60258ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in LTL mode, iteration 1 : 143/175 places, 367/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60714 ms. Remains : 143/175 places, 367/442 transitions.
[2024-06-02 23:13:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:13:09] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:13:09] [INFO ] Input system was already deterministic with 367 transitions.
[2024-06-02 23:13:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:13:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:13:09] [INFO ] Time to serialize gal into /tmp/CTLFireability18052482401872274767.gal : 4 ms
[2024-06-02 23:13:09] [INFO ] Time to serialize properties into /tmp/CTLFireability5266577024252370461.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/CTLFireability18052482401872274767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5266577024252370461.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.88428e+06,0.878218,22324,2,4591,5,53250,6,0,941,72570,0


Converting to forward existential form...Done !
original formula: AG((E((EX(((p31==1)&&(p117==1))) + !(EG((p38==1)))) U EX(EF((p167==1)))) + EG(AG(AX(((p85==1)&&(p130==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(E(TRUE U !(!(EX(!(((p85==1)&&(p130==1))))))))))) * !(E((EX(((p31==1)&&(p117==1))) + ...209
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...508
(forward)formula 0,0,9.95842,208360,1,0,696,1.24406e+06,773,366,7870,811043,834
FORMULA MedleyA-PT-15-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 442/442 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 145 transition count 388
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 145 transition count 388
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 77 place count 145 transition count 371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 143 transition count 367
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 143 transition count 367
Applied a total of 81 rules in 6 ms. Remains 143 /175 variables (removed 32) and now considering 367/442 (removed 75) transitions.
// Phase 1: matrix 367 rows 143 cols
[2024-06-02 23:13:19] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:13:19] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 23:13:19] [INFO ] Invariant cache hit.
[2024-06-02 23:13:19] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2024-06-02 23:13:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:13:24] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-06-02 23:13:24] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-02 23:13:24] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 3 ms to minimize.
[2024-06-02 23:13:24] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 2 ms to minimize.
[2024-06-02 23:13:24] [INFO ] Deduced a trap composed of 84 places in 184 ms of which 3 ms to minimize.
[2024-06-02 23:13:25] [INFO ] Deduced a trap composed of 88 places in 171 ms of which 3 ms to minimize.
[2024-06-02 23:13:25] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 2 ms to minimize.
[2024-06-02 23:13:25] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 2 ms to minimize.
[2024-06-02 23:13:25] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:13:25] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
[2024-06-02 23:13:26] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 2 ms to minimize.
[2024-06-02 23:13:26] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:13:27] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
[2024-06-02 23:13:27] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:13:27] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-06-02 23:13:27] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:13:27] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:13:28] [INFO ] Deduced a trap composed of 105 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:13:29] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (OVERLAPS) 367/510 variables, 143/169 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:13:35] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/510 variables, and 170 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (OVERLAPS) 367/510 variables, 143/170 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 366/536 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 23:13:58] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 537 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 21/21 constraints]
After SMT, in 60252ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60259ms
Starting structural reductions in LTL mode, iteration 1 : 143/175 places, 367/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60676 ms. Remains : 143/175 places, 367/442 transitions.
[2024-06-02 23:14:19] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:14:19] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:14:19] [INFO ] Input system was already deterministic with 367 transitions.
[2024-06-02 23:14:19] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:14:19] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:14:20] [INFO ] Time to serialize gal into /tmp/CTLFireability8794140411874482346.gal : 4 ms
[2024-06-02 23:14:20] [INFO ] Time to serialize properties into /tmp/CTLFireability11209047398767578511.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/CTLFireability8794140411874482346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11209047398767578511.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.84817e+06,0.997204,22588,2,4604,5,54907,6,0,941,74938,0


Converting to forward existential form...Done !
original formula: EF((A((p30!=1) U EX(AG(((p78==1)&&(p162==1))))) * ((AX(EF((p29==1))) + (p30==1)) + (((AX(E((p106==1) U (p164==1))) * (p78==1)) * ((p130==...235
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !((E(!(EX(!(E(TRUE U !(((p78==1)&&(p162==1))))))) U (!((p30!=1)) * !(EX(!(E(TRUE U !(((p7...832
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t21, t22, t23, t25, t26, t33, t34, t36, t39, t40, t43, t46, t48, t52, t56, t58,...519
(forward)formula 0,0,6.48821,148428,1,0,972,845419,770,499,7914,597096,1096
FORMULA MedleyA-PT-15-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 442/442 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 148 transition count 393
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 148 transition count 393
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 68 place count 148 transition count 379
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 147 transition count 377
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 147 transition count 377
Applied a total of 70 rules in 4 ms. Remains 147 /175 variables (removed 28) and now considering 377/442 (removed 65) transitions.
// Phase 1: matrix 377 rows 147 cols
[2024-06-02 23:14:26] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:14:26] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 23:14:26] [INFO ] Invariant cache hit.
[2024-06-02 23:14:26] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2024-06-02 23:14:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:14:31] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 4 ms to minimize.
[2024-06-02 23:14:31] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 2 ms to minimize.
[2024-06-02 23:14:31] [INFO ] Deduced a trap composed of 83 places in 190 ms of which 3 ms to minimize.
[2024-06-02 23:14:31] [INFO ] Deduced a trap composed of 86 places in 183 ms of which 2 ms to minimize.
[2024-06-02 23:14:31] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 3 ms to minimize.
[2024-06-02 23:14:32] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 3 ms to minimize.
[2024-06-02 23:14:32] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-06-02 23:14:32] [INFO ] Deduced a trap composed of 91 places in 185 ms of which 3 ms to minimize.
[2024-06-02 23:14:32] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:14:33] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:14:33] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:14:33] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 3 ms to minimize.
[2024-06-02 23:14:34] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 23:14:36] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 2 ms to minimize.
[2024-06-02 23:14:36] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:14:37] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 23:14:41] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (OVERLAPS) 377/524 variables, 147/173 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 23:14:50] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/524 variables, and 174 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 377/524 variables, 147/174 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 376/550 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 376 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 550 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 20/20 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in LTL mode, iteration 1 : 147/175 places, 377/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60488 ms. Remains : 147/175 places, 377/442 transitions.
[2024-06-02 23:15:27] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:15:27] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:15:27] [INFO ] Input system was already deterministic with 377 transitions.
[2024-06-02 23:15:27] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:15:27] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:15:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16790013005933795915.gal : 4 ms
[2024-06-02 23:15:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4820146328023906695.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/CTLFireability16790013005933795915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4820146328023906695.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.98158e+06,0.883345,21324,2,4369,5,50485,6,0,967,68234,0


Converting to forward existential form...Done !
original formula: !(E(((!(AF((((p71==1)&&(p124==1))||(p29==1)))) * (E((p97!=1) U (p107==1)) + AX((p70==1)))) + EG(((((((p11==1)&&(p39==1))&&((p188==1)&&(p1...269
=> equivalent forward existential formula: [(FwdU(Init,((!(!(EG(!((((p71==1)&&(p124==1))||(p29==1)))))) * (E((p97!=1) U (p107==1)) + !(EX(!((p70==1)))))) +...329
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t64,...541
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 23:15:57] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:15:57] [INFO ] Applying decomposition
[2024-06-02 23:15:57] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10821426942155314167.txt' '-o' '/tmp/graph10821426942155314167.bin' '-w' '/tmp/graph10821426942155314167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10821426942155314167.bin' '-l' '-1' '-v' '-w' '/tmp/graph10821426942155314167.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:15:57] [INFO ] Decomposing Gal with order
[2024-06-02 23:15:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:15:57] [INFO ] Removed a total of 534 redundant transitions.
[2024-06-02 23:15:57] [INFO ] Flatten gal took : 107 ms
[2024-06-02 23:15:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 32 ms.
[2024-06-02 23:15:57] [INFO ] Time to serialize gal into /tmp/CTLFireability12625592176665751445.gal : 11 ms
[2024-06-02 23:15:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13899427977278194911.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/CTLFireability12625592176665751445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13899427977278194911.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.98158e+06,0.494459,13560,553,30,17723,582,678,44512,65,1935,0


Converting to forward existential form...Done !
original formula: !(E(((!(AF((((i5.u22.p71==1)&&(i1.u39.p124==1))||(i10.i2.u9.p29==1)))) * (E((i4.u31.p97!=1) U (i5.u34.p107==1)) + AX((i5.u22.p70==1)))) +...423
=> equivalent forward existential formula: [(FwdU(Init,((!(!(EG(!((((i5.u22.p71==1)&&(i1.u39.p124==1))||(i10.i2.u9.p29==1)))))) * (E((i4.u31.p97!=1) U (i5....483
Reverse transition relation is NOT exact ! Due to transitions t8, t20, t24, t31, t34, t50, t56, t71, t73, t76, t84, t87, t107, t149, t151, t157, t159, i0.i...774
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,6.56489,159816,1,0,176313,582,4518,1.27118e+06,334,1935,365644
FORMULA MedleyA-PT-15-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 23:16:04] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:16:04] [INFO ] Flatten gal took : 10 ms
Total runtime 1012751 ms.

BK_STOP 1717370164310

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-15"
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-15, 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-171734920000114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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