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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 48K 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-02-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717351531535

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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:05:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:05:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:05:34] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-06-02 18:05:34] [INFO ] Transformed 69 places.
[2024-06-02 18:05:34] [INFO ] Transformed 168 transitions.
[2024-06-02 18:05:34] [INFO ] Found NUPN structural information;
[2024-06-02 18:05:34] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 128 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
Support contains 58 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 67 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 67 transition count 160
Applied a total of 4 rules in 43 ms. Remains 67 /69 variables (removed 2) and now considering 160/162 (removed 2) transitions.
// Phase 1: matrix 160 rows 67 cols
[2024-06-02 18:05:34] [INFO ] Computed 9 invariants in 25 ms
[2024-06-02 18:05:35] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-06-02 18:05:35] [INFO ] Invariant cache hit.
[2024-06-02 18:05:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 18:05:35] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-06-02 18:05:35] [INFO ] Invariant cache hit.
[2024-06-02 18:05:35] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-02 18:05:37] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 15 ms to minimize.
[2024-06-02 18:05:37] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-06-02 18:05:37] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-06-02 18:05:37] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:05:37] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2024-06-02 18:05:37] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-06-02 18:05:37] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:05:38] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:05:38] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:05:38] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:05:38] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:05:38] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:05:38] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:05:38] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:05:39] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:05:39] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-02 18:05:39] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:05:40] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-02 18:05:40] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-02 18:05:40] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 160/227 variables, 67/96 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 0/227 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 156 constraints, problems are : Problem set: 0 solved, 159 unsolved in 9391 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 160/227 variables, 67/96 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 159/315 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-02 18:05:49] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:05:49] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:05:49] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:05:49] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:05:49] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 3 ms to minimize.
[2024-06-02 18:05:49] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:05:49] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:05:50] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:05:51] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 9/324 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-02 18:05:52] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 0/227 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 325 constraints, problems are : Problem set: 0 solved, 159 unsolved in 15237 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 30/30 constraints]
After SMT, in 25055ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 25086ms
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 160/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25982 ms. Remains : 67/69 places, 160/162 transitions.
Support contains 58 out of 67 places after structural reductions.
[2024-06-02 18:06:00] [INFO ] Flatten gal took : 71 ms
[2024-06-02 18:06:00] [INFO ] Flatten gal took : 28 ms
[2024-06-02 18:06:00] [INFO ] Input system was already deterministic with 160 transitions.
Reduction of identical properties reduced properties to check from 77 to 74
RANDOM walk for 40000 steps (4006 resets) in 2837 ms. (14 steps per ms) remains 34/74 properties
BEST_FIRST walk for 4003 steps (90 resets) in 85 ms. (46 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (94 resets) in 71 ms. (55 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (92 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (93 resets) in 47 ms. (83 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (76 resets) in 75 ms. (52 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (93 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (91 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (94 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (91 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (118 resets) in 37 ms. (105 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (88 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (94 resets) in 42 ms. (93 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (91 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (92 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (74 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (91 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (85 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (87 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (75 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (89 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (91 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (87 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (92 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (91 resets) in 44 ms. (88 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (98 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (101 resets) in 47 ms. (83 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (95 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (74 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (122 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (90 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (88 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (68 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (86 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
[2024-06-02 18:06:02] [INFO ] Invariant cache hit.
[2024-06-02 18:06:02] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/64 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 30 unsolved
[2024-06-02 18:06:02] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:06:03] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 30 unsolved
[2024-06-02 18:06:03] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/66 variables, 1/12 constraints. Problems are: Problem set: 3 solved, 30 unsolved
[2024-06-02 18:06:03] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/13 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 159/225 variables, 66/79 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 60/139 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 2/227 variables, 1/140 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/140 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 0/227 variables, 0/140 constraints. Problems are: Problem set: 3 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 140 constraints, problems are : Problem set: 3 solved, 30 unsolved in 1958 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 30 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/64 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/11 constraints. Problems are: Problem set: 4 solved, 29 unsolved
[2024-06-02 18:06:04] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 9 ms to minimize.
[2024-06-02 18:06:04] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:06:04] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:06:04] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 4/15 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 2/66 variables, 1/16 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/17 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 159/225 variables, 66/83 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 60/143 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 10/153 constraints. Problems are: Problem set: 4 solved, 29 unsolved
[2024-06-02 18:06:05] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:06:05] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 3 ms to minimize.
[2024-06-02 18:06:05] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:06:05] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 4/157 constraints. Problems are: Problem set: 4 solved, 29 unsolved
[2024-06-02 18:06:06] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:06:06] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:06:06] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:06:06] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:06:06] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 5/162 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 0/162 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 14 (OVERLAPS) 2/227 variables, 1/163 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/227 variables, 19/182 constraints. Problems are: Problem set: 4 solved, 29 unsolved
[2024-06-02 18:06:07] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 1/183 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/227 variables, 0/183 constraints. Problems are: Problem set: 4 solved, 29 unsolved
[2024-06-02 18:06:08] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:06:08] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:06:08] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/227 variables, 3/186 constraints. Problems are: Problem set: 4 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/227 variables, and 186 constraints, problems are : Problem set: 4 solved, 29 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 29/33 constraints, Known Traps: 21/21 constraints]
After SMT, in 7070ms problems are : Problem set: 4 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 160/160 transitions.
Graph (complete) has 285 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 56 transition count 145
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 56 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 25 place count 56 transition count 141
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 56 transition count 141
Applied a total of 28 rules in 62 ms. Remains 56 /67 variables (removed 11) and now considering 141/160 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 56/67 places, 141/160 transitions.
RANDOM walk for 40000 steps (3751 resets) in 909 ms. (43 steps per ms) remains 21/29 properties
BEST_FIRST walk for 4003 steps (77 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (94 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (88 resets) in 43 ms. (90 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (91 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (87 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (81 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (117 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (83 resets) in 42 ms. (93 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (91 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (88 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (92 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (81 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (96 resets) in 51 ms. (76 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (87 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (59 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (92 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (87 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (93 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (89 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
// Phase 1: matrix 141 rows 56 cols
[2024-06-02 18:06:10] [INFO ] Computed 9 invariants in 11 ms
[2024-06-02 18:06:10] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 28/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:06:10] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:06:10] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:06:10] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:06:10] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 141/197 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 60/129 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 129 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1226 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 28/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:06:11] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:06:11] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 141/197 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 60/131 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 19/150 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/197 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 150 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2488 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 6/6 constraints]
After SMT, in 3761ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 15 properties in 3236 ms.
Support contains 12 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 141/141 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 56 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 52 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 52 transition count 134
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 50 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 50 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 49 transition count 119
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 46 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 45 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 45 transition count 121
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 45 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 44 transition count 150
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 44 transition count 150
Applied a total of 27 rules in 59 ms. Remains 44 /56 variables (removed 12) and now considering 150/141 (removed -9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 44/56 places, 150/141 transitions.
RANDOM walk for 40000 steps (3903 resets) in 626 ms. (63 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (969 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (825 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1309 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
[2024-06-02 18:06:17] [INFO ] Flow matrix only has 142 transitions (discarded 8 similar events)
// Phase 1: matrix 142 rows 44 cols
[2024-06-02 18:06:17] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:06:17] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/42 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:06:17] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 142/186 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 78/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 132 constraints, problems are : Problem set: 0 solved, 3 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/42 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 142/186 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 78/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 135 constraints, problems are : Problem set: 0 solved, 3 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 714ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 194 ms.
Support contains 9 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 150/150 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 149
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 43 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 41 transition count 150
Applied a total of 6 rules in 36 ms. Remains 41 /44 variables (removed 3) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 41/44 places, 150/150 transitions.
RANDOM walk for 40000 steps (3876 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1034 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (426 resets) in 75 ms. (526 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (1076 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
[2024-06-02 18:06:18] [INFO ] Flow matrix only has 142 transitions (discarded 8 similar events)
// Phase 1: matrix 142 rows 41 cols
[2024-06-02 18:06:18] [INFO ] Computed 9 invariants in 4 ms
[2024-06-02 18:06:18] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 142/183 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 78/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 128 constraints, problems are : Problem set: 0 solved, 2 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 142/183 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 78/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 130 constraints, problems are : Problem set: 0 solved, 2 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 528ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 8 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 150/150 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 41 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 40 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 40 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 39 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 39 transition count 141
Applied a total of 5 rules in 23 ms. Remains 39 /41 variables (removed 2) and now considering 141/150 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 39/41 places, 141/150 transitions.
RANDOM walk for 40000 steps (3954 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (406 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1115 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 85490 steps, run visited all 2 properties in 292 ms. (steps per millisecond=292 )
Probabilistic random walk after 85490 steps, saw 20774 distinct states, run finished after 300 ms. (steps per millisecond=284 ) properties seen :2
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-06-02 18:06:19] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:06:19] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:06:19] [INFO ] Input system was already deterministic with 160 transitions.
Computed a total of 18 stabilizing places and 67 stable transitions
Graph (complete) has 350 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 52 transition count 137
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 52 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 51 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 51 transition count 132
Applied a total of 32 rules in 6 ms. Remains 51 /67 variables (removed 16) and now considering 132/160 (removed 28) transitions.
// Phase 1: matrix 132 rows 51 cols
[2024-06-02 18:06:19] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:06:19] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:06:19] [INFO ] Invariant cache hit.
[2024-06-02 18:06:19] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 18:06:19] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 18:06:19] [INFO ] Invariant cache hit.
[2024-06-02 18:06:19] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 18:06:20] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:06:21] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:06:21] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:06:21] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:06:21] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:06:21] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 4 ms to minimize.
[2024-06-02 18:06:21] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:06:21] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:06:21] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:06:21] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:06:21] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 18:06:22] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/183 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 58/130 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 130 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6610 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 18:06:27] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:06:27] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/183 variables, 51/74 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 58/132 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 131/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 263 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6328 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 14/14 constraints]
After SMT, in 13070ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 13074ms
Starting structural reductions in LTL mode, iteration 1 : 51/67 places, 132/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13275 ms. Remains : 51/67 places, 132/160 transitions.
[2024-06-02 18:06:32] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:06:33] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:06:33] [INFO ] Input system was already deterministic with 132 transitions.
[2024-06-02 18:06:33] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:06:33] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:06:33] [INFO ] Time to serialize gal into /tmp/CTLFireability14020981588185109549.gal : 6 ms
[2024-06-02 18:06:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9857864238910702924.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/CTLFireability14020981588185109549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9857864238910702924.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,302920,0.34998,12476,2,1936,5,30572,6,0,333,46297,0


Converting to forward existential form...Done !
original formula: E((!(((p7==1)&&(p26==1))) + E((EX(AX((p18==1))) * AG((((p5==1)&&(p57==1))&&((p65==1)&&(p49==1))))) U !((!((((p7==1)&&(p8==1))&&(p23==1)))...368
=> equivalent forward existential formula: [FwdG(FwdU(Init,(!(((p7==1)&&(p26==1))) + E((EX(!(EX(!((p18==1))))) * !(E(TRUE U !((((p5==1)&&(p57==1))&&((p65==...442
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t16, t17, t18, t20, t21, t22, t23, t...523
(forward)formula 0,0,2.80589,69436,1,0,463,285811,315,213,3169,424568,508
FORMULA MedleyA-PT-02-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 53 transition count 139
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 53 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 50 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 50 transition count 123
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 48 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 48 transition count 115
Applied a total of 38 rules in 6 ms. Remains 48 /67 variables (removed 19) and now considering 115/160 (removed 45) transitions.
// Phase 1: matrix 115 rows 48 cols
[2024-06-02 18:06:35] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:06:35] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:06:35] [INFO ] Invariant cache hit.
[2024-06-02 18:06:36] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-06-02 18:06:36] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-06-02 18:06:36] [INFO ] Invariant cache hit.
[2024-06-02 18:06:36] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-02 18:06:36] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:06:37] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:06:37] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/163 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 112 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3827 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/163 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 114/226 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 226 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4461 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 3/3 constraints]
After SMT, in 8366ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 8368ms
Starting structural reductions in LTL mode, iteration 1 : 48/67 places, 115/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8573 ms. Remains : 48/67 places, 115/160 transitions.
[2024-06-02 18:06:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:06:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:06:44] [INFO ] Input system was already deterministic with 115 transitions.
[2024-06-02 18:06:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:06:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:06:44] [INFO ] Time to serialize gal into /tmp/CTLFireability14352138791912161018.gal : 5 ms
[2024-06-02 18:06:44] [INFO ] Time to serialize properties into /tmp/CTLFireability17341897003990025387.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/CTLFireability14352138791912161018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17341897003990025387.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,269716,0.459181,12120,2,1327,5,29473,6,0,304,43478,0


Converting to forward existential form...Done !
original formula: AX(EX(AG(AF((p22==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U !(!(EG(!((p22==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t23, t...397
(forward)formula 0,0,8.28907,219700,1,0,576,1.23099e+06,258,226,2879,1.3207e+06,677
FORMULA MedleyA-PT-02-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Graph (complete) has 350 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 53 transition count 140
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 53 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 52 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 52 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 51 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 51 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 35 place count 49 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 49 transition count 124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 40 place count 49 transition count 122
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 47 transition count 122
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 45 transition count 120
Applied a total of 48 rules in 29 ms. Remains 45 /67 variables (removed 22) and now considering 120/160 (removed 40) transitions.
// Phase 1: matrix 120 rows 45 cols
[2024-06-02 18:06:52] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:06:53] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 18:06:53] [INFO ] Invariant cache hit.
[2024-06-02 18:06:53] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 18:06:53] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-06-02 18:06:53] [INFO ] Redundant transitions in 3 ms returned []
Running 119 sub problems to find dead transitions.
[2024-06-02 18:06:53] [INFO ] Invariant cache hit.
[2024-06-02 18:06:53] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-02 18:06:53] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:06:53] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:06:54] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:06:54] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:06:54] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:06:54] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:06:54] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:06:54] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:06:54] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-02 18:06:54] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:06:55] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:06:55] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/165 variables, 45/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 56/122 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/165 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 122 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5811 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/165 variables, 45/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 56/122 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 119/241 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/165 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 241 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5461 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 12/12 constraints]
After SMT, in 11345ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 11348ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/67 places, 120/160 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11596 ms. Remains : 45/67 places, 120/160 transitions.
[2024-06-02 18:07:04] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:07:04] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:07:04] [INFO ] Input system was already deterministic with 120 transitions.
[2024-06-02 18:07:04] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:07:04] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:07:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16902965049134838998.gal : 3 ms
[2024-06-02 18:07:04] [INFO ] Time to serialize properties into /tmp/CTLFireability18370847848864018599.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/CTLFireability16902965049134838998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18370847848864018599.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,93513,0.421649,11132,2,1449,5,23091,6,0,298,39648,0


Converting to forward existential form...Done !
original formula: A((p16==1) U AF(((!(A((p22==1) U (p46==1))) * EG((((p7==1)&&(p13==1))&&(p20==1)))) * (p51==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((!(!((E(!((p46==1)) U (!((p22==1)) * !((p46==1)))) + EG(!((p46==1)))))) * EG((((p7==1)&...508
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...469
(forward)formula 0,0,4.47235,110160,1,0,428,535970,277,160,2801,544070,483
FORMULA MedleyA-PT-02-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 54 transition count 140
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 54 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 51 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 51 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 50 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 50 transition count 120
Applied a total of 34 rules in 3 ms. Remains 50 /67 variables (removed 17) and now considering 120/160 (removed 40) transitions.
// Phase 1: matrix 120 rows 50 cols
[2024-06-02 18:07:09] [INFO ] Computed 9 invariants in 4 ms
[2024-06-02 18:07:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:07:09] [INFO ] Invariant cache hit.
[2024-06-02 18:07:09] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-02 18:07:09] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-06-02 18:07:09] [INFO ] Invariant cache hit.
[2024-06-02 18:07:09] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-02 18:07:10] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:07:10] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 3 ms to minimize.
[2024-06-02 18:07:10] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:07:10] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:07:10] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/170 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 117 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3819 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/170 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 119/236 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 236 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5063 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 5/5 constraints]
After SMT, in 8953ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 8954ms
Starting structural reductions in LTL mode, iteration 1 : 50/67 places, 120/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9141 ms. Remains : 50/67 places, 120/160 transitions.
[2024-06-02 18:07:18] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:07:18] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:07:18] [INFO ] Input system was already deterministic with 120 transitions.
[2024-06-02 18:07:18] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:07:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:07:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15486249112318820755.gal : 3 ms
[2024-06-02 18:07:18] [INFO ] Time to serialize properties into /tmp/CTLFireability4248439337554181817.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/CTLFireability15486249112318820755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4248439337554181817.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,350821,0.60402,17696,2,2862,5,45708,6,0,317,74040,0


Converting to forward existential form...Done !
original formula: AF(((AX(!(E((((p7==1)&&(p13==1))&&(p23==1)) U (p22==1)))) + EG(((p7==1)&&(p21==1)))) * (EX((p38==1)) + AG(AF((((p31==0)||(p43==0))||(p56=...164
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!(!(E((((p7==1)&&(p13==1))&&(p23==1)) U (p22==1)))))) + EG(((p7==1)&&(p21==1)))) * (EX((p38=...233
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t23, t...437
(forward)formula 0,1,2.6426,67416,1,0,506,326996,281,190,2918,352731,587
FORMULA MedleyA-PT-02-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 57 transition count 146
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 57 transition count 146
Applied a total of 20 rules in 2 ms. Remains 57 /67 variables (removed 10) and now considering 146/160 (removed 14) transitions.
// Phase 1: matrix 146 rows 57 cols
[2024-06-02 18:07:21] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:07:21] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 18:07:21] [INFO ] Invariant cache hit.
[2024-06-02 18:07:21] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 18:07:21] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-06-02 18:07:21] [INFO ] Invariant cache hit.
[2024-06-02 18:07:21] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 18:07:22] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:07:22] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:07:22] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:07:22] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:07:22] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:07:22] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:07:22] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:07:23] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:07:23] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 18:07:23] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/203 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 60/136 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/203 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 136 constraints, problems are : Problem set: 0 solved, 145 unsolved in 7833 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 146/203 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 60/136 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 145/281 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 18:07:32] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 18:07:34] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 283 constraints, problems are : Problem set: 0 solved, 145 unsolved in 9068 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 12/12 constraints]
After SMT, in 16983ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 16985ms
Starting structural reductions in LTL mode, iteration 1 : 57/67 places, 146/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17135 ms. Remains : 57/67 places, 146/160 transitions.
[2024-06-02 18:07:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:07:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:07:38] [INFO ] Input system was already deterministic with 146 transitions.
[2024-06-02 18:07:38] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:07:38] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:07:38] [INFO ] Time to serialize gal into /tmp/CTLFireability5976211556244057877.gal : 3 ms
[2024-06-02 18:07:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1747231247332462594.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/CTLFireability5976211556244057877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1747231247332462594.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,462352,0.65224,21620,2,3410,5,60782,6,0,371,78927,0


Converting to forward existential form...Done !
original formula: EG((((EF((((p29==1)&&(p43==1))&&(p56==1))) + (((p7==1)&&(p11==1))&&(p33==1))) + ((AF((p21==0)) * (((p35==0)||(p36==0))||(p46==0))) + ((EG...452
=> equivalent forward existential formula: [FwdG(Init,(((E(TRUE U (((p29==1)&&(p43==1))&&(p56==1))) + (((p7==1)&&(p11==1))&&(p33==1))) + ((!(EG(!((p21==0))...640
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...487
Detected timeout of ITS tools.
[2024-06-02 18:08:08] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:08:08] [INFO ] Applying decomposition
[2024-06-02 18:08:08] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18358146824596404464.txt' '-o' '/tmp/graph18358146824596404464.bin' '-w' '/tmp/graph18358146824596404464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18358146824596404464.bin' '-l' '-1' '-v' '-w' '/tmp/graph18358146824596404464.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:08:08] [INFO ] Decomposing Gal with order
[2024-06-02 18:08:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:08:08] [INFO ] Removed a total of 207 redundant transitions.
[2024-06-02 18:08:08] [INFO ] Flatten gal took : 143 ms
[2024-06-02 18:08:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 12 ms.
[2024-06-02 18:08:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17741133200621787598.gal : 3 ms
[2024-06-02 18:08:08] [INFO ] Time to serialize properties into /tmp/CTLFireability5450789090747857958.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/CTLFireability17741133200621787598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5450789090747857958.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,462352,0.211368,9200,346,347,8196,1611,214,20128,153,15286,0


Converting to forward existential form...Done !
original formula: EG((((EF((((i2.u3.p29==1)&&(i2.u4.p43==1))&&(u5.p56==1))) + (((u2.p7==1)&&(i0.u0.p11==1))&&(i0.u0.p33==1))) + ((AF((u2.p21==0)) * (((i2.u...600
=> equivalent forward existential formula: [FwdG(Init,(((E(TRUE U (((i2.u3.p29==1)&&(i2.u4.p43==1))&&(u5.p56==1))) + (((u2.p7==1)&&(i0.u0.p11==1))&&(i0.u0....824
Reverse transition relation is NOT exact ! Due to transitions t82, t141, t143, u2.t28, u2.t29, u2.t30, u2.t31, u2.t32, u2.t33, u2.t34, u2.t35, u2.t36, u2.t...619
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
(forward)formula 0,1,6.12733,167864,1,0,251933,46817,1523,439942,919,253292,417876
FORMULA MedleyA-PT-02-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Graph (complete) has 350 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 51 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 51 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 35 place count 47 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 39 place count 47 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 41 place count 45 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 43 place count 45 transition count 106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 42 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 42 transition count 98
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 54 place count 42 transition count 97
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 41 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 39 transition count 95
Applied a total of 60 rules in 20 ms. Remains 39 /67 variables (removed 28) and now considering 95/160 (removed 65) transitions.
// Phase 1: matrix 95 rows 39 cols
[2024-06-02 18:08:14] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:08:14] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 18:08:14] [INFO ] Invariant cache hit.
[2024-06-02 18:08:14] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-02 18:08:15] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 18:08:15] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2024-06-02 18:08:15] [INFO ] Invariant cache hit.
[2024-06-02 18:08:15] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/134 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 48/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 96 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1745 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/134 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 48/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 94/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:08:18] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 191 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3229 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 1/1 constraints]
After SMT, in 5025ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 5026ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/67 places, 95/160 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5300 ms. Remains : 39/67 places, 95/160 transitions.
[2024-06-02 18:08:20] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:08:20] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:08:20] [INFO ] Input system was already deterministic with 95 transitions.
[2024-06-02 18:08:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:08:20] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:08:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16794857272293449834.gal : 2 ms
[2024-06-02 18:08:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6793377573173739665.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/CTLFireability16794857272293449834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6793377573173739665.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,66129,0.136317,7264,2,727,5,13929,6,0,249,18488,0


Converting to forward existential form...Done !
original formula: E((p12==1) U A((EF(((((p7==1)&&(p11==1))&&((p35==1)&&(p55==1)))||(((p33==1)&&(p57==1))&&(p63==1)))) + (((p7==1)&&(p27==1))&&((p35==1)&&(p...212
=> equivalent forward existential formula: [((FwdU(Init,(p12==1)) * !(EG(!((((p7==1)&&(p27==1))&&((p57==1)&&(p61==1))))))) * !(E(!((((p7==1)&&(p27==1))&&((...382
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21, t6...336
Hit Full ! (commute/partial/dont) 87/0/8
(forward)formula 0,0,4.44007,114864,1,0,418,577728,227,174,2443,600496,494
FORMULA MedleyA-PT-02-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 53 transition count 139
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 53 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 51 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 51 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 50 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 50 transition count 124
Applied a total of 34 rules in 4 ms. Remains 50 /67 variables (removed 17) and now considering 124/160 (removed 36) transitions.
// Phase 1: matrix 124 rows 50 cols
[2024-06-02 18:08:24] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:08:24] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 18:08:24] [INFO ] Invariant cache hit.
[2024-06-02 18:08:24] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-02 18:08:24] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-02 18:08:24] [INFO ] Invariant cache hit.
[2024-06-02 18:08:24] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:08:25] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:08:25] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:08:25] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:08:25] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:08:25] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:08:25] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:08:26] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:08:26] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:08:26] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:08:26] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/174 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 55/124 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/174 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 124 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3622 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/174 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 55/124 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 123/247 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:08:32] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/174 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/174 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 248 constraints, problems are : Problem set: 0 solved, 123 unsolved in 11904 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 11/11 constraints]
After SMT, in 15593ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 15596ms
Starting structural reductions in LTL mode, iteration 1 : 50/67 places, 124/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15760 ms. Remains : 50/67 places, 124/160 transitions.
[2024-06-02 18:08:40] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:08:40] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:08:40] [INFO ] Input system was already deterministic with 124 transitions.
[2024-06-02 18:08:40] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:08:40] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:08:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1709460317984998994.gal : 4 ms
[2024-06-02 18:08:40] [INFO ] Time to serialize properties into /tmp/CTLFireability18278615662901487015.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/CTLFireability1709460317984998994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18278615662901487015.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,301924,0.505197,12480,2,1559,5,30352,6,0,321,45748,0


Converting to forward existential form...Done !
original formula: !(A((p49==1) U AX(!((EX((p22==1)) + EF((((p35==1)&&(p41==1))&&(p48==1))))))))
=> equivalent forward existential formula: (([(EY(EY((FwdU(Init,!(!(EX(!(!((EX((p22==1)) + E(TRUE U (((p35==1)&&(p41==1))&&(p48==1)))))))))) * !((p49==1)))...449
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t16, t17, t19, t20, t21, t22, t23, t...441
(forward)formula 0,1,5.17719,138296,1,0,404,575423,276,183,3018,968091,442
FORMULA MedleyA-PT-02-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 53 transition count 138
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 53 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 50 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 50 transition count 121
Applied a total of 34 rules in 2 ms. Remains 50 /67 variables (removed 17) and now considering 121/160 (removed 39) transitions.
// Phase 1: matrix 121 rows 50 cols
[2024-06-02 18:08:45] [INFO ] Computed 9 invariants in 5 ms
[2024-06-02 18:08:45] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 18:08:45] [INFO ] Invariant cache hit.
[2024-06-02 18:08:45] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-02 18:08:45] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-02 18:08:45] [INFO ] Invariant cache hit.
[2024-06-02 18:08:45] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-02 18:08:46] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-06-02 18:08:46] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:08:47] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:08:47] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:08:47] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:08:47] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:08:47] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-02 18:08:48] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-02 18:08:48] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/171 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 54/122 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/171 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 122 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5902 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/171 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 54/122 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 120/242 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-02 18:08:54] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/171 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 243 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7306 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 10/10 constraints]
After SMT, in 13342ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 13345ms
Starting structural reductions in LTL mode, iteration 1 : 50/67 places, 121/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13504 ms. Remains : 50/67 places, 121/160 transitions.
[2024-06-02 18:08:59] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:08:59] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:08:59] [INFO ] Input system was already deterministic with 121 transitions.
[2024-06-02 18:08:59] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:08:59] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:08:59] [INFO ] Time to serialize gal into /tmp/CTLFireability13581151942482204297.gal : 2 ms
[2024-06-02 18:08:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16188413129149293397.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/CTLFireability13581151942482204297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16188413129149293397.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,301387,0.288547,11404,2,1428,5,28054,6,0,318,40811,0


Converting to forward existential form...Done !
original formula: (A(A((p8==1) U (EF(!((((p35==1)&&(p36==1))&&(p53==1)))) * !(((p21==1)||(p38==1))))) U !(EG(!((((p7==1)&&(p27==1))&&((p35==1)&&(p42==1))))...231
=> equivalent forward existential formula: [(((Init * !((E(!(!(EG(!((((p7==1)&&(p27==1))&&((p35==1)&&(p42==1))))))) U (!(!((E(!((E(TRUE U !((((p35==1)&&(p3...682
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t16, t17, t19, t20, t21, t22, t23, t...457
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,18.1421,475900,1,0,1051,2.69468e+06,293,577,3026,2.85236e+06,1234
FORMULA MedleyA-PT-02-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 56 transition count 143
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 56 transition count 143
Applied a total of 22 rules in 2 ms. Remains 56 /67 variables (removed 11) and now considering 143/160 (removed 17) transitions.
// Phase 1: matrix 143 rows 56 cols
[2024-06-02 18:09:17] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:09:17] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 18:09:17] [INFO ] Invariant cache hit.
[2024-06-02 18:09:17] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 18:09:17] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-06-02 18:09:17] [INFO ] Invariant cache hit.
[2024-06-02 18:09:17] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:09:19] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:09:19] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:09:19] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 18:09:20] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 18:09:20] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:09:20] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:09:20] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:09:20] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 143/199 variables, 56/77 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 60/137 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 137 constraints, problems are : Problem set: 0 solved, 142 unsolved in 7534 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 18:09:26] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:09:26] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 143/199 variables, 56/79 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 60/139 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 142/281 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 18:09:29] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:09:29] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:09:29] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:09:30] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:09:31] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 5/286 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 0/199 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 286 constraints, problems are : Problem set: 0 solved, 142 unsolved in 12889 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 19/19 constraints]
After SMT, in 20497ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 20499ms
Starting structural reductions in LTL mode, iteration 1 : 56/67 places, 143/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20621 ms. Remains : 56/67 places, 143/160 transitions.
[2024-06-02 18:09:38] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:09:38] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:09:38] [INFO ] Input system was already deterministic with 143 transitions.
[2024-06-02 18:09:38] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:09:38] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:09:38] [INFO ] Time to serialize gal into /tmp/CTLFireability10638625247922660318.gal : 2 ms
[2024-06-02 18:09:38] [INFO ] Time to serialize properties into /tmp/CTLFireability16821280885910185855.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/CTLFireability10638625247922660318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16821280885910185855.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,474187,0.565684,17692,2,3092,5,44276,6,0,364,69387,0


Converting to forward existential form...Done !
original formula: ((A((EF((((AX((((p35==1)&&(p41==1))&&(p46==1))) * (p33==1)) * ((p57==1)&&(p67==1))) * (((p7==1)&&(p13==1))&&(p23==1)))) + E((((p12!=1)||(...945
=> equivalent forward existential formula: (([((Init * !(EG(!((((p35==1)&&(p55==1))&&((p57==1)&&(p67==1))))))) * !(E(!((((p35==1)&&(p55==1))&&((p57==1)&&(p...1890
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t20, t21, t23, t...514
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:08] [INFO ] Applying decomposition
[2024-06-02 18:10:08] [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/graph6840139191016027331.txt' '-o' '/tmp/graph6840139191016027331.bin' '-w' '/tmp/graph6840139191016027331.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6840139191016027331.bin' '-l' '-1' '-v' '-w' '/tmp/graph6840139191016027331.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:10:08] [INFO ] Decomposing Gal with order
[2024-06-02 18:10:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:10:08] [INFO ] Removed a total of 215 redundant transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:10:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 5 ms.
[2024-06-02 18:10:08] [INFO ] Time to serialize gal into /tmp/CTLFireability11014471295651900055.gal : 2 ms
[2024-06-02 18:10:08] [INFO ] Time to serialize properties into /tmp/CTLFireability9016510830194388208.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/CTLFireability11014471295651900055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9016510830194388208.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,474187,0.290427,9436,341,444,7220,2619,191,17128,141,27220,0


Converting to forward existential form...Done !
original formula: ((A((EF((((AX((((i3.u2.p35==1)&&(u3.p41==1))&&(i3.u4.p46==1))) * (i4.u8.p33==1)) * ((i4.u6.p57==1)&&(i4.u10.p67==1))) * (((u1.p7==1)&&(u0...1238
=> equivalent forward existential formula: (([((Init * !(EG(!((((i3.u2.p35==1)&&(i3.u4.p55==1))&&((i4.u6.p57==1)&&(i4.u10.p67==1))))))) * !(E(!((((i3.u2.p3...2437
Reverse transition relation is NOT exact ! Due to transitions t45, t111, t119, t140, u0.t23, u0.t38, u0.t39, u0.t40, u0.t41, u0.t42, u0.t141, u1.t24, u1.t2...511
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
(forward)formula 0,0,7.24419,188312,1,0,250230,74007,1363,584107,817,439759,340968
FORMULA MedleyA-PT-02-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Graph (complete) has 350 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 53 transition count 138
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 53 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 30 place count 50 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 33 place count 50 transition count 121
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 48 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 48 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 42 place count 48 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 47 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 46 transition count 112
Applied a total of 46 rules in 14 ms. Remains 46 /67 variables (removed 21) and now considering 112/160 (removed 48) transitions.
// Phase 1: matrix 112 rows 46 cols
[2024-06-02 18:10:15] [INFO ] Computed 9 invariants in 0 ms
[2024-06-02 18:10:15] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 18:10:15] [INFO ] Invariant cache hit.
[2024-06-02 18:10:15] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-06-02 18:10:15] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-06-02 18:10:15] [INFO ] Redundant transitions in 5 ms returned []
Running 111 sub problems to find dead transitions.
[2024-06-02 18:10:15] [INFO ] Invariant cache hit.
[2024-06-02 18:10:15] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 18:10:16] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:10:16] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:10:16] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:10:16] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:10:16] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:10:16] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:10:17] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 18:10:17] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:10:17] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 18:10:17] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 112/158 variables, 46/65 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 52/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 117 constraints, problems are : Problem set: 0 solved, 111 unsolved in 5052 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 112/158 variables, 46/65 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 52/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 111/228 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 228 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4653 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 10/10 constraints]
After SMT, in 9811ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 9813ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/67 places, 112/160 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9984 ms. Remains : 46/67 places, 112/160 transitions.
[2024-06-02 18:10:25] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:25] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:25] [INFO ] Input system was already deterministic with 112 transitions.
[2024-06-02 18:10:25] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:10:25] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:10:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3649242294329079378.gal : 2 ms
[2024-06-02 18:10:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9902798066829283407.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/CTLFireability3649242294329079378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9902798066829283407.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,140199,0.455643,11352,2,1839,5,29619,6,0,294,34856,0


Converting to forward existential form...Done !
original formula: AG((((EF(!(E((p9==1) U ((p7==1)&&(p26==1))))) + !(A((((p30==1)&&(p43==1))&&(p56==1)) U (((p7==1)&&(p11==1))&&((p35==1)&&(p55==1)))))) + (...295
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * !((((p27==0)||(p57==0))||((p61==0)||((((p31==1)&&(p43==1))&&((p56==1)&&(p35==1)))&&(((p55...479
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t16, t17, t18, t19, t20, t21, t22, t...420
(forward)formula 0,1,1.94826,40848,1,0,325,203546,249,124,2669,188848,347
FORMULA MedleyA-PT-02-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 53 transition count 138
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 53 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 50 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 50 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 49 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 49 transition count 117
Applied a total of 36 rules in 3 ms. Remains 49 /67 variables (removed 18) and now considering 117/160 (removed 43) transitions.
// Phase 1: matrix 117 rows 49 cols
[2024-06-02 18:10:27] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:10:27] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-02 18:10:27] [INFO ] Invariant cache hit.
[2024-06-02 18:10:27] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-02 18:10:27] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-06-02 18:10:27] [INFO ] Invariant cache hit.
[2024-06-02 18:10:27] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-06-02 18:10:28] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:10:28] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:10:28] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:10:28] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:10:28] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:10:29] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:10:29] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/166 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 53/118 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/166 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 118 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4268 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/166 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 53/118 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 116/234 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-06-02 18:10:37] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:10:37] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:10:37] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/166 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/166 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 237 constraints, problems are : Problem set: 0 solved, 116 unsolved in 10079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 10/10 constraints]
After SMT, in 14404ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 14406ms
Starting structural reductions in LTL mode, iteration 1 : 49/67 places, 117/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14520 ms. Remains : 49/67 places, 117/160 transitions.
[2024-06-02 18:10:42] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:10:42] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:10:42] [INFO ] Input system was already deterministic with 117 transitions.
[2024-06-02 18:10:42] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:10:42] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:10:42] [INFO ] Time to serialize gal into /tmp/CTLFireability5795346513525128090.gal : 3 ms
[2024-06-02 18:10:42] [INFO ] Time to serialize properties into /tmp/CTLFireability1180710408687289130.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/CTLFireability5795346513525128090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1180710408687289130.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,284410,0.476258,12432,2,1556,5,31659,6,0,310,43703,0


Converting to forward existential form...Done !
original formula: E(AX((!(((A((((p7==1)&&(p27==1))&&((p57==1)&&(p61==1))) U (((p5==1)&&(p57==1))&&(p65==1))) * (p35==1)) * ((p36==1)&&(p53==1)))) * (EF(!((...252
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!((!(((!((E(!((((p5==1)&&(p57==1))&&(p65==1))) U (!((((p7==1)&&(p27==1))&&((p57==1)&&(p61==1)))...413
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21, t22, t...423
(forward)formula 0,0,1.59703,39900,1,0,247,193022,255,86,2866,177510,280
FORMULA MedleyA-PT-02-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Graph (complete) has 350 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 51 transition count 136
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 51 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 47 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 47 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 39 place count 45 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 45 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 45 place count 43 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 47 place count 42 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 42 transition count 97
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 53 place count 42 transition count 95
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 57 place count 40 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 61 place count 38 transition count 93
Applied a total of 61 rules in 20 ms. Remains 38 /67 variables (removed 29) and now considering 93/160 (removed 67) transitions.
// Phase 1: matrix 93 rows 38 cols
[2024-06-02 18:10:43] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:10:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 18:10:43] [INFO ] Invariant cache hit.
[2024-06-02 18:10:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 18:10:43] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-06-02 18:10:43] [INFO ] Redundant transitions in 3 ms returned []
Running 87 sub problems to find dead transitions.
[2024-06-02 18:10:43] [INFO ] Invariant cache hit.
[2024-06-02 18:10:43] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:10:45] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 93/131 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 62 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2398 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 93/131 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 87/149 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:10:47] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 150 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2777 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints]
After SMT, in 5251ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 5253ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/67 places, 93/160 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5439 ms. Remains : 38/67 places, 93/160 transitions.
[2024-06-02 18:10:49] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:49] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:10:49] [INFO ] Input system was already deterministic with 93 transitions.
[2024-06-02 18:10:49] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:10:49] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:10:49] [INFO ] Time to serialize gal into /tmp/CTLFireability4375732088937519089.gal : 2 ms
[2024-06-02 18:10:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15584631182425528826.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/CTLFireability4375732088937519089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15584631182425528826.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,65136,0.209137,6988,2,801,5,13665,6,0,241,18307,0


Converting to forward existential form...Done !
original formula: EG((((p1==0)||(p15==0))||(p28==0)))
=> equivalent forward existential formula: [FwdG(Init,(((p1==0)||(p15==0))||(p28==0)))] != FALSE
Hit Full ! (commute/partial/dont) 81/0/12
(forward)formula 0,1,0.563654,12004,1,0,8,35535,19,4,1646,38565,8
FORMULA MedleyA-PT-02-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 54 transition count 141
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 54 transition count 141
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 52 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 52 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 51 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 51 transition count 126
Applied a total of 32 rules in 7 ms. Remains 51 /67 variables (removed 16) and now considering 126/160 (removed 34) transitions.
// Phase 1: matrix 126 rows 51 cols
[2024-06-02 18:10:49] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 18:10:49] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:10:49] [INFO ] Invariant cache hit.
[2024-06-02 18:10:49] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-02 18:10:50] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-06-02 18:10:50] [INFO ] Invariant cache hit.
[2024-06-02 18:10:50] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-02 18:10:51] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:10:51] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:10:51] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:10:51] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:10:51] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:10:51] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-02 18:10:51] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-02 18:10:51] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-02 18:10:52] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:10:52] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 126/177 variables, 51/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 55/125 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 125 constraints, problems are : Problem set: 0 solved, 125 unsolved in 5569 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/177 variables, 51/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 55/125 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 125/250 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 250 constraints, problems are : Problem set: 0 solved, 125 unsolved in 6928 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 10/10 constraints]
After SMT, in 12615ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 12618ms
Starting structural reductions in LTL mode, iteration 1 : 51/67 places, 126/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12829 ms. Remains : 51/67 places, 126/160 transitions.
[2024-06-02 18:11:02] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:11:02] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:11:02] [INFO ] Input system was already deterministic with 126 transitions.
[2024-06-02 18:11:02] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:02] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:02] [INFO ] Time to serialize gal into /tmp/CTLFireability15467292603729571440.gal : 2 ms
[2024-06-02 18:11:02] [INFO ] Time to serialize properties into /tmp/CTLFireability15572667122839623602.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/CTLFireability15467292603729571440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15572667122839623602.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,285946,0.33754,11968,2,1581,5,30749,6,0,327,40140,0


Converting to forward existential form...Done !
original formula: AF(((p47==1) + (((AX((p16==1)) * (p35==1)) * ((p36==1)&&(p51==1))) * (p13==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((p47==1) + (((!(EX(!((p16==1)))) * (p35==1)) * ((p36==1)&&(p51==1))) * (p13==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...488
(forward)formula 0,0,3.10097,74636,1,0,406,302908,279,179,2996,454412,380
FORMULA MedleyA-PT-02-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 52 transition count 137
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 52 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 49 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 49 transition count 121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 47 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 47 transition count 113
Applied a total of 40 rules in 4 ms. Remains 47 /67 variables (removed 20) and now considering 113/160 (removed 47) transitions.
// Phase 1: matrix 113 rows 47 cols
[2024-06-02 18:11:05] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:11:05] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 18:11:05] [INFO ] Invariant cache hit.
[2024-06-02 18:11:05] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-06-02 18:11:06] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-06-02 18:11:06] [INFO ] Invariant cache hit.
[2024-06-02 18:11:06] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-02 18:11:06] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:11:07] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:11:07] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/160 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 52/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/160 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 111 constraints, problems are : Problem set: 0 solved, 112 unsolved in 3458 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/160 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 52/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 112/223 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-02 18:11:12] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:11:13] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/160 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-02 18:11:14] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/160 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 226 constraints, problems are : Problem set: 0 solved, 112 unsolved in 8398 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 6/6 constraints]
After SMT, in 11957ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 11959ms
Starting structural reductions in LTL mode, iteration 1 : 47/67 places, 113/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12145 ms. Remains : 47/67 places, 113/160 transitions.
[2024-06-02 18:11:17] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:11:17] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:11:17] [INFO ] Input system was already deterministic with 113 transitions.
[2024-06-02 18:11:18] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:11:18] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:11:18] [INFO ] Time to serialize gal into /tmp/CTLFireability3632498498311461160.gal : 2 ms
[2024-06-02 18:11:18] [INFO ] Time to serialize properties into /tmp/CTLFireability6506344569591610092.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/CTLFireability3632498498311461160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6506344569591610092.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,241300,0.400882,10296,2,1228,5,24388,6,0,298,34081,0


Converting to forward existential form...Done !
original formula: EF(EG((AF((((p35==1)&&(p55==1))&&((p57==1)&&(p67==1)))) + EX((((p35!=1)||(p41!=1))||(p46!=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EG(!((((p35==1)&&(p55==1))&&((p57==1)&&(p67==1)))))) + EX((((p35!=1)||(p41!=1))||(p46!=...171
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t22, t23, t...409
(forward)formula 0,1,7.72684,166460,1,0,429,920041,254,169,2813,951716,493
FORMULA MedleyA-PT-02-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 55 transition count 142
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 55 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 54 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 54 transition count 136
Applied a total of 26 rules in 9 ms. Remains 54 /67 variables (removed 13) and now considering 136/160 (removed 24) transitions.
// Phase 1: matrix 136 rows 54 cols
[2024-06-02 18:11:25] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:11:25] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:11:25] [INFO ] Invariant cache hit.
[2024-06-02 18:11:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 18:11:26] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2024-06-02 18:11:26] [INFO ] Invariant cache hit.
[2024-06-02 18:11:26] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-02 18:11:27] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:11:27] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:11:27] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:11:27] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:11:27] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:11:27] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:11:27] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-06-02 18:11:27] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:11:28] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-02 18:11:28] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:11:28] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:11:28] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:11:28] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:11:28] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:11:28] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-02 18:11:29] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:11:29] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 136/190 variables, 54/80 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 58/138 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/190 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 138 constraints, problems are : Problem set: 0 solved, 135 unsolved in 7155 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 136/190 variables, 54/80 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 58/138 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 135/273 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-02 18:11:36] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-02 18:11:40] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/190 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 275 constraints, problems are : Problem set: 0 solved, 135 unsolved in 12135 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 19/19 constraints]
After SMT, in 19416ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 19419ms
Starting structural reductions in LTL mode, iteration 1 : 54/67 places, 136/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19636 ms. Remains : 54/67 places, 136/160 transitions.
[2024-06-02 18:11:45] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:45] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:45] [INFO ] Input system was already deterministic with 136 transitions.
[2024-06-02 18:11:45] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:45] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:45] [INFO ] Time to serialize gal into /tmp/CTLFireability18274883787596029014.gal : 3 ms
[2024-06-02 18:11:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17472973260774499256.ctl : 11 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/CTLFireability18274883787596029014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17472973260774499256.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,384901,0.681829,15748,2,2321,5,36347,6,0,349,63166,0


Converting to forward existential form...Done !
original formula: A(AX((((p7==1)&&(p13==1))&&(p25==1))) U ((AF(!(EF((((p3==1)&&(p15==1))&&(p28==1))))) * !(AG((((p35==1)&&(p55==1))&&((p57==1)&&(p63==1))))...380
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EG(!(!(E(TRUE U (((p3==1)&&(p15==1))&&(p28==1))))))) * !(!(E(TRUE U !((((p35==1)&&(p55==1))...2122
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...534
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,22.2738,488828,1,0,1118,2.62126e+06,325,566,3289,2.6726e+06,1274
FORMULA MedleyA-PT-02-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 55 transition count 141
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 55 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 52 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 52 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 51 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 51 transition count 120
Applied a total of 32 rules in 3 ms. Remains 51 /67 variables (removed 16) and now considering 120/160 (removed 40) transitions.
// Phase 1: matrix 120 rows 51 cols
[2024-06-02 18:12:07] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:12:07] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:12:07] [INFO ] Invariant cache hit.
[2024-06-02 18:12:08] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-02 18:12:08] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-06-02 18:12:08] [INFO ] Invariant cache hit.
[2024-06-02 18:12:08] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-02 18:12:08] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:12:09] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:12:09] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:12:09] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/171 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/171 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 117 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4146 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/171 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 119/236 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-02 18:12:18] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/171 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-02 18:12:20] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/171 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 238 constraints, problems are : Problem set: 0 solved, 119 unsolved in 13894 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 6/6 constraints]
After SMT, in 18104ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 18105ms
Starting structural reductions in LTL mode, iteration 1 : 51/67 places, 120/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18253 ms. Remains : 51/67 places, 120/160 transitions.
[2024-06-02 18:12:26] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:12:26] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:12:26] [INFO ] Input system was already deterministic with 120 transitions.
[2024-06-02 18:12:26] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:12:26] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:12:26] [INFO ] Time to serialize gal into /tmp/CTLFireability7352776295296742605.gal : 5 ms
[2024-06-02 18:12:26] [INFO ] Time to serialize properties into /tmp/CTLFireability10630473767211256080.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/CTLFireability7352776295296742605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10630473767211256080.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,355453,0.698624,17208,2,2425,5,48384,6,0,321,62924,0


Converting to forward existential form...Done !
original formula: AX(EG(A(AX(E((((p32==1)&&(p43==1))&&(p56==1)) U (((p30==1)&&(p43==1))&&(p56==1)))) U EX(AF((p19==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((E(!(EX(!(EG(!((p19==1)))))) U (!(!(EX(!(E((((p32==1)&&(p43==1))&&(p56==1)) U (((p30==1)&&(p...254
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t...422
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
(forward)formula 0,0,17.8436,410984,1,0,744,2.36378e+06,277,415,3048,2.26194e+06,882
FORMULA MedleyA-PT-02-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-02 18:12:44] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:12:44] [INFO ] Flatten gal took : 5 ms
Total runtime 430477 ms.

BK_STOP 1717351964230

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

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