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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 130K 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-20-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717385801974

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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-03 03:36:44] [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-03 03:36:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 03:36:44] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2024-06-03 03:36:44] [INFO ] Transformed 273 places.
[2024-06-03 03:36:44] [INFO ] Transformed 518 transitions.
[2024-06-03 03:36:44] [INFO ] Found NUPN structural information;
[2024-06-03 03:36:44] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Support contains 90 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 518/518 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 193 transition count 438
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 193 transition count 438
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 163 place count 193 transition count 435
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 181 place count 175 transition count 385
Iterating global reduction 1 with 18 rules applied. Total rules applied 199 place count 175 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 200 place count 175 transition count 384
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 201 place count 174 transition count 382
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 174 transition count 382
Applied a total of 202 rules in 135 ms. Remains 174 /273 variables (removed 99) and now considering 382/518 (removed 136) transitions.
// Phase 1: matrix 382 rows 174 cols
[2024-06-03 03:36:45] [INFO ] Computed 11 invariants in 43 ms
[2024-06-03 03:36:45] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-06-03 03:36:45] [INFO ] Invariant cache hit.
[2024-06-03 03:36:46] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2024-06-03 03:36:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-03 03:36:52] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 30 ms to minimize.
[2024-06-03 03:36:52] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 3 ms to minimize.
[2024-06-03 03:36:53] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 3 ms to minimize.
[2024-06-03 03:36:53] [INFO ] Deduced a trap composed of 89 places in 202 ms of which 4 ms to minimize.
[2024-06-03 03:36:53] [INFO ] Deduced a trap composed of 88 places in 198 ms of which 3 ms to minimize.
[2024-06-03 03:36:53] [INFO ] Deduced a trap composed of 106 places in 192 ms of which 4 ms to minimize.
[2024-06-03 03:36:54] [INFO ] Deduced a trap composed of 91 places in 180 ms of which 3 ms to minimize.
[2024-06-03 03:36:54] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 2 ms to minimize.
[2024-06-03 03:36:54] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-06-03 03:36:54] [INFO ] Deduced a trap composed of 119 places in 104 ms of which 2 ms to minimize.
[2024-06-03 03:36:54] [INFO ] Deduced a trap composed of 119 places in 102 ms of which 2 ms to minimize.
[2024-06-03 03:36:54] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 2 ms to minimize.
[2024-06-03 03:36:54] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-06-03 03:36:55] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 1 ms to minimize.
[2024-06-03 03:36:55] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-03 03:36:55] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-06-03 03:36:55] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2024-06-03 03:36:55] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-03 03:37:00] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 3 ms to minimize.
[2024-06-03 03:37:00] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-06-03 03:37:00] [INFO ] Deduced a trap composed of 112 places in 192 ms of which 3 ms to minimize.
[2024-06-03 03:37:00] [INFO ] Deduced a trap composed of 116 places in 167 ms of which 3 ms to minimize.
[2024-06-03 03:37:01] [INFO ] Deduced a trap composed of 121 places in 164 ms of which 3 ms to minimize.
[2024-06-03 03:37:01] [INFO ] Deduced a trap composed of 109 places in 190 ms of which 3 ms to minimize.
[2024-06-03 03:37:01] [INFO ] Deduced a trap composed of 111 places in 177 ms of which 3 ms to minimize.
[2024-06-03 03:37:01] [INFO ] Deduced a trap composed of 100 places in 182 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-03 03:37:05] [INFO ] Deduced a trap composed of 105 places in 176 ms of which 3 ms to minimize.
[2024-06-03 03:37:05] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-03 03:37:08] [INFO ] Deduced a trap composed of 114 places in 185 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-03 03:37:13] [INFO ] Deduced a trap composed of 104 places in 182 ms of which 3 ms to minimize.
[2024-06-03 03:37:14] [INFO ] Deduced a trap composed of 94 places in 182 ms of which 3 ms to minimize.
[2024-06-03 03:37:14] [INFO ] Deduced a trap composed of 108 places in 176 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 381 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 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 174/556 variables, and 43 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/174 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (OVERLAPS) 382/556 variables, 174/217 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 381/598 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-03 03:37:26] [INFO ] Deduced a trap composed of 114 places in 112 ms of which 3 ms to minimize.
[2024-06-03 03:37:26] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2024-06-03 03:37:28] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 2 ms to minimize.
[2024-06-03 03:37:29] [INFO ] Deduced a trap composed of 112 places in 121 ms of which 2 ms to minimize.
[2024-06-03 03:37:29] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 2 ms to minimize.
[2024-06-03 03:37:29] [INFO ] Deduced a trap composed of 98 places in 203 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 6/604 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-03 03:37:42] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 605 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 39/39 constraints]
After SMT, in 60797ms problems are : Problem set: 0 solved, 381 unsolved
Search for dead transitions found 0 dead transitions in 60848ms
Starting structural reductions in LTL mode, iteration 1 : 174/273 places, 382/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62156 ms. Remains : 174/273 places, 382/518 transitions.
Support contains 90 out of 174 places after structural reductions.
[2024-06-03 03:37:47] [INFO ] Flatten gal took : 134 ms
[2024-06-03 03:37:47] [INFO ] Flatten gal took : 58 ms
[2024-06-03 03:37:48] [INFO ] Input system was already deterministic with 382 transitions.
RANDOM walk for 40000 steps (34 resets) in 3597 ms. (11 steps per ms) remains 36/68 properties
BEST_FIRST walk for 4003 steps (19 resets) in 46 ms. (85 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4003 steps (17 resets) in 50 ms. (78 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4003 steps (15 resets) in 41 ms. (95 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4003 steps (15 resets) in 51 ms. (76 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (17 resets) in 29 ms. (133 steps per ms) remains 25/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 21 ms. (181 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4003 steps (17 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (26 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (15 resets) in 31 ms. (125 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4002 steps (17 resets) in 24 ms. (160 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (15 resets) in 14 ms. (266 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (15 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (15 resets) in 49 ms. (80 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (23 resets) in 15 ms. (250 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 12/14 properties
[2024-06-03 03:37:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 103/131 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/135 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 39/174 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 382/556 variables, 174/185 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/185 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/556 variables, 0/185 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 185 constraints, problems are : Problem set: 2 solved, 10 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 107/131 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/135 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 39/174 variables, 2/11 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 382/556 variables, 174/185 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 9/194 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 194 constraints, problems are : Problem set: 3 solved, 9 unsolved in 1010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 9/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 1851ms problems are : Problem set: 3 solved, 9 unsolved
Parikh walk visited 7 properties in 4276 ms.
Support contains 8 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 382/382 transitions.
Graph (trivial) has 137 edges and 174 vertex of which 23 / 174 are part of one of the 3 SCC in 3 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 35 transitions.
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 0 with 4 rules applied. Total rules applied 5 place count 154 transition count 343
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 150 transition count 341
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 11 place count 150 transition count 336
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 145 transition count 336
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 48 place count 118 transition count 285
Iterating global reduction 2 with 27 rules applied. Total rules applied 75 place count 118 transition count 285
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2 with 9 rules applied. Total rules applied 84 place count 118 transition count 276
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 88 place count 116 transition count 274
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 88 place count 116 transition count 271
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 113 transition count 271
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 111 transition count 266
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 111 transition count 266
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 110 transition count 263
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 110 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 110 transition count 262
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 131 place count 95 transition count 247
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 138 place count 88 transition count 226
Iterating global reduction 5 with 7 rules applied. Total rules applied 145 place count 88 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 148 place count 88 transition count 223
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 149 place count 87 transition count 221
Iterating global reduction 6 with 1 rules applied. Total rules applied 150 place count 87 transition count 221
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 151 place count 86 transition count 218
Iterating global reduction 6 with 1 rules applied. Total rules applied 152 place count 86 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 153 place count 86 transition count 217
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 169 place count 78 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 175 place count 78 transition count 225
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 177 place count 76 transition count 219
Iterating global reduction 7 with 2 rules applied. Total rules applied 179 place count 76 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 181 place count 76 transition count 217
Free-agglomeration rule applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 201 place count 76 transition count 197
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 221 place count 56 transition count 197
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 224 place count 56 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 225 place count 55 transition count 193
Applied a total of 225 rules in 153 ms. Remains 55 /174 variables (removed 119) and now considering 193/382 (removed 189) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 55/174 places, 193/382 transitions.
RANDOM walk for 40000 steps (10 resets) in 1440 ms. (27 steps per ms) remains 1/2 properties
BEST_FIRST walk for 15430 steps (4 resets) in 31 ms. (482 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-06-03 03:37:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-03 03:37:56] [INFO ] Flatten gal took : 28 ms
[2024-06-03 03:37:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-20-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 03:37:56] [INFO ] Flatten gal took : 30 ms
[2024-06-03 03:37:56] [INFO ] Input system was already deterministic with 382 transitions.
Support contains 73 out of 174 places (down from 84) after GAL structural reductions.
Computed a total of 14 stabilizing places and 19 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 140 transition count 319
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 140 transition count 319
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 140 transition count 315
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 87 place count 125 transition count 279
Iterating global reduction 1 with 15 rules applied. Total rules applied 102 place count 125 transition count 279
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 125 transition count 276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 123 transition count 271
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 123 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 123 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 122 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 122 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 122 transition count 266
Applied a total of 113 rules in 12 ms. Remains 122 /174 variables (removed 52) and now considering 266/382 (removed 116) transitions.
// Phase 1: matrix 266 rows 122 cols
[2024-06-03 03:37:56] [INFO ] Computed 11 invariants in 5 ms
[2024-06-03 03:37:56] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-03 03:37:56] [INFO ] Invariant cache hit.
[2024-06-03 03:37:56] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2024-06-03 03:37:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-03 03:37:58] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
[2024-06-03 03:37:58] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
[2024-06-03 03:37:58] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 2 ms to minimize.
[2024-06-03 03:37:59] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 2 ms to minimize.
[2024-06-03 03:37:59] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 3 ms to minimize.
[2024-06-03 03:37:59] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-06-03 03:37:59] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 3 ms to minimize.
[2024-06-03 03:37:59] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-06-03 03:37:59] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-06-03 03:37:59] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-03 03:38:02] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 3 ms to minimize.
[2024-06-03 03:38:02] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 266/388 variables, 122/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-03 03:38:08] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 4 ms to minimize.
[2024-06-03 03:38:08] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-03 03:38:11] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-06-03 03:38:12] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 2 ms to minimize.
[2024-06-03 03:38:12] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 3 ms to minimize.
[2024-06-03 03:38:12] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 8 ms to minimize.
[2024-06-03 03:38:12] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 3 ms to minimize.
[2024-06-03 03:38:12] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 2 ms to minimize.
[2024-06-03 03:38:12] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-06-03 03:38:12] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-03 03:38:14] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 11 (OVERLAPS) 0/388 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 156 constraints, problems are : Problem set: 0 solved, 265 unsolved in 27998 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 266/388 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 265/421 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-03 03:38:30] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-06-03 03:38:30] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-06-03 03:38:30] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2024-06-03 03:38:30] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-06-03 03:38:30] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-06-03 03:38:30] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2024-06-03 03:38:30] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 7/428 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 428 constraints, problems are : Problem set: 0 solved, 265 unsolved in 24851 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 30/30 constraints]
After SMT, in 52978ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 52984ms
Starting structural reductions in LTL mode, iteration 1 : 122/174 places, 266/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53316 ms. Remains : 122/174 places, 266/382 transitions.
[2024-06-03 03:38:49] [INFO ] Flatten gal took : 17 ms
[2024-06-03 03:38:49] [INFO ] Flatten gal took : 18 ms
[2024-06-03 03:38:49] [INFO ] Input system was already deterministic with 266 transitions.
[2024-06-03 03:38:49] [INFO ] Flatten gal took : 16 ms
[2024-06-03 03:38:49] [INFO ] Flatten gal took : 16 ms
[2024-06-03 03:38:49] [INFO ] Time to serialize gal into /tmp/CTLFireability10701244749527779705.gal : 10 ms
[2024-06-03 03:38:49] [INFO ] Time to serialize properties into /tmp/CTLFireability17139572760815234311.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10701244749527779705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17139572760815234311.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,8.04575e+08,21.0135,402052,2,16463,5,1.30044e+06,6,0,756,1.74634e+06,0


Converting to forward existential form...Done !
original formula: AG(((A((!(((((p10==1)&&(p17==1))&&((p204==1)&&(p157==1)))&&(p245==1))) + EX(((p118==1)&&(p29==1)))) U ((p218==1)&&(p92==1))) + (p11==0)) ...168
=> equivalent forward existential formula: ([(((FwdU(((FwdU(Init,TRUE) * !((p145==0))) * !((p11==0))),!(((p218==1)&&(p92==1)))) * !(((p218==1)&&(p92==1))))...358
Hit Full ! (commute/partial/dont) 255/0/11
Detected timeout of ITS tools.
[2024-06-03 03:39:19] [INFO ] Flatten gal took : 15 ms
[2024-06-03 03:39:19] [INFO ] Applying decomposition
[2024-06-03 03:39:19] [INFO ] Flatten gal took : 15 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/graph9399133081619214440.txt' '-o' '/tmp/graph9399133081619214440.bin' '-w' '/tmp/graph9399133081619214440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9399133081619214440.bin' '-l' '-1' '-v' '-w' '/tmp/graph9399133081619214440.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:39:19] [INFO ] Decomposing Gal with order
[2024-06-03 03:39:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:39:20] [INFO ] Removed a total of 381 redundant transitions.
[2024-06-03 03:39:20] [INFO ] Flatten gal took : 90 ms
[2024-06-03 03:39:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 14 ms.
[2024-06-03 03:39:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16875144658765555508.gal : 7 ms
[2024-06-03 03:39:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12937001743057593432.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/CTLFireability16875144658765555508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12937001743057593432.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,8.04575e+08,1.9209,49896,940,80,95027,823,536,131918,94,2737,0


Converting to forward existential form...Done !
original formula: AG(((A((!(((((i5.u1.p10==1)&&(i5.u3.p17==1))&&((i5.u20.p204==1)&&(i3.u16.p157==1)))&&(i7.u26.p245==1))) + EX(((i3.u14.p118==1)&&(i2.u7.p2...241
=> equivalent forward existential formula: ([(((FwdU(((FwdU(Init,TRUE) * !((i3.u15.p145==0))) * !((i0.u2.p11==0))),!(((i4.u21.p218==1)&&(i2.u11.p92==1)))) ...472
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,5.31285,116424,1,0,225691,1271,2197,354132,355,4807,495181
FORMULA MedleyA-PT-20-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 139 transition count 318
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 139 transition count 318
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 74 place count 139 transition count 314
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 90 place count 123 transition count 275
Iterating global reduction 1 with 16 rules applied. Total rules applied 106 place count 123 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 110 place count 123 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 119 transition count 261
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 119 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 121 place count 119 transition count 258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 118 transition count 255
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 118 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 118 transition count 254
Applied a total of 124 rules in 11 ms. Remains 118 /174 variables (removed 56) and now considering 254/382 (removed 128) transitions.
// Phase 1: matrix 254 rows 118 cols
[2024-06-03 03:39:25] [INFO ] Computed 11 invariants in 2 ms
[2024-06-03 03:39:25] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-03 03:39:25] [INFO ] Invariant cache hit.
[2024-06-03 03:39:25] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-06-03 03:39:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:39:27] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 2 ms to minimize.
[2024-06-03 03:39:27] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-06-03 03:39:27] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 3 ms to minimize.
[2024-06-03 03:39:27] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
[2024-06-03 03:39:28] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-06-03 03:39:28] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-06-03 03:39:28] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-06-03 03:39:28] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:39:30] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-06-03 03:39:30] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 254/372 variables, 118/139 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:39:35] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:39:37] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 141 constraints, problems are : Problem set: 0 solved, 253 unsolved in 20851 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 254/372 variables, 118/141 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 253/394 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:39:52] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 3 ms to minimize.
[2024-06-03 03:39:52] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-06-03 03:39:52] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 1 ms to minimize.
[2024-06-03 03:39:52] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-06-03 03:39:52] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 5/399 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 399 constraints, problems are : Problem set: 0 solved, 253 unsolved in 22888 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 17/17 constraints]
After SMT, in 43859ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 43863ms
Starting structural reductions in LTL mode, iteration 1 : 118/174 places, 254/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44182 ms. Remains : 118/174 places, 254/382 transitions.
[2024-06-03 03:40:09] [INFO ] Flatten gal took : 24 ms
[2024-06-03 03:40:09] [INFO ] Flatten gal took : 20 ms
[2024-06-03 03:40:09] [INFO ] Input system was already deterministic with 254 transitions.
[2024-06-03 03:40:09] [INFO ] Flatten gal took : 19 ms
[2024-06-03 03:40:09] [INFO ] Flatten gal took : 20 ms
[2024-06-03 03:40:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3092332220673929649.gal : 5 ms
[2024-06-03 03:40:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15612891728070335670.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/CTLFireability3092332220673929649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15612891728070335670.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,6.75467e+08,22.1087,440692,2,17450,5,1.33827e+06,6,0,728,1.98956e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 03:40:39] [INFO ] Flatten gal took : 11 ms
[2024-06-03 03:40:39] [INFO ] Applying decomposition
[2024-06-03 03:40:39] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8311924559053536862.txt' '-o' '/tmp/graph8311924559053536862.bin' '-w' '/tmp/graph8311924559053536862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8311924559053536862.bin' '-l' '-1' '-v' '-w' '/tmp/graph8311924559053536862.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:40:39] [INFO ] Decomposing Gal with order
[2024-06-03 03:40:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:40:39] [INFO ] Removed a total of 369 redundant transitions.
[2024-06-03 03:40:39] [INFO ] Flatten gal took : 31 ms
[2024-06-03 03:40:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2024-06-03 03:40:40] [INFO ] Time to serialize gal into /tmp/CTLFireability16788073898342441798.gal : 5 ms
[2024-06-03 03:40:40] [INFO ] Time to serialize properties into /tmp/CTLFireability2693982583484116648.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/CTLFireability16788073898342441798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2693982583484116648.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.75467e+08,0.831434,22640,822,58,37369,1068,477,59460,89,2791,0


Converting to forward existential form...Done !
original formula: EX(AF(AG(AF((((i4.u2.p10==0)||(i4.u6.p25==0))||(i5.u19.p175==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !(!(EG(!((((i4.u2.p10==0)||(i4.u6.p25==0))||(i5.u19.p175==0))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t43, t93, t95, t171, t172, t173, t174, t175, t176, t193, t194, t195, t203, t204, t20...565
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,22.9546,485324,1,0,770578,8100,2946,1.94991e+06,517,41595,1955629
FORMULA MedleyA-PT-20-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 141 transition count 322
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 141 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 141 transition count 319
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 83 place count 127 transition count 283
Iterating global reduction 1 with 14 rules applied. Total rules applied 97 place count 127 transition count 283
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 100 place count 127 transition count 280
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 123 transition count 270
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 123 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 123 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 122 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 122 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 122 transition count 264
Applied a total of 113 rules in 15 ms. Remains 122 /174 variables (removed 52) and now considering 264/382 (removed 118) transitions.
// Phase 1: matrix 264 rows 122 cols
[2024-06-03 03:41:03] [INFO ] Computed 11 invariants in 2 ms
[2024-06-03 03:41:03] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-03 03:41:03] [INFO ] Invariant cache hit.
[2024-06-03 03:41:03] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-06-03 03:41:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-03 03:41:06] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-06-03 03:41:06] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 3 ms to minimize.
[2024-06-03 03:41:06] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 3 ms to minimize.
[2024-06-03 03:41:07] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 3 ms to minimize.
[2024-06-03 03:41:07] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 3 ms to minimize.
[2024-06-03 03:41:07] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 3 ms to minimize.
[2024-06-03 03:41:07] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 2 ms to minimize.
[2024-06-03 03:41:07] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 3 ms to minimize.
[2024-06-03 03:41:08] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-06-03 03:41:08] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-03 03:41:10] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 264/386 variables, 122/144 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-03 03:41:16] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 2 ms to minimize.
[2024-06-03 03:41:16] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 3 ms to minimize.
[2024-06-03 03:41:16] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 3 ms to minimize.
[2024-06-03 03:41:17] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 148 constraints, problems are : Problem set: 0 solved, 263 unsolved in 22817 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-03 03:41:28] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 3 ms to minimize.
[2024-06-03 03:41:29] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 264/386 variables, 122/150 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 263/413 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-03 03:41:33] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 2 ms to minimize.
[2024-06-03 03:41:35] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-03 03:41:35] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-03 03:41:41] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 2 ms to minimize.
[2024-06-03 03:41:41] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 3 ms to minimize.
[2024-06-03 03:41:42] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2024-06-03 03:41:42] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 2 ms to minimize.
[2024-06-03 03:41:43] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 2 ms to minimize.
[2024-06-03 03:41:43] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 3 ms to minimize.
[2024-06-03 03:41:43] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2024-06-03 03:41:43] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 424 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 28/28 constraints]
After SMT, in 52983ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 52988ms
Starting structural reductions in LTL mode, iteration 1 : 122/174 places, 264/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53453 ms. Remains : 122/174 places, 264/382 transitions.
[2024-06-03 03:41:56] [INFO ] Flatten gal took : 18 ms
[2024-06-03 03:41:56] [INFO ] Flatten gal took : 15 ms
[2024-06-03 03:41:56] [INFO ] Input system was already deterministic with 264 transitions.
[2024-06-03 03:41:56] [INFO ] Flatten gal took : 13 ms
[2024-06-03 03:41:56] [INFO ] Flatten gal took : 13 ms
[2024-06-03 03:41:56] [INFO ] Time to serialize gal into /tmp/CTLFireability5528303477458057561.gal : 5 ms
[2024-06-03 03:41:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14411622062023741398.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/CTLFireability5528303477458057561.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14411622062023741398.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,8.0044e+08,26.861,527484,2,19370,5,1.54886e+06,6,0,754,2.45113e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 03:42:26] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:42:26] [INFO ] Applying decomposition
[2024-06-03 03:42:26] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10061168386360070199.txt' '-o' '/tmp/graph10061168386360070199.bin' '-w' '/tmp/graph10061168386360070199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10061168386360070199.bin' '-l' '-1' '-v' '-w' '/tmp/graph10061168386360070199.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:42:26] [INFO ] Decomposing Gal with order
[2024-06-03 03:42:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:42:26] [INFO ] Removed a total of 348 redundant transitions.
[2024-06-03 03:42:26] [INFO ] Flatten gal took : 27 ms
[2024-06-03 03:42:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 6 ms.
[2024-06-03 03:42:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2217640027612654917.gal : 3 ms
[2024-06-03 03:42:26] [INFO ] Time to serialize properties into /tmp/CTLFireability4019024134728338183.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/CTLFireability2217640027612654917.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4019024134728338183.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.0044e+08,1.58641,36648,676,151,61516,2702,487,99361,143,9498,0


Converting to forward existential form...Done !
original formula: (AG((((!(A((((i1.u2.p10==1)&&(u6.p25==1))&&(i2.u10.p35==1)) U (((i1.u2.p10==1)&&(i1.u4.p17==1))&&(i4.u11.p103==1)))) * A(AF((i4.u11.p120=...323
=> equivalent forward existential formula: (([((((FwdU(Init,TRUE) * !(((i6.u19.p230==0)&&((i1.u4.p16==0)||(i4.u11.p125==0))))) * !(((u6.p24==1)&&(i4.u11.p1...906
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t100, t102, t171, t172, t173, t174, t175, t178, t179, t180, t181, t182, t183, t...653
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,13.4495,238956,1,0,378734,22949,3246,894586,885,85298,988063
FORMULA MedleyA-PT-20-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 144 transition count 327
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 144 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 144 transition count 323
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 77 place count 131 transition count 291
Iterating global reduction 1 with 13 rules applied. Total rules applied 90 place count 131 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 93 place count 131 transition count 288
Applied a total of 93 rules in 6 ms. Remains 131 /174 variables (removed 43) and now considering 288/382 (removed 94) transitions.
// Phase 1: matrix 288 rows 131 cols
[2024-06-03 03:42:40] [INFO ] Computed 11 invariants in 3 ms
[2024-06-03 03:42:40] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-03 03:42:40] [INFO ] Invariant cache hit.
[2024-06-03 03:42:40] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2024-06-03 03:42:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-03 03:42:43] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 2 ms to minimize.
[2024-06-03 03:42:43] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2024-06-03 03:42:43] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-06-03 03:42:43] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
[2024-06-03 03:42:43] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-06-03 03:42:43] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 2 ms to minimize.
[2024-06-03 03:42:43] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-06-03 03:42:43] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-06-03 03:42:44] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 2 ms to minimize.
[2024-06-03 03:42:44] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 3 ms to minimize.
[2024-06-03 03:42:44] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-06-03 03:42:44] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-06-03 03:42:44] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-06-03 03:42:44] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-06-03 03:42:44] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-06-03 03:42:45] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-06-03 03:42:45] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-06-03 03:42:45] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-03 03:42:47] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-06-03 03:42:47] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2024-06-03 03:42:47] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-03 03:42:48] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-03 03:42:50] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (OVERLAPS) 288/419 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/419 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 165 constraints, problems are : Problem set: 0 solved, 287 unsolved in 22397 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-03 03:43:05] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-06-03 03:43:06] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-06-03 03:43:06] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-03 03:43:07] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-06-03 03:43:07] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 288/419 variables, 131/170 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 287/457 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-03 03:43:13] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-06-03 03:43:14] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2024-06-03 03:43:14] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 2 ms to minimize.
[2024-06-03 03:43:14] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-03 03:43:21] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 3 ms to minimize.
[2024-06-03 03:43:22] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/419 variables, and 463 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 34/34 constraints]
After SMT, in 52516ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 52520ms
Starting structural reductions in LTL mode, iteration 1 : 131/174 places, 288/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52798 ms. Remains : 131/174 places, 288/382 transitions.
[2024-06-03 03:43:33] [INFO ] Flatten gal took : 11 ms
[2024-06-03 03:43:33] [INFO ] Flatten gal took : 11 ms
[2024-06-03 03:43:33] [INFO ] Input system was already deterministic with 288 transitions.
[2024-06-03 03:43:33] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:43:33] [INFO ] Flatten gal took : 12 ms
[2024-06-03 03:43:33] [INFO ] Time to serialize gal into /tmp/CTLFireability175026680374775351.gal : 4 ms
[2024-06-03 03:43:33] [INFO ] Time to serialize properties into /tmp/CTLFireability16802156610688169828.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/CTLFireability175026680374775351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16802156610688169828.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.
Detected timeout of ITS tools.
[2024-06-03 03:44:03] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:44:03] [INFO ] Applying decomposition
[2024-06-03 03:44:03] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13032706024577972609.txt' '-o' '/tmp/graph13032706024577972609.bin' '-w' '/tmp/graph13032706024577972609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13032706024577972609.bin' '-l' '-1' '-v' '-w' '/tmp/graph13032706024577972609.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:44:03] [INFO ] Decomposing Gal with order
[2024-06-03 03:44:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:44:03] [INFO ] Removed a total of 426 redundant transitions.
[2024-06-03 03:44:03] [INFO ] Flatten gal took : 36 ms
[2024-06-03 03:44:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 12 ms.
[2024-06-03 03:44:03] [INFO ] Time to serialize gal into /tmp/CTLFireability2146997787125463721.gal : 4 ms
[2024-06-03 03:44:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7443311453684248183.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/CTLFireability2146997787125463721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7443311453684248183.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.23037e+09,1.15322,23148,697,83,37381,1307,574,62238,106,2694,0


Converting to forward existential form...Done !
original formula: (EF((i3.u14.p86==1)) * (E(((u5.p24==1)&&(i6.u22.p201==1)) U ((((((EX((((i0.u1.p10==1)&&(i1.u4.p21==1))&&(i3.u9.p39==1))) * (i5.u20.p161==...485
=> equivalent forward existential formula: (([(FwdU(FwdU((FwdU((Init * E(TRUE U (i3.u14.p86==1))),((u5.p24==1)&&(i6.u22.p201==1))) * (((((EX((((i0.u1.p10==...945
Reverse transition relation is NOT exact ! Due to transitions t7, t17, t43, t109, t111, t122, t156, t178, t183, t184, t185, t186, t187, t188, t193, t194, t...734
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 141 transition count 322
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 141 transition count 322
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 141 transition count 318
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 85 place count 126 transition count 282
Iterating global reduction 1 with 15 rules applied. Total rules applied 100 place count 126 transition count 282
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 103 place count 126 transition count 279
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 123 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 123 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 111 place count 123 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 122 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 122 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 122 transition count 266
Applied a total of 114 rules in 10 ms. Remains 122 /174 variables (removed 52) and now considering 266/382 (removed 116) transitions.
// Phase 1: matrix 266 rows 122 cols
[2024-06-03 03:44:33] [INFO ] Computed 11 invariants in 8 ms
[2024-06-03 03:44:33] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-03 03:44:33] [INFO ] Invariant cache hit.
[2024-06-03 03:44:33] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2024-06-03 03:44:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-03 03:44:37] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2024-06-03 03:44:37] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
[2024-06-03 03:44:37] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-03 03:44:37] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 2 ms to minimize.
[2024-06-03 03:44:37] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-06-03 03:44:37] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 3 ms to minimize.
[2024-06-03 03:44:37] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
[2024-06-03 03:44:37] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 3 ms to minimize.
[2024-06-03 03:44:38] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-03 03:44:40] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-06-03 03:44:41] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2024-06-03 03:44:41] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-06-03 03:44:41] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 2 ms to minimize.
[2024-06-03 03:44:41] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 3 ms to minimize.
[2024-06-03 03:44:41] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-06-03 03:44:41] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-03 03:44:42] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 2 ms to minimize.
[2024-06-03 03:44:42] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2024-06-03 03:44:43] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 2 ms to minimize.
[2024-06-03 03:44:43] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 2 ms to minimize.
[2024-06-03 03:44:43] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-03 03:44:43] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-06-03 03:44:43] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 2 ms to minimize.
[2024-06-03 03:44:43] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-06-03 03:44:43] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 2 ms to minimize.
[2024-06-03 03:44:44] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-03 03:44:44] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-03 03:44:47] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 266/388 variables, 122/161 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 11 (OVERLAPS) 0/388 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 161 constraints, problems are : Problem set: 0 solved, 265 unsolved in 24343 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 266/388 variables, 122/161 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 265/426 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-03 03:45:04] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 3 ms to minimize.
[2024-06-03 03:45:04] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-03 03:45:21] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/388 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 429 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 31/31 constraints]
After SMT, in 54510ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 54513ms
Starting structural reductions in LTL mode, iteration 1 : 122/174 places, 266/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54821 ms. Remains : 122/174 places, 266/382 transitions.
[2024-06-03 03:45:28] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:45:28] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:45:28] [INFO ] Input system was already deterministic with 266 transitions.
[2024-06-03 03:45:28] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:45:28] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:45:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14187324639811688271.gal : 2 ms
[2024-06-03 03:45:28] [INFO ] Time to serialize properties into /tmp/CTLFireability1862119493991431852.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/CTLFireability14187324639811688271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1862119493991431852.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,8.00013e+08,26.6828,511588,2,20226,5,1.45377e+06,6,0,756,2.2917e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 03:45:58] [INFO ] Flatten gal took : 7 ms
[2024-06-03 03:45:58] [INFO ] Applying decomposition
[2024-06-03 03:45:58] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14805968250514316725.txt' '-o' '/tmp/graph14805968250514316725.bin' '-w' '/tmp/graph14805968250514316725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14805968250514316725.bin' '-l' '-1' '-v' '-w' '/tmp/graph14805968250514316725.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:45:58] [INFO ] Decomposing Gal with order
[2024-06-03 03:45:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:45:58] [INFO ] Removed a total of 392 redundant transitions.
[2024-06-03 03:45:58] [INFO ] Flatten gal took : 18 ms
[2024-06-03 03:45:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2024-06-03 03:45:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13002453344628705654.gal : 4 ms
[2024-06-03 03:45:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13417917399785834998.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/CTLFireability13002453344628705654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13417917399785834998.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,8.00013e+08,1.37963,37784,695,71,65922,702,513,115052,94,1728,0


Converting to forward existential form...Done !
original formula: AG((AG((((((i2.u9.p56==1)&&(i7.u25.p241==1))&&((i1.u2.p10==1)&&(i1.u5.p21==1)))&&(i4.u14.p131==1)) + AX((i2.u9.p90==1)))) + AG(EF(((i1.u5...186
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(E(TRUE U !((((((i2.u9.p56==1)&&(i7.u25.p241==1))&&((i1.u2.p10==1)&&(i1.u5.p21==1))...274
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t96, t98, t116, t136, t159, t173, t174, t175, t176, t177, t178, t180, t181, t18...664
(forward)formula 0,0,22.8861,487272,1,0,673159,16846,3275,2.34735e+06,530,143933,1570285
FORMULA MedleyA-PT-20-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 140 transition count 317
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 140 transition count 317
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 140 transition count 313
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 88 place count 124 transition count 275
Iterating global reduction 1 with 16 rules applied. Total rules applied 104 place count 124 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 108 place count 124 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 112 place count 120 transition count 261
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 120 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 119 place count 120 transition count 258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 119 transition count 255
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 119 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 119 transition count 254
Applied a total of 122 rules in 12 ms. Remains 119 /174 variables (removed 55) and now considering 254/382 (removed 128) transitions.
// Phase 1: matrix 254 rows 119 cols
[2024-06-03 03:46:21] [INFO ] Computed 11 invariants in 2 ms
[2024-06-03 03:46:21] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-03 03:46:21] [INFO ] Invariant cache hit.
[2024-06-03 03:46:21] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-06-03 03:46:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:46:24] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-06-03 03:46:24] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 3 ms to minimize.
[2024-06-03 03:46:24] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 2 ms to minimize.
[2024-06-03 03:46:24] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 3 ms to minimize.
[2024-06-03 03:46:24] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 2 ms to minimize.
[2024-06-03 03:46:25] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 2 ms to minimize.
[2024-06-03 03:46:25] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 3 ms to minimize.
[2024-06-03 03:46:25] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2024-06-03 03:46:25] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-06-03 03:46:25] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-06-03 03:46:25] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 3 ms to minimize.
[2024-06-03 03:46:25] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 2 ms to minimize.
[2024-06-03 03:46:25] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 2 ms to minimize.
[2024-06-03 03:46:26] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 3 ms to minimize.
[2024-06-03 03:46:26] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-06-03 03:46:26] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 2 ms to minimize.
[2024-06-03 03:46:26] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-06-03 03:46:26] [INFO ] Deduced a trap composed of 69 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:46:28] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-06-03 03:46:28] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 2 ms to minimize.
[2024-06-03 03:46:29] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 3 ms to minimize.
[2024-06-03 03:46:29] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 3 ms to minimize.
[2024-06-03 03:46:29] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 2 ms to minimize.
[2024-06-03 03:46:29] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 2 ms to minimize.
[2024-06-03 03:46:29] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:46:31] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
[2024-06-03 03:46:31] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 3 ms to minimize.
[2024-06-03 03:46:31] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 2 ms to minimize.
[2024-06-03 03:46:32] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 2 ms to minimize.
[2024-06-03 03:46:32] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 254/373 variables, 119/160 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:46:36] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-06-03 03:46:36] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-06-03 03:46:37] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:46:39] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-06-03 03:46:39] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 2 ms to minimize.
[2024-06-03 03:46:39] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-06-03 03:46:39] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
[2024-06-03 03:46:40] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 2 ms to minimize.
[2024-06-03 03:46:40] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-06-03 03:46:40] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:46:44] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:46:49] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 12 (OVERLAPS) 0/373 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/373 variables, and 172 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:46:54] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 3 ms to minimize.
[2024-06-03 03:46:54] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 254/373 variables, 119/174 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 253/427 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:47:08] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-06-03 03:47:08] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 2 ms to minimize.
[2024-06-03 03:47:08] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 3 ms to minimize.
[2024-06-03 03:47:08] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
[2024-06-03 03:47:08] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2024-06-03 03:47:08] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/373 variables, 6/433 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-03 03:47:15] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 434 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 51/51 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 119/174 places, 254/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60389 ms. Remains : 119/174 places, 254/382 transitions.
[2024-06-03 03:47:21] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:47:22] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:47:22] [INFO ] Input system was already deterministic with 254 transitions.
[2024-06-03 03:47:22] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:47:22] [INFO ] Flatten gal took : 7 ms
[2024-06-03 03:47:22] [INFO ] Time to serialize gal into /tmp/CTLFireability13600907930773950577.gal : 2 ms
[2024-06-03 03:47:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10577645738970538383.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/CTLFireability13600907930773950577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10577645738970538383.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,7.55154e+08,25.282,469088,2,22330,5,1.42857e+06,6,0,732,2.05387e+06,0


Converting to forward existential form...Done !
original formula: AG((AX((p255==1)) + (p142==0)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((p142==0)))) * !((p255==1)))] = FALSE
(forward)formula 0,0,25.5992,469088,1,0,11,1.42857e+06,11,4,1277,2.05387e+06,3
FORMULA MedleyA-PT-20-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Graph (trivial) has 143 edges and 174 vertex of which 23 / 174 are part of one of the 3 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 153 transition count 346
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 150 transition count 344
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 150 transition count 339
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 145 transition count 339
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 50 place count 114 transition count 278
Iterating global reduction 2 with 31 rules applied. Total rules applied 81 place count 114 transition count 278
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 2 with 10 rules applied. Total rules applied 91 place count 114 transition count 268
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 95 place count 112 transition count 266
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 95 place count 112 transition count 261
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 105 place count 107 transition count 261
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 105 transition count 255
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 105 transition count 255
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 135 place count 92 transition count 242
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 142 place count 85 transition count 221
Iterating global reduction 4 with 7 rules applied. Total rules applied 149 place count 85 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 153 place count 85 transition count 217
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 84 transition count 215
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 84 transition count 215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 156 place count 83 transition count 212
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 83 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 158 place count 83 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 161 place count 83 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 167 place count 80 transition count 205
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 170 place count 77 transition count 196
Iterating global reduction 6 with 3 rules applied. Total rules applied 173 place count 77 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 176 place count 77 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 178 place count 75 transition count 191
Applied a total of 178 rules in 93 ms. Remains 75 /174 variables (removed 99) and now considering 191/382 (removed 191) transitions.
[2024-06-03 03:47:47] [INFO ] Flow matrix only has 181 transitions (discarded 10 similar events)
// Phase 1: matrix 181 rows 75 cols
[2024-06-03 03:47:47] [INFO ] Computed 11 invariants in 2 ms
[2024-06-03 03:47:47] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-03 03:47:47] [INFO ] Flow matrix only has 181 transitions (discarded 10 similar events)
[2024-06-03 03:47:47] [INFO ] Invariant cache hit.
[2024-06-03 03:47:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 03:47:48] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-06-03 03:47:48] [INFO ] Redundant transitions in 8 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-03 03:47:48] [INFO ] Flow matrix only has 181 transitions (discarded 10 similar events)
[2024-06-03 03:47:48] [INFO ] Invariant cache hit.
[2024-06-03 03:47:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 1/75 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-03 03:47:50] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 180/255 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/256 variables, and 88 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5950 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 1/75 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-03 03:47:55] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 180/255 variables, 75/88 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 165/254 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-03 03:47:58] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (OVERLAPS) 0/255 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/256 variables, and 255 constraints, problems are : Problem set: 0 solved, 165 unsolved in 9993 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 3/3 constraints]
After SMT, in 16026ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 16029ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/174 places, 191/382 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16376 ms. Remains : 75/174 places, 191/382 transitions.
[2024-06-03 03:48:04] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:48:04] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:48:04] [INFO ] Input system was already deterministic with 191 transitions.
[2024-06-03 03:48:04] [INFO ] Flatten gal took : 56 ms
[2024-06-03 03:48:04] [INFO ] Flatten gal took : 25 ms
[2024-06-03 03:48:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14893579047319655771.gal : 2 ms
[2024-06-03 03:48:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16503731632192343991.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14893579047319655771.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16503731632192343991.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16503731632192343991.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 50
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :50 after 420
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :420 after 1136
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1136 after 1554
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1554 after 1990
RANDOM walk for 40000 steps (28 resets) in 831 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30386 steps (36 resets) in 135 ms. (223 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-20-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_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 : 174/174 places, 382/382 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 142 transition count 321
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 142 transition count 321
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 68 place count 142 transition count 317
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 82 place count 128 transition count 283
Iterating global reduction 1 with 14 rules applied. Total rules applied 96 place count 128 transition count 283
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 99 place count 128 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 125 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 125 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 125 transition count 269
Applied a total of 108 rules in 9 ms. Remains 125 /174 variables (removed 49) and now considering 269/382 (removed 113) transitions.
// Phase 1: matrix 269 rows 125 cols
[2024-06-03 03:48:04] [INFO ] Computed 11 invariants in 3 ms
[2024-06-03 03:48:04] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-03 03:48:04] [INFO ] Invariant cache hit.
[2024-06-03 03:48:05] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-06-03 03:48:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-03 03:48:09] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-06-03 03:48:09] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-06-03 03:48:09] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2024-06-03 03:48:10] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 2 ms to minimize.
[2024-06-03 03:48:10] [INFO ] Deduced a trap composed of 72 places in 165 ms of which 3 ms to minimize.
[2024-06-03 03:48:10] [INFO ] Deduced a trap composed of 77 places in 167 ms of which 3 ms to minimize.
[2024-06-03 03:48:10] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 4 ms to minimize.
[2024-06-03 03:48:10] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 2 ms to minimize.
[2024-06-03 03:48:11] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 3 ms to minimize.
[2024-06-03 03:48:11] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 3 ms to minimize.
[2024-06-03 03:48:11] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 2 ms to minimize.
[2024-06-03 03:48:11] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 2 ms to minimize.
[2024-06-03 03:48:11] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 2 ms to minimize.
[2024-06-03 03:48:12] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 4 ms to minimize.
[2024-06-03 03:48:12] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 3 ms to minimize.
[2024-06-03 03:48:12] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-06-03 03:48:12] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-03 03:48:13] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-03 03:48:15] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-06-03 03:48:15] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 2 ms to minimize.
[2024-06-03 03:48:16] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 2 ms to minimize.
[2024-06-03 03:48:16] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-06-03 03:48:16] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-03 03:48:19] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-03 03:48:21] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-06-03 03:48:21] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 1 ms to minimize.
[2024-06-03 03:48:21] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
[2024-06-03 03:48:22] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (OVERLAPS) 269/394 variables, 125/164 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 12 (OVERLAPS) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 164 constraints, problems are : Problem set: 0 solved, 268 unsolved in 26826 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 269/394 variables, 125/164 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 268/432 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-03 03:48:36] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (OVERLAPS) 0/394 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 433 constraints, problems are : Problem set: 0 solved, 268 unsolved in 22909 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 29/29 constraints]
After SMT, in 49903ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 49908ms
Starting structural reductions in LTL mode, iteration 1 : 125/174 places, 269/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50398 ms. Remains : 125/174 places, 269/382 transitions.
[2024-06-03 03:48:54] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:48:54] [INFO ] Flatten gal took : 11 ms
[2024-06-03 03:48:55] [INFO ] Input system was already deterministic with 269 transitions.
[2024-06-03 03:48:55] [INFO ] Flatten gal took : 18 ms
[2024-06-03 03:48:55] [INFO ] Flatten gal took : 11 ms
[2024-06-03 03:48:55] [INFO ] Time to serialize gal into /tmp/CTLFireability18050906116226965603.gal : 3 ms
[2024-06-03 03:48:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4701024549743533020.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/CTLFireability18050906116226965603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4701024549743533020.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.13057e+09,26.4927,513224,2,19846,5,1.57243e+06,6,0,771,2.40596e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 03:49:25] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:49:25] [INFO ] Applying decomposition
[2024-06-03 03:49:25] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5382496089609021373.txt' '-o' '/tmp/graph5382496089609021373.bin' '-w' '/tmp/graph5382496089609021373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5382496089609021373.bin' '-l' '-1' '-v' '-w' '/tmp/graph5382496089609021373.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:49:25] [INFO ] Decomposing Gal with order
[2024-06-03 03:49:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:49:25] [INFO ] Removed a total of 348 redundant transitions.
[2024-06-03 03:49:25] [INFO ] Flatten gal took : 17 ms
[2024-06-03 03:49:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 12 ms.
[2024-06-03 03:49:25] [INFO ] Time to serialize gal into /tmp/CTLFireability11310777862933209937.gal : 2 ms
[2024-06-03 03:49:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13494165123080193238.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/CTLFireability11310777862933209937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13494165123080193238.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.13057e+09,0.757214,22700,613,190,33989,4427,510,57832,152,10588,0


Converting to forward existential form...Done !
original formula: AG(((AX((i6.u20.p191==0)) + AG(((i3.u10.p61==0)||(i5.u14.p162==0)))) + ((!(A((i6.u20.p191==1) U ((i0.u6.p24==1)&&(i5.u14.p128==1)))) * (i...321
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((!(!((E(!(((i0.u6.p24==1)&&(i5.u14.p128==1))) U (!((i6.u20.p191==1)) * !(((i0.u6.p...491
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t44, t101, t103, t176, t177, t178, t179, t180, t181, t205, t206, t207, t209, t210, t...688
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Graph (trivial) has 136 edges and 174 vertex of which 23 / 174 are part of one of the 3 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 4 rules applied. Total rules applied 5 place count 153 transition count 345
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 149 transition count 343
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 149 transition count 339
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 145 transition count 339
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 49 place count 115 transition count 281
Iterating global reduction 2 with 30 rules applied. Total rules applied 79 place count 115 transition count 281
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2 with 8 rules applied. Total rules applied 87 place count 115 transition count 273
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 89 place count 114 transition count 272
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 89 place count 114 transition count 268
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 97 place count 110 transition count 268
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 100 place count 107 transition count 260
Iterating global reduction 4 with 3 rules applied. Total rules applied 103 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 106 transition count 257
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 106 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 106 transition count 256
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 132 place count 93 transition count 243
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 138 place count 87 transition count 225
Iterating global reduction 5 with 6 rules applied. Total rules applied 144 place count 87 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 147 place count 87 transition count 222
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 148 place count 86 transition count 220
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 86 transition count 220
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 150 place count 85 transition count 217
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 85 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 152 place count 85 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 156 place count 85 transition count 212
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 162 place count 82 transition count 209
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 165 place count 79 transition count 200
Iterating global reduction 7 with 3 rules applied. Total rules applied 168 place count 79 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 171 place count 79 transition count 197
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 172 place count 79 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 174 place count 77 transition count 195
Applied a total of 174 rules in 86 ms. Remains 77 /174 variables (removed 97) and now considering 195/382 (removed 187) transitions.
[2024-06-03 03:49:55] [INFO ] Flow matrix only has 186 transitions (discarded 9 similar events)
// Phase 1: matrix 186 rows 77 cols
[2024-06-03 03:49:55] [INFO ] Computed 11 invariants in 1 ms
[2024-06-03 03:49:55] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-03 03:49:55] [INFO ] Flow matrix only has 186 transitions (discarded 9 similar events)
[2024-06-03 03:49:55] [INFO ] Invariant cache hit.
[2024-06-03 03:49:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-03 03:49:55] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-06-03 03:49:55] [INFO ] Redundant transitions in 13 ms returned []
Running 169 sub problems to find dead transitions.
[2024-06-03 03:49:55] [INFO ] Flow matrix only has 186 transitions (discarded 9 similar events)
[2024-06-03 03:49:55] [INFO ] Invariant cache hit.
[2024-06-03 03:49:55] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 1/77 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-03 03:49:59] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-06-03 03:49:59] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 185/262 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-03 03:50:04] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/262 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 13 (OVERLAPS) 0/262 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/263 variables, and 93 constraints, problems are : Problem set: 0 solved, 169 unsolved in 12258 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 1/77 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 185/262 variables, 77/91 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 169/262 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (OVERLAPS) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/263 variables, and 262 constraints, problems are : Problem set: 0 solved, 169 unsolved in 7919 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 3/3 constraints]
After SMT, in 20298ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 20301ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/174 places, 195/382 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20785 ms. Remains : 77/174 places, 195/382 transitions.
[2024-06-03 03:50:16] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:50:16] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:50:16] [INFO ] Input system was already deterministic with 195 transitions.
[2024-06-03 03:50:16] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:50:16] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:50:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9714119534426249621.gal : 3 ms
[2024-06-03 03:50:16] [INFO ] Time to serialize properties into /tmp/CTLFireability15946628944186704230.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/CTLFireability9714119534426249621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15946628944186704230.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.69913e+07,4.06812,91564,2,8787,5,284790,6,0,502,338889,0


Converting to forward existential form...Done !
original formula: (EF((EG((p82==0)) + !(E((((p10==1)&&(p17==1))&&(p114==1)) U ((p140==1)&&(p249==1)))))) * EF(((p157==1)&&(p271==1))))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (EG((p82==0)) + !(E((((p10==1)&&(p17==1))&&(p114==1)) U ((p140==1)&&(p249==1))))))),TRUE...192
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t11, t14, t18, t19, t29, t32, t33, t39, t74, t75, t76, t77, t78, t79, t86, t87, t...460
Detected timeout of ITS tools.
[2024-06-03 03:50:46] [INFO ] Flatten gal took : 5 ms
[2024-06-03 03:50:46] [INFO ] Applying decomposition
[2024-06-03 03:50:46] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15499264155550653086.txt' '-o' '/tmp/graph15499264155550653086.bin' '-w' '/tmp/graph15499264155550653086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15499264155550653086.bin' '-l' '-1' '-v' '-w' '/tmp/graph15499264155550653086.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:50:46] [INFO ] Decomposing Gal with order
[2024-06-03 03:50:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:50:46] [INFO ] Removed a total of 332 redundant transitions.
[2024-06-03 03:50:46] [INFO ] Flatten gal took : 18 ms
[2024-06-03 03:50:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 4 ms.
[2024-06-03 03:50:46] [INFO ] Time to serialize gal into /tmp/CTLFireability17611624027754508747.gal : 2 ms
[2024-06-03 03:50:46] [INFO ] Time to serialize properties into /tmp/CTLFireability187486474294063249.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/CTLFireability17611624027754508747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability187486474294063249.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.69913e+07,0.255136,8752,259,42,8634,291,346,19855,66,632,0


Converting to forward existential form...Done !
original formula: (EF((EG((i1.u5.p82==0)) + !(E((((u1.p10==1)&&(u2.p17==1))&&(i3.u9.p114==1)) U ((i3.u11.p140==1)&&(i7.u0.p249==1)))))) * EF(((i3.u10.p157=...179
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (EG((i1.u5.p82==0)) + !(E((((u1.p10==1)&&(u2.p17==1))&&(i3.u9.p114==1)) U ((i3.u11.p140=...237
Reverse transition relation is NOT exact ! Due to transitions t77, t78, t79, t86, t87, t88, t105, t106, t133, t135, t137, t142, t144, t145, t147, t148, t15...420
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,9.27293,244136,1,0,356731,5878,2526,995412,341,37547,673582
FORMULA MedleyA-PT-20-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 138 transition count 315
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 138 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 76 place count 138 transition count 311
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 93 place count 121 transition count 270
Iterating global reduction 1 with 17 rules applied. Total rules applied 110 place count 121 transition count 270
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 114 place count 121 transition count 266
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 118 place count 117 transition count 256
Iterating global reduction 2 with 4 rules applied. Total rules applied 122 place count 117 transition count 256
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 117 transition count 253
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 116 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 116 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 116 transition count 249
Applied a total of 128 rules in 6 ms. Remains 116 /174 variables (removed 58) and now considering 249/382 (removed 133) transitions.
// Phase 1: matrix 249 rows 116 cols
[2024-06-03 03:50:55] [INFO ] Computed 11 invariants in 1 ms
[2024-06-03 03:50:55] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-03 03:50:55] [INFO ] Invariant cache hit.
[2024-06-03 03:50:55] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-06-03 03:50:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:50:58] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-06-03 03:50:59] [INFO ] Deduced a trap composed of 67 places in 165 ms of which 2 ms to minimize.
[2024-06-03 03:50:59] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 2 ms to minimize.
[2024-06-03 03:50:59] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 2 ms to minimize.
[2024-06-03 03:50:59] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 2 ms to minimize.
[2024-06-03 03:50:59] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 2 ms to minimize.
[2024-06-03 03:50:59] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 3 ms to minimize.
[2024-06-03 03:50:59] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2024-06-03 03:51:00] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 2 ms to minimize.
[2024-06-03 03:51:00] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-06-03 03:51:00] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:51:03] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 3 ms to minimize.
[2024-06-03 03:51:03] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 3 ms to minimize.
[2024-06-03 03:51:03] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 2 ms to minimize.
[2024-06-03 03:51:03] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:51:04] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2024-06-03 03:51:05] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
[2024-06-03 03:51:05] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 2 ms to minimize.
[2024-06-03 03:51:05] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 3 ms to minimize.
[2024-06-03 03:51:05] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 2 ms to minimize.
[2024-06-03 03:51:05] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:51:07] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 3 ms to minimize.
[2024-06-03 03:51:07] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 249/365 variables, 116/150 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:51:11] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:51:19] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/365 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 248 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 365/365 variables, and 152 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 249/365 variables, 116/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 248/400 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:51:31] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-06-03 03:51:31] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 2 ms to minimize.
[2024-06-03 03:51:32] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-06-03 03:51:32] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2024-06-03 03:51:32] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-06-03 03:51:32] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 6/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 406 constraints, problems are : Problem set: 0 solved, 248 unsolved in 19723 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 31/31 constraints]
After SMT, in 49880ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 49885ms
Starting structural reductions in LTL mode, iteration 1 : 116/174 places, 249/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50212 ms. Remains : 116/174 places, 249/382 transitions.
[2024-06-03 03:51:45] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:51:45] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:51:45] [INFO ] Input system was already deterministic with 249 transitions.
[2024-06-03 03:51:45] [INFO ] Flatten gal took : 5 ms
[2024-06-03 03:51:45] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:51:45] [INFO ] Time to serialize gal into /tmp/CTLFireability3496540566270556841.gal : 1 ms
[2024-06-03 03:51:45] [INFO ] Time to serialize properties into /tmp/CTLFireability529685846324125691.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/CTLFireability3496540566270556841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability529685846324125691.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.17259e+08,20.837,391464,2,17357,5,1.19708e+06,6,0,715,1.74293e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 03:52:15] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:52:15] [INFO ] Applying decomposition
[2024-06-03 03:52:15] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16680901740271770380.txt' '-o' '/tmp/graph16680901740271770380.bin' '-w' '/tmp/graph16680901740271770380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16680901740271770380.bin' '-l' '-1' '-v' '-w' '/tmp/graph16680901740271770380.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:52:15] [INFO ] Decomposing Gal with order
[2024-06-03 03:52:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:52:15] [INFO ] Removed a total of 333 redundant transitions.
[2024-06-03 03:52:15] [INFO ] Flatten gal took : 15 ms
[2024-06-03 03:52:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 2 ms.
[2024-06-03 03:52:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15633817787342330520.gal : 3 ms
[2024-06-03 03:52:15] [INFO ] Time to serialize properties into /tmp/CTLFireability11153133868505724701.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/CTLFireability15633817787342330520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11153133868505724701.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.17259e+08,0.477716,15980,446,124,23501,1597,430,37001,121,3834,0


Converting to forward existential form...Done !
original formula: EF(AX(((i1.u4.p20==1)&&(i6.u16.p223==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((i1.u4.p20==1)&&(i6.u16.p223==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t91, t93, t165, t166, t167, t169, t170, t171, t194, t195, t196, t198, t199, t20...591
(forward)formula 0,1,0.795509,17300,1,0,24156,2851,2059,48914,633,13144,66099
FORMULA MedleyA-PT-20-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Graph (trivial) has 144 edges and 174 vertex of which 23 / 174 are part of one of the 3 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 4 rules applied. Total rules applied 5 place count 153 transition count 345
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 149 transition count 343
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 11 place count 149 transition count 338
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 144 transition count 338
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 52 place count 113 transition count 277
Iterating global reduction 2 with 31 rules applied. Total rules applied 83 place count 113 transition count 277
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 2 with 10 rules applied. Total rules applied 93 place count 113 transition count 267
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 97 place count 111 transition count 265
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 97 place count 111 transition count 260
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 107 place count 106 transition count 260
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 103 transition count 252
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 103 transition count 252
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 114 place count 102 transition count 249
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 102 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 102 transition count 248
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 142 place count 89 transition count 235
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 148 place count 83 transition count 217
Iterating global reduction 5 with 6 rules applied. Total rules applied 154 place count 83 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 157 place count 83 transition count 214
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 82 transition count 212
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 82 transition count 212
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 81 transition count 209
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 81 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 162 place count 81 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 165 place count 81 transition count 205
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 171 place count 78 transition count 202
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 174 place count 75 transition count 193
Iterating global reduction 7 with 3 rules applied. Total rules applied 177 place count 75 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 180 place count 75 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 182 place count 73 transition count 188
Applied a total of 182 rules in 50 ms. Remains 73 /174 variables (removed 101) and now considering 188/382 (removed 194) transitions.
[2024-06-03 03:52:16] [INFO ] Flow matrix only has 178 transitions (discarded 10 similar events)
// Phase 1: matrix 178 rows 73 cols
[2024-06-03 03:52:16] [INFO ] Computed 11 invariants in 1 ms
[2024-06-03 03:52:16] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-03 03:52:16] [INFO ] Flow matrix only has 178 transitions (discarded 10 similar events)
[2024-06-03 03:52:16] [INFO ] Invariant cache hit.
[2024-06-03 03:52:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 03:52:17] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-06-03 03:52:17] [INFO ] Redundant transitions in 2 ms returned []
Running 162 sub problems to find dead transitions.
[2024-06-03 03:52:17] [INFO ] Flow matrix only has 178 transitions (discarded 10 similar events)
[2024-06-03 03:52:17] [INFO ] Invariant cache hit.
[2024-06-03 03:52:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 2/72 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 1/73 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-03 03:52:20] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-03 03:52:21] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (OVERLAPS) 177/250 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-03 03:52:25] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/250 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 14 (OVERLAPS) 0/250 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/251 variables, and 88 constraints, problems are : Problem set: 0 solved, 162 unsolved in 11838 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 2/72 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 1/73 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 177/250 variables, 73/87 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 162/250 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (OVERLAPS) 0/250 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/251 variables, and 250 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8402 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 3/3 constraints]
After SMT, in 20305ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 20307ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/174 places, 188/382 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20688 ms. Remains : 73/174 places, 188/382 transitions.
[2024-06-03 03:52:37] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:52:37] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:52:37] [INFO ] Input system was already deterministic with 188 transitions.
[2024-06-03 03:52:37] [INFO ] Flatten gal took : 7 ms
[2024-06-03 03:52:37] [INFO ] Flatten gal took : 7 ms
[2024-06-03 03:52:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1154854178838786670.gal : 2 ms
[2024-06-03 03:52:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7687047682937358226.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1154854178838786670.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7687047682937358226.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 30065 steps (20 resets) in 113 ms. (263 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-20-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality7687047682937358226.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 145 transition count 329
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 145 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 145 transition count 325
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 76 place count 131 transition count 291
Iterating global reduction 1 with 14 rules applied. Total rules applied 90 place count 131 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 93 place count 131 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 97 place count 127 transition count 278
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 127 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 127 transition count 276
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 126 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 126 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 126 transition count 272
Applied a total of 106 rules in 9 ms. Remains 126 /174 variables (removed 48) and now considering 272/382 (removed 110) transitions.
// Phase 1: matrix 272 rows 126 cols
[2024-06-03 03:52:37] [INFO ] Computed 11 invariants in 2 ms
[2024-06-03 03:52:37] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-03 03:52:37] [INFO ] Invariant cache hit.
[2024-06-03 03:52:37] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-06-03 03:52:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-03 03:52:41] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-06-03 03:52:41] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 1 ms to minimize.
[2024-06-03 03:52:41] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
[2024-06-03 03:52:41] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 3 ms to minimize.
[2024-06-03 03:52:41] [INFO ] Deduced a trap composed of 75 places in 166 ms of which 3 ms to minimize.
[2024-06-03 03:52:42] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 2 ms to minimize.
[2024-06-03 03:52:42] [INFO ] Deduced a trap composed of 79 places in 165 ms of which 3 ms to minimize.
[2024-06-03 03:52:42] [INFO ] Deduced a trap composed of 84 places in 174 ms of which 2 ms to minimize.
[2024-06-03 03:52:42] [INFO ] Deduced a trap composed of 73 places in 208 ms of which 2 ms to minimize.
[2024-06-03 03:52:42] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 2 ms to minimize.
[2024-06-03 03:52:42] [INFO ] Deduced a trap composed of 71 places in 148 ms of which 2 ms to minimize.
[2024-06-03 03:52:43] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 2 ms to minimize.
[2024-06-03 03:52:43] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2024-06-03 03:52:43] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
[2024-06-03 03:52:43] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 2 ms to minimize.
[2024-06-03 03:52:43] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-06-03 03:52:44] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 2 ms to minimize.
[2024-06-03 03:52:44] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-03 03:52:47] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-06-03 03:52:47] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-03 03:52:49] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-06-03 03:52:49] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-03 03:52:50] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 3 ms to minimize.
[2024-06-03 03:52:51] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 2 ms to minimize.
[2024-06-03 03:52:51] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 272/398 variables, 126/162 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-03 03:53:00] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-06-03 03:53:00] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/398 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/398 variables, and 164 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-03 03:53:10] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-03 03:53:12] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-06-03 03:53:12] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 272/398 variables, 126/167 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 271/438 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-03 03:53:18] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 2 ms to minimize.
[2024-06-03 03:53:18] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 1 ms to minimize.
[2024-06-03 03:53:18] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-06-03 03:53:18] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
[2024-06-03 03:53:19] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
[2024-06-03 03:53:19] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2024-06-03 03:53:19] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 7/445 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-03 03:53:33] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/398 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/398 variables, and 446 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 38/38 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LTL mode, iteration 1 : 126/174 places, 272/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60641 ms. Remains : 126/174 places, 272/382 transitions.
[2024-06-03 03:53:38] [INFO ] Flatten gal took : 12 ms
[2024-06-03 03:53:38] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:53:38] [INFO ] Input system was already deterministic with 272 transitions.
[2024-06-03 03:53:38] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:53:38] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:53:38] [INFO ] Time to serialize gal into /tmp/CTLFireability9281549119584776800.gal : 5 ms
[2024-06-03 03:53:38] [INFO ] Time to serialize properties into /tmp/CTLFireability7054510830800321638.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/CTLFireability9281549119584776800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7054510830800321638.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.
Detected timeout of ITS tools.
[2024-06-03 03:54:08] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:54:08] [INFO ] Applying decomposition
[2024-06-03 03:54:08] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9673130636378692081.txt' '-o' '/tmp/graph9673130636378692081.bin' '-w' '/tmp/graph9673130636378692081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9673130636378692081.bin' '-l' '-1' '-v' '-w' '/tmp/graph9673130636378692081.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:54:08] [INFO ] Decomposing Gal with order
[2024-06-03 03:54:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:54:08] [INFO ] Removed a total of 393 redundant transitions.
[2024-06-03 03:54:08] [INFO ] Flatten gal took : 20 ms
[2024-06-03 03:54:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 2 ms.
[2024-06-03 03:54:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16853403068109516600.gal : 2 ms
[2024-06-03 03:54:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6343405547404580843.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/CTLFireability16853403068109516600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6343405547404580843.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27223e+09,1.49749,37008,976,89,58616,1714,530,107724,103,4472,0


Converting to forward existential form...Done !
original formula: A(EX(!(A(!(EF(((i2.u12.p93==1)&&(i8.u27.p259==1)))) U (i3.u13.p108==1)))) U (E(((A(((i2.u12.p58==1)||(u5.p23==1)) U (((i1.u1.p10==1)&&(u3...410
=> equivalent forward existential formula: [((Init * !(EG(!((E(((!((E(!((((i1.u1.p10==1)&&(u3.p17==1))&&(i6.u17.p171==1))) U (!(((i2.u12.p58==1)||(u5.p23==...1601
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t45, t100, t104, t176, t177, t178, t186, t187, t188, t205, t206, t207, t208, t209, t...672
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 142 transition count 321
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 142 transition count 321
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 68 place count 142 transition count 317
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 83 place count 127 transition count 281
Iterating global reduction 1 with 15 rules applied. Total rules applied 98 place count 127 transition count 281
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 102 place count 127 transition count 277
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 123 transition count 267
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 123 transition count 267
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 113 place count 123 transition count 264
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 122 transition count 261
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 122 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 122 transition count 260
Applied a total of 116 rules in 6 ms. Remains 122 /174 variables (removed 52) and now considering 260/382 (removed 122) transitions.
// Phase 1: matrix 260 rows 122 cols
[2024-06-03 03:54:38] [INFO ] Computed 11 invariants in 2 ms
[2024-06-03 03:54:38] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-03 03:54:38] [INFO ] Invariant cache hit.
[2024-06-03 03:54:38] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-06-03 03:54:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-03 03:54:41] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-06-03 03:54:41] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-03 03:54:41] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
[2024-06-03 03:54:41] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 3 ms to minimize.
[2024-06-03 03:54:42] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 2 ms to minimize.
[2024-06-03 03:54:42] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 2 ms to minimize.
[2024-06-03 03:54:42] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-06-03 03:54:42] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 2 ms to minimize.
[2024-06-03 03:54:42] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 2 ms to minimize.
[2024-06-03 03:54:42] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 3 ms to minimize.
[2024-06-03 03:54:42] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 3 ms to minimize.
[2024-06-03 03:54:43] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2024-06-03 03:54:43] [INFO ] Deduced a trap composed of 68 places in 142 ms of which 2 ms to minimize.
[2024-06-03 03:54:43] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 2 ms to minimize.
[2024-06-03 03:54:43] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 2 ms to minimize.
[2024-06-03 03:54:43] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 2 ms to minimize.
[2024-06-03 03:54:43] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 2 ms to minimize.
[2024-06-03 03:54:44] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-03 03:54:44] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/382 variables, 122/152 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-03 03:54:48] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 3 ms to minimize.
[2024-06-03 03:54:48] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 2 ms to minimize.
[2024-06-03 03:54:48] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 2 ms to minimize.
[2024-06-03 03:54:49] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-06-03 03:54:49] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-06-03 03:54:49] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2024-06-03 03:54:49] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-03 03:54:54] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-06-03 03:54:54] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-03 03:54:59] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-06-03 03:55:00] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/382 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 163 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/382 variables, 122/163 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 259/422 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-03 03:55:14] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-06-03 03:55:15] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 3 ms to minimize.
[2024-06-03 03:55:15] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 2 ms to minimize.
[2024-06-03 03:55:15] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 2 ms to minimize.
[2024-06-03 03:55:15] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2024-06-03 03:55:15] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 6/428 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 0/382 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 428 constraints, problems are : Problem set: 0 solved, 259 unsolved in 29750 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 36/36 constraints]
After SMT, in 59851ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 59854ms
Starting structural reductions in LTL mode, iteration 1 : 122/174 places, 260/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60177 ms. Remains : 122/174 places, 260/382 transitions.
[2024-06-03 03:55:38] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:55:38] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:55:38] [INFO ] Input system was already deterministic with 260 transitions.
[2024-06-03 03:55:38] [INFO ] Flatten gal took : 7 ms
[2024-06-03 03:55:38] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:55:38] [INFO ] Time to serialize gal into /tmp/CTLFireability15527169210413597356.gal : 2 ms
[2024-06-03 03:55:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4858386335377522735.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/CTLFireability15527169210413597356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4858386335377522735.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,9.90611e+08,25.0847,471784,2,21723,5,1.5033e+06,6,0,750,2.17753e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 03:56:08] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:56:08] [INFO ] Applying decomposition
[2024-06-03 03:56:08] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13126605393246408767.txt' '-o' '/tmp/graph13126605393246408767.bin' '-w' '/tmp/graph13126605393246408767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13126605393246408767.bin' '-l' '-1' '-v' '-w' '/tmp/graph13126605393246408767.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:56:08] [INFO ] Decomposing Gal with order
[2024-06-03 03:56:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:56:08] [INFO ] Removed a total of 373 redundant transitions.
[2024-06-03 03:56:08] [INFO ] Flatten gal took : 19 ms
[2024-06-03 03:56:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-06-03 03:56:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5023150274070921170.gal : 3 ms
[2024-06-03 03:56:08] [INFO ] Time to serialize properties into /tmp/CTLFireability5703035085681101529.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/CTLFireability5023150274070921170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5703035085681101529.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.90611e+08,1.16495,25884,863,96,40407,1414,514,69568,98,3529,0


Converting to forward existential form...Done !
original formula: EF((E(A((u4.p18!=1) U !(AG((i4.u13.p111==1)))) U (AX(EG((i3.u8.p37==1))) * AX(E((i3.u12.p58==1) U ((i6.u18.p195==1)&&(i9.u31.p271==1)))))...181
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * E(!((E(!(!(!(E(TRUE U !((i4.u13.p111==1)))))) U (!((u4.p18!=1)) * !(!(!(E(TRUE U !((i4....354
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t95, t97, t110, t145, t168, t173, t174, t175, t176, t177, t178, t180, t181, t18...729
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,17.9696,396088,1,0,610016,21611,3657,1.45798e+06,585,98493,1605680
FORMULA MedleyA-PT-20-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Graph (trivial) has 137 edges and 174 vertex of which 23 / 174 are part of one of the 3 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 153 transition count 346
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 150 transition count 344
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 149 transition count 343
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 11 place count 149 transition count 338
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 21 place count 144 transition count 338
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 50 place count 115 transition count 281
Iterating global reduction 3 with 29 rules applied. Total rules applied 79 place count 115 transition count 281
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 3 with 9 rules applied. Total rules applied 88 place count 115 transition count 272
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 92 place count 113 transition count 270
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 92 place count 113 transition count 267
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 98 place count 110 transition count 267
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 101 place count 107 transition count 259
Iterating global reduction 5 with 3 rules applied. Total rules applied 104 place count 107 transition count 259
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 105 place count 106 transition count 256
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 106 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 107 place count 106 transition count 255
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 133 place count 93 transition count 242
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 139 place count 87 transition count 224
Iterating global reduction 6 with 6 rules applied. Total rules applied 145 place count 87 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 148 place count 87 transition count 221
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 149 place count 86 transition count 219
Iterating global reduction 7 with 1 rules applied. Total rules applied 150 place count 86 transition count 219
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 151 place count 85 transition count 216
Iterating global reduction 7 with 1 rules applied. Total rules applied 152 place count 85 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 153 place count 85 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 156 place count 85 transition count 212
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 162 place count 82 transition count 209
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 165 place count 79 transition count 200
Iterating global reduction 8 with 3 rules applied. Total rules applied 168 place count 79 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 171 place count 79 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 173 place count 77 transition count 195
Applied a total of 173 rules in 42 ms. Remains 77 /174 variables (removed 97) and now considering 195/382 (removed 187) transitions.
[2024-06-03 03:56:26] [INFO ] Flow matrix only has 186 transitions (discarded 9 similar events)
// Phase 1: matrix 186 rows 77 cols
[2024-06-03 03:56:26] [INFO ] Computed 11 invariants in 1 ms
[2024-06-03 03:56:26] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-03 03:56:26] [INFO ] Flow matrix only has 186 transitions (discarded 9 similar events)
[2024-06-03 03:56:26] [INFO ] Invariant cache hit.
[2024-06-03 03:56:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-03 03:56:27] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-06-03 03:56:27] [INFO ] Redundant transitions in 2 ms returned []
Running 168 sub problems to find dead transitions.
[2024-06-03 03:56:27] [INFO ] Flow matrix only has 186 transitions (discarded 9 similar events)
[2024-06-03 03:56:27] [INFO ] Invariant cache hit.
[2024-06-03 03:56:27] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 1/77 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-03 03:56:30] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2024-06-03 03:56:30] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-03 03:56:32] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 185/262 variables, 77/91 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (OVERLAPS) 0/262 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/263 variables, and 93 constraints, problems are : Problem set: 0 solved, 168 unsolved in 10664 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 1/77 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 185/262 variables, 77/91 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 168/261 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (OVERLAPS) 0/262 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/263 variables, and 261 constraints, problems are : Problem set: 0 solved, 168 unsolved in 8562 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 3/3 constraints]
After SMT, in 19304ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 19306ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/174 places, 195/382 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19625 ms. Remains : 77/174 places, 195/382 transitions.
[2024-06-03 03:56:46] [INFO ] Flatten gal took : 5 ms
[2024-06-03 03:56:46] [INFO ] Flatten gal took : 5 ms
[2024-06-03 03:56:46] [INFO ] Input system was already deterministic with 195 transitions.
[2024-06-03 03:56:46] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:56:46] [INFO ] Flatten gal took : 5 ms
[2024-06-03 03:56:46] [INFO ] Time to serialize gal into /tmp/CTLFireability2236488597510726777.gal : 1 ms
[2024-06-03 03:56:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16378956913362478603.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/CTLFireability2236488597510726777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16378956913362478603.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.71308e+07,4.03508,86420,2,8402,5,288898,6,0,502,330548,0


Converting to forward existential form...Done !
original formula: (AF((((p10==0)||(p21==0))||(p39==0))) * EF(EG((p121==1))))
=> equivalent forward existential formula: ([FwdG(Init,!((((p10==0)||(p21==0))||(p39==0))))] = FALSE * [(Init * !(E(TRUE U EG((p121==1)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t11, t14, t17, t18, t25, t28, t31, t32, t39, t74, t75, t76, t77, t78, t79, t89, t...465
Detected timeout of ITS tools.
[2024-06-03 03:57:16] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:57:16] [INFO ] Applying decomposition
[2024-06-03 03:57:16] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph898171148121793188.txt' '-o' '/tmp/graph898171148121793188.bin' '-w' '/tmp/graph898171148121793188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph898171148121793188.bin' '-l' '-1' '-v' '-w' '/tmp/graph898171148121793188.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:57:16] [INFO ] Decomposing Gal with order
[2024-06-03 03:57:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:57:16] [INFO ] Removed a total of 322 redundant transitions.
[2024-06-03 03:57:16] [INFO ] Flatten gal took : 13 ms
[2024-06-03 03:57:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 2 ms.
[2024-06-03 03:57:16] [INFO ] Time to serialize gal into /tmp/CTLFireability8547618974677591351.gal : 2 ms
[2024-06-03 03:57:16] [INFO ] Time to serialize properties into /tmp/CTLFireability1140060110634460773.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/CTLFireability8547618974677591351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1140060110634460773.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.71308e+07,0.142828,7408,234,101,6898,637,367,12326,101,1749,0


Converting to forward existential form...Done !
original formula: (AF((((u0.p10==0)||(u2.p21==0))||(i2.u6.p39==0))) * EF(EG((i4.u9.p121==1))))
=> equivalent forward existential formula: ([FwdG(Init,!((((u0.p10==0)||(u2.p21==0))||(i2.u6.p39==0))))] = FALSE * [(Init * !(E(TRUE U EG((i4.u9.p121==1)))...167
Reverse transition relation is NOT exact ! Due to transitions t74, t75, t76, t92, t93, t94, t110, t111, t112, t136, t138, t141, t142, t144, t146, t148, t15...435
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,5.63333,141784,1,0,189225,11458,2115,614984,522,74523,484007
FORMULA MedleyA-PT-20-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-03 03:57:22] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:57:22] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:57:22] [INFO ] Applying decomposition
[2024-06-03 03:57:22] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5335832002082122291.txt' '-o' '/tmp/graph5335832002082122291.bin' '-w' '/tmp/graph5335832002082122291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5335832002082122291.bin' '-l' '-1' '-v' '-w' '/tmp/graph5335832002082122291.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:57:22] [INFO ] Decomposing Gal with order
[2024-06-03 03:57:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:57:22] [INFO ] Removed a total of 589 redundant transitions.
[2024-06-03 03:57:22] [INFO ] Flatten gal took : 24 ms
[2024-06-03 03:57:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 3 ms.
[2024-06-03 03:57:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16104330344393225434.gal : 3 ms
[2024-06-03 03:57:22] [INFO ] Time to serialize properties into /tmp/CTLFireability7178827166156476243.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/CTLFireability16104330344393225434.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7178827166156476243.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 3 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.05546e+10,10.1768,206540,2865,276,318549,5706,781,691600,152,22108,0


Converting to forward existential form...Done !
original formula: (EF((i2.i0.u16.p86==1)) * (E(((u6.p24==1)&&(i6.u35.p201==1)) U ((((((EX((((i0.u2.p10==1)&&(u5.p21==1))&&(i2.i0.u10.p39==1))) * (i3.u23.p1...499
=> equivalent forward existential formula: (([(FwdU(FwdU((FwdU((Init * E(TRUE U (i2.i0.u16.p86==1))),((u6.p24==1)&&(i6.u35.p201==1))) * (((((EX((((i0.u2.p1...972
Reverse transition relation is NOT exact ! Due to transitions t8, t19, t58, t142, t146, t157, t162, t163, t164, t171, t174, t175, t193, t196, t197, t203, t...1274
(forward)formula 0,1,240.098,2220456,1,0,2.98318e+06,65593,3159,7.94565e+06,507,371036,7119367
FORMULA MedleyA-PT-20-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((AX((i6.u35.p191==0)) + AG(((i2.i0.u12.p61==0)||(i3.u23.p162==0)))) + ((!(A((i6.u35.p191==1) U ((u6.p24==1)&&(i3.u23.p128==1)))) * (i...321
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((!(!((E(!(((u6.p24==1)&&(i3.u23.p128==1))) U (!((i6.u35.p191==1)) * !(((u6.p24==1)...485
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-06-03 04:06:14] [INFO ] Applying decomposition
[2024-06-03 04:06:14] [INFO ] Flatten gal took : 10 ms
[2024-06-03 04:06:14] [INFO ] Decomposing Gal with order
[2024-06-03 04:06:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 04:06:14] [INFO ] Removed a total of 416 redundant transitions.
[2024-06-03 04:06:14] [INFO ] Flatten gal took : 27 ms
[2024-06-03 04:06:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 258 labels/synchronizations in 5 ms.
[2024-06-03 04:06:14] [INFO ] Time to serialize gal into /tmp/CTLFireability14631259279753155088.gal : 6 ms
[2024-06-03 04:06:14] [INFO ] Time to serialize properties into /tmp/CTLFireability17058355303499632042.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/CTLFireability14631259279753155088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17058355303499632042.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 2 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.05546e+10,90.9257,2105932,3093,3722,3.17333e+06,124152,326,1.42049e+07,406,3.93612e+06,0


Converting to forward existential form...Done !
original formula: AG(((AX((i0.i1.u13.p191==0)) + AG(((i0.i1.i0.u11.p61==0)||(i0.i1.i0.u12.p162==0)))) + ((!(A((i0.i1.u13.p191==1) U ((i0.i0.i1.u8.p24==1)&&...390
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((!(!((E(!(((i0.i0.i1.u8.p24==1)&&(i0.i1.i0.u12.p128==1))) U (!((i0.i1.u13.p191==1)...584
Reverse transition relation is NOT exact ! Due to transitions t160, t176, t229, t237, i0.t334, i0.t321, i0.t263, i0.t261, i0.i0.t142, i0.i0.u3.t150, i0.i0....1013
ITS-tools command line returned an error code 137
[2024-06-03 04:20:54] [INFO ] Flatten gal took : 19 ms
[2024-06-03 04:20:54] [INFO ] Input system was already deterministic with 382 transitions.
[2024-06-03 04:20:54] [INFO ] Transformed 174 places.
[2024-06-03 04:20:54] [INFO ] Transformed 382 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-06-03 04:20:54] [INFO ] Time to serialize gal into /tmp/CTLFireability10202643792124196992.gal : 4 ms
[2024-06-03 04:20:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10603066031234281725.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/CTLFireability10202643792124196992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10603066031234281725.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 2 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.05546e+10,853.076,11613860,2,232510,5,3.09835e+07,6,0,1080,4.65048e+07,0


Converting to forward existential form...Done !

BK_TIME_CONFINEMENT_REACHED

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

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