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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K 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.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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 26K 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-03-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717352142079

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:15:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:15:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:15:44] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-06-02 18:15:44] [INFO ] Transformed 108 places.
[2024-06-02 18:15:44] [INFO ] Transformed 100 transitions.
[2024-06-02 18:15:44] [INFO ] Found NUPN structural information;
[2024-06-02 18:15:44] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 116 ms.
Support contains 75 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 106 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 106 transition count 99
Applied a total of 3 rules in 57 ms. Remains 106 /108 variables (removed 2) and now considering 99/100 (removed 1) transitions.
// Phase 1: matrix 99 rows 106 cols
[2024-06-02 18:15:45] [INFO ] Computed 8 invariants in 29 ms
[2024-06-02 18:15:45] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-06-02 18:15:45] [INFO ] Invariant cache hit.
[2024-06-02 18:15:45] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-06-02 18:15:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:15:47] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 26 ms to minimize.
[2024-06-02 18:15:47] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:15:47] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:15:47] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:15:47] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:15:47] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 3 ms to minimize.
[2024-06-02 18:15:48] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 3 ms to minimize.
[2024-06-02 18:15:48] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 3 ms to minimize.
[2024-06-02 18:15:48] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:15:48] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:15:48] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 3 ms to minimize.
[2024-06-02 18:15:48] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:15:48] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:15:48] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:15:48] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:15:48] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
[2024-06-02 18:15:49] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:15:49] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:15:49] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:15:49] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:15:49] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:15:49] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:15:49] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:15:49] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:15:49] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
[2024-06-02 18:15:49] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:15:50] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:15:50] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:15:51] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:15:51] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:15:51] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
[2024-06-02 18:15:51] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:15:51] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:15:51] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:15:51] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:15:52] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:15:52] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:15:52] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:15:52] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:15:52] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 99/205 variables, 106/154 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:15:54] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:15:55] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/205 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:15:56] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:15:56] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:15:57] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/205 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 159 constraints, problems are : Problem set: 0 solved, 98 unsolved in 13076 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:16:00] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:16:00] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:16:00] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 99/205 variables, 106/162 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 98/260 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:16:02] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:16:06] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/205 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:16:11] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/205 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:16:14] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:16:14] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:16:14] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:16:14] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:16:15] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:16:15] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 16 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:16:20] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/205 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/205 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 270 constraints, problems are : Problem set: 0 solved, 98 unsolved in 29540 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 58/58 constraints]
After SMT, in 42778ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 42809ms
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 99/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43687 ms. Remains : 106/108 places, 99/100 transitions.
Support contains 75 out of 106 places after structural reductions.
[2024-06-02 18:16:28] [INFO ] Flatten gal took : 46 ms
[2024-06-02 18:16:28] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:16:29] [INFO ] Input system was already deterministic with 99 transitions.
Support contains 73 out of 106 places (down from 75) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 73 to 70
RANDOM walk for 40000 steps (655 resets) in 2849 ms. (14 steps per ms) remains 10/70 properties
BEST_FIRST walk for 40002 steps (198 resets) in 228 ms. (174 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (200 resets) in 145 ms. (274 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (178 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (193 resets) in 154 ms. (258 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (192 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (175 resets) in 301 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (180 resets) in 122 ms. (325 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (173 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (196 resets) in 220 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (179 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
[2024-06-02 18:16:30] [INFO ] Invariant cache hit.
Problem AtomicPropp51 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/92 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 99/191 variables, 92/100 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-06-02 18:16:30] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:16:31] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:16:31] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:16:31] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:16:31] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 5/105 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/105 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 14/205 variables, 14/119 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/119 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/119 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 119 constraints, problems are : Problem set: 3 solved, 6 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/33 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 59/92 variables, 6/8 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 5/13 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-02 18:16:31] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/14 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 99/191 variables, 92/106 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/106 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 14/205 variables, 14/120 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 5/125 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/125 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/125 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 125 constraints, problems are : Problem set: 4 solved, 5 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 6/6 constraints]
After SMT, in 919ms problems are : Problem set: 4 solved, 5 unsolved
Parikh walk visited 4 properties in 1707 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 99/99 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 106 transition count 78
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 85 transition count 78
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 42 place count 85 transition count 71
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 56 place count 78 transition count 71
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 72 transition count 65
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 72 transition count 65
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 110 place count 51 transition count 44
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 51 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 50 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 49 transition count 42
Applied a total of 113 rules in 41 ms. Remains 49 /106 variables (removed 57) and now considering 42/99 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 49/106 places, 42/99 transitions.
RANDOM walk for 40000 steps (1743 resets) in 280 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (585 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
Probably explored full state space saw : 213087 states, properties seen :0
Probabilistic random walk after 744896 steps, saw 213087 distinct states, run finished after 776 ms. (steps per millisecond=959 ) properties seen :0
Explored full state space saw : 213087 states, properties seen :0
Exhaustive walk after 744896 steps, saw 213087 distinct states, run finished after 563 ms. (steps per millisecond=1323 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-02 18:16:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:16:34] [INFO ] Flatten gal took : 41 ms
FORMULA MedleyA-PT-03-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:16:35] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:16:35] [INFO ] Input system was already deterministic with 99 transitions.
Computed a total of 106 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106 transition count 99
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA MedleyA-PT-03-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 93 transition count 86
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 92 transition count 85
Applied a total of 28 rules in 28 ms. Remains 92 /106 variables (removed 14) and now considering 85/99 (removed 14) transitions.
// Phase 1: matrix 85 rows 92 cols
[2024-06-02 18:16:35] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:16:35] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 18:16:35] [INFO ] Invariant cache hit.
[2024-06-02 18:16:35] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-02 18:16:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:16:36] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-06-02 18:16:36] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:16:37] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 103 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2981 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 84/187 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:16:39] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 188 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5631 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints]
After SMT, in 8654ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 8658ms
Starting structural reductions in LTL mode, iteration 1 : 92/106 places, 85/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8949 ms. Remains : 92/106 places, 85/99 transitions.
[2024-06-02 18:16:44] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:16:44] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:16:44] [INFO ] Input system was already deterministic with 85 transitions.
[2024-06-02 18:16:44] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:16:44] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:16:44] [INFO ] Time to serialize gal into /tmp/CTLFireability470855837657444087.gal : 5 ms
[2024-06-02 18:16:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10993421482559605679.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability470855837657444087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10993421482559605679.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10961e+08,0.359607,13604,2,1668,5,33021,6,0,455,63355,0


Converting to forward existential form...Done !
original formula: EF(EX((p5==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (p5==1))] != FALSE
(forward)formula 0,1,0.379995,13856,1,0,8,33021,8,1,763,63355,2
FORMULA MedleyA-PT-03-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 87
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 87
Applied a total of 24 rules in 19 ms. Remains 94 /106 variables (removed 12) and now considering 87/99 (removed 12) transitions.
// Phase 1: matrix 87 rows 94 cols
[2024-06-02 18:16:44] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:16:44] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 18:16:44] [INFO ] Invariant cache hit.
[2024-06-02 18:16:44] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-06-02 18:16:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:16:45] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:16:45] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:16:45] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:16:46] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:16:46] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:16:46] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:16:46] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:16:46] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:16:46] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:16:46] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:16:46] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:16:46] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/181 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:16:48] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 115 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4792 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/181 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 86/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:16:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:16:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:16:51] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:16:51] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:16:52] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:16:52] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 207 constraints, problems are : Problem set: 0 solved, 86 unsolved in 10902 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 19/19 constraints]
After SMT, in 15729ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 15732ms
Starting structural reductions in LTL mode, iteration 1 : 94/106 places, 87/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16044 ms. Remains : 94/106 places, 87/99 transitions.
[2024-06-02 18:17:00] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:00] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:00] [INFO ] Input system was already deterministic with 87 transitions.
[2024-06-02 18:17:00] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:00] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11214082642625736417.gal : 4 ms
[2024-06-02 18:17:00] [INFO ] Time to serialize properties into /tmp/CTLFireability2657001196768679083.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11214082642625736417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2657001196768679083.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10961e+08,0.551378,14220,2,1719,5,33957,6,0,465,66203,0


Converting to forward existential form...Done !
original formula: EX((AF((((p55==1)&&(p14==1))||(p65!=1))) * EX(AF(E((p77==1) U (p22==1))))))
=> equivalent forward existential formula: [(EY((EY(Init) * !(EG(!((((p55==1)&&(p14==1))||(p65!=1))))))) * !(EG(!(E((p77==1) U (p22==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t12, t14, t15, t19, t21, t26, t28, t33, t35, t40, t42, t46, t48, t52, t72, t83, Inte...248
Detected timeout of ITS tools.
[2024-06-02 18:17:30] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:30] [INFO ] Applying decomposition
[2024-06-02 18:17:30] [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/graph13766811954632271949.txt' '-o' '/tmp/graph13766811954632271949.bin' '-w' '/tmp/graph13766811954632271949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13766811954632271949.bin' '-l' '-1' '-v' '-w' '/tmp/graph13766811954632271949.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:17:30] [INFO ] Decomposing Gal with order
[2024-06-02 18:17:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:17:30] [INFO ] Flatten gal took : 54 ms
[2024-06-02 18:17:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-06-02 18:17:30] [INFO ] Time to serialize gal into /tmp/CTLFireability6847609820134207373.gal : 7 ms
[2024-06-02 18:17:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12683949937254522928.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/CTLFireability6847609820134207373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12683949937254522928.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10961e+08,0.23834,8200,299,197,6246,4588,218,7651,125,19484,0


Converting to forward existential form...Done !
original formula: EX((AF((((i5.u18.p55==1)&&(i4.u6.p14==1))||(i6.u21.p65!=1))) * EX(AF(E((i7.u22.p77==1) U (i2.u8.p22==1))))))
=> equivalent forward existential formula: [(EY((EY(Init) * !(EG(!((((i5.u18.p55==1)&&(i4.u6.p14==1))||(i6.u21.p65!=1))))))) * !(EG(!(E((i7.u22.p77==1) U (...183
Reverse transition relation is NOT exact ! Due to transitions u28.t72, i0.u2.t52, i1.u12.t40, i1.u13.t33, i2.u8.t46, i2.u8.t83, i2.u9.t48, i3.i0.u10.t42, i...369
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,5.00178,150760,1,0,321105,7459,1300,347096,818,64845,303440
FORMULA MedleyA-PT-03-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 87
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 93 transition count 86
Applied a total of 26 rules in 8 ms. Remains 93 /106 variables (removed 13) and now considering 86/99 (removed 13) transitions.
// Phase 1: matrix 86 rows 93 cols
[2024-06-02 18:17:35] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:17:36] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 18:17:36] [INFO ] Invariant cache hit.
[2024-06-02 18:17:36] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:17:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:17:36] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:17:36] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:17:37] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:17:37] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:17:37] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 106 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3090 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 85/191 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:17:40] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:17:42] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:17:42] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:17:45] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:17:46] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:17:47] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/179 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 197 constraints, problems are : Problem set: 0 solved, 85 unsolved in 15607 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 11/11 constraints]
After SMT, in 18717ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 18719ms
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 86/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18969 ms. Remains : 93/106 places, 86/99 transitions.
[2024-06-02 18:17:54] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:54] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:54] [INFO ] Input system was already deterministic with 86 transitions.
[2024-06-02 18:17:54] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:54] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9150517823904279926.gal : 2 ms
[2024-06-02 18:17:54] [INFO ] Time to serialize properties into /tmp/CTLFireability9033819812099910073.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/CTLFireability9150517823904279926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9033819812099910073.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10961e+08,0.337157,13708,2,1688,5,33231,6,0,460,63639,0


Converting to forward existential form...Done !
original formula: EF(AG(((p58==1) * ((AF((p68==0)) + EG((p78==1))) + EX((p51==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p58==1) * ((!(EG(!((p68==0)))) + EG((p78==1))) + EX((p51==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t13, t18, t20, t26, t28, t29, t33, t35, t40, t42, t48, t51, t52, t72, Intersect...243
(forward)formula 0,0,2.09112,60136,1,0,943,253830,205,92,2761,352031,939
FORMULA MedleyA-PT-03-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 76
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 83 transition count 76
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 44 place count 83 transition count 70
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 77 transition count 70
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 71 transition count 64
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 71 transition count 64
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 68 place count 71 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 70 transition count 63
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 98 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 55 transition count 48
Applied a total of 99 rules in 25 ms. Remains 55 /106 variables (removed 51) and now considering 48/99 (removed 51) transitions.
// Phase 1: matrix 48 rows 55 cols
[2024-06-02 18:17:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:17:57] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 18:17:57] [INFO ] Invariant cache hit.
[2024-06-02 18:17:57] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-06-02 18:17:57] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-02 18:17:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/102 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 63 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/102 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 109 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1735 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 3093ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3095ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/106 places, 48/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3294 ms. Remains : 55/106 places, 48/99 transitions.
[2024-06-02 18:18:00] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:00] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:00] [INFO ] Input system was already deterministic with 48 transitions.
[2024-06-02 18:18:00] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:18:00] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:18:00] [INFO ] Time to serialize gal into /tmp/CTLFireability7258479856691816476.gal : 2 ms
[2024-06-02 18:18:00] [INFO ] Time to serialize properties into /tmp/CTLFireability14344335582755371211.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/CTLFireability7258479856691816476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14344335582755371211.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(EG((p27==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p27==1))] != FALSE
dead was empty
(forward)formula 0,0,0.526879,15760,1,0,409,79567,12,2,1271,57628,406
FORMULA MedleyA-PT-03-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 105 transition count 77
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 84 transition count 77
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 42 place count 84 transition count 70
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 56 place count 77 transition count 70
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 64 place count 69 transition count 62
Iterating global reduction 2 with 8 rules applied. Total rules applied 72 place count 69 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 72 place count 69 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 68 transition count 61
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 98 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 55 transition count 48
Applied a total of 99 rules in 18 ms. Remains 55 /106 variables (removed 51) and now considering 48/99 (removed 51) transitions.
// Phase 1: matrix 48 rows 55 cols
[2024-06-02 18:18:00] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:18:01] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:18:01] [INFO ] Invariant cache hit.
[2024-06-02 18:18:01] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-06-02 18:18:01] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-02 18:18:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/102 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 63 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/102 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 109 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 3414ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3414ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/106 places, 48/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3591 ms. Remains : 55/106 places, 48/99 transitions.
[2024-06-02 18:18:04] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:04] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:18:04] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 38 steps (1 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-03-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 18:18:04] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:18:04] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality512827059357751394.gal : 2 ms
[2024-06-02 18:18:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4538626918676720604.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality512827059357751394.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4538626918676720604.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 95 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 95 transition count 88
Applied a total of 22 rules in 5 ms. Remains 95 /106 variables (removed 11) and now considering 88/99 (removed 11) transitions.
// Phase 1: matrix 88 rows 95 cols
[2024-06-02 18:18:04] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:18:04] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 18:18:04] [INFO ] Invariant cache hit.
[2024-06-02 18:18:04] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-06-02 18:18:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:18:05] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:18:05] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:18:05] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:18:06] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/183 variables, 95/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:18:07] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:18:09] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/183 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 109 constraints, problems are : Problem set: 0 solved, 87 unsolved in 6210 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:18:11] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-06-02 18:18:11] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/183 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 87/198 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:18:12] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:18:13] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:18:13] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:18:16] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:18:16] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/183 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:18:20] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:18:20] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/183 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 205 constraints, problems are : Problem set: 0 solved, 87 unsolved in 15735 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 15/15 constraints]
After SMT, in 21972ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 21974ms
Starting structural reductions in LTL mode, iteration 1 : 95/106 places, 88/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22259 ms. Remains : 95/106 places, 88/99 transitions.
[2024-06-02 18:18:26] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:26] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:26] [INFO ] Input system was already deterministic with 88 transitions.
[2024-06-02 18:18:26] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:26] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12050040954942468285.gal : 6 ms
[2024-06-02 18:18:26] [INFO ] Time to serialize properties into /tmp/CTLFireability4690982043668690457.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/CTLFireability12050040954942468285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4690982043668690457.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18276e+08,0.456559,16100,2,2594,5,37923,6,0,470,81404,0


Converting to forward existential form...Done !
original formula: EF((EX(EG((p21==1))) + (p43==1)))
=> equivalent forward existential formula: ([FwdG(EY(FwdU(Init,TRUE)),(p21==1))] != FALSE + [(FwdU(Init,TRUE) * (p43==1))] != FALSE)
dead was empty
(forward)formula 0,1,1.98886,56460,1,0,755,246104,13,3,2101,283839,752
FORMULA MedleyA-PT-03-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 96 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 96 transition count 89
Applied a total of 20 rules in 12 ms. Remains 96 /106 variables (removed 10) and now considering 89/99 (removed 10) transitions.
// Phase 1: matrix 89 rows 96 cols
[2024-06-02 18:18:28] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:18:29] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:18:29] [INFO ] Invariant cache hit.
[2024-06-02 18:18:29] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-06-02 18:18:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-02 18:18:29] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:18:29] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:18:29] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:18:29] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:18:30] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:18:30] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-02 18:18:30] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/185 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-02 18:18:31] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-02 18:18:31] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 113 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4169 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-02 18:18:34] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/185 variables, 96/114 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 88/202 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-02 18:18:35] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:18:35] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:18:35] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:18:35] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:18:35] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-02 18:18:37] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:18:37] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 209 constraints, problems are : Problem set: 0 solved, 88 unsolved in 10311 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 17/17 constraints]
After SMT, in 14501ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 14503ms
Starting structural reductions in LTL mode, iteration 1 : 96/106 places, 89/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14778 ms. Remains : 96/106 places, 89/99 transitions.
[2024-06-02 18:18:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:18:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:18:43] [INFO ] Input system was already deterministic with 89 transitions.
[2024-06-02 18:18:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:18:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:18:43] [INFO ] Time to serialize gal into /tmp/CTLFireability18334280774251383141.gal : 2 ms
[2024-06-02 18:18:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5005821272480052308.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18334280774251383141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5005821272480052308.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27074e+08,0.594061,17688,2,3830,5,40646,6,0,475,91042,0


Converting to forward existential form...Done !
original formula: A((p38==1) U A(!((((p63==1) + A((p0==1) U (p13==1))) * (AX(((p8==1)&&(p40==1))) + A((p29==1) U (p27==1))))) U (p4==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((p4==1)) U (!(!((((p63==1) + !((E(!((p13==1)) U (!((p0==1)) * !((p13==1)))) + EG(!((p13=...841
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t13, t18, t21, t24, t26, t28, t33, t35, t40, t43, t46, t48, t50, t51, t54, t74, ...253
Detected timeout of ITS tools.
[2024-06-02 18:19:13] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:19:13] [INFO ] Applying decomposition
[2024-06-02 18:19:13] [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/graph15619738484028179853.txt' '-o' '/tmp/graph15619738484028179853.bin' '-w' '/tmp/graph15619738484028179853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15619738484028179853.bin' '-l' '-1' '-v' '-w' '/tmp/graph15619738484028179853.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:19:13] [INFO ] Decomposing Gal with order
[2024-06-02 18:19:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:19:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:19:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-02 18:19:13] [INFO ] Time to serialize gal into /tmp/CTLFireability11145165235083822235.gal : 3 ms
[2024-06-02 18:19:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3350740271497600864.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/CTLFireability11145165235083822235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3350740271497600864.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27074e+08,0.131601,6148,459,165,3414,2854,208,4699,117,11501,0


Converting to forward existential form...Done !
original formula: A((i1.u16.p38==1) U A(!((((i7.u25.p63==1) + A((i10.u32.p0==1) U (i0.u5.p13==1))) * (AX(((i5.u3.p8==1)&&(i4.u15.p40==1))) + A((i3.u11.p29=...202
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((i10.u1.p4==1)) U (!(!((((i7.u25.p63==1) + !((E(!((i0.u5.p13==1)) U (!((i10.u32.p0==1)) ...1160
Reverse transition relation is NOT exact ! Due to transitions u31.t74, i0.u27.t11, i0.u29.t4, i1.u13.t40, i1.u16.t33, i2.i0.u9.t50, i2.i1.t51, i2.i1.u10.t4...379
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,7.27272,225268,1,0,512486,8410,1361,524204,791,79732,632939
FORMULA MedleyA-PT-03-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 105 transition count 82
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 89 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 88 transition count 81
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 34 place count 88 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 82 transition count 75
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 78 transition count 71
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 78 transition count 71
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 78 place count 66 transition count 59
Applied a total of 78 rules in 13 ms. Remains 66 /106 variables (removed 40) and now considering 59/99 (removed 40) transitions.
// Phase 1: matrix 59 rows 66 cols
[2024-06-02 18:19:21] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:19:21] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:19:21] [INFO ] Invariant cache hit.
[2024-06-02 18:19:21] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-06-02 18:19:21] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-02 18:19:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:19:21] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
[2024-06-02 18:19:22] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/125 variables, 66/76 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:19:22] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:19:22] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:19:22] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:19:22] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:19:23] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:19:23] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2734 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/125 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 58/140 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:19:25] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:19:27] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/125 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 58 unsolved in 6067 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 10/10 constraints]
After SMT, in 8831ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 8833ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/106 places, 59/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9043 ms. Remains : 66/106 places, 59/99 transitions.
[2024-06-02 18:19:30] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:19:30] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:19:30] [INFO ] Input system was already deterministic with 59 transitions.
[2024-06-02 18:19:30] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:19:30] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:19:30] [INFO ] Time to serialize gal into /tmp/CTLFireability14879394354718850452.gal : 1 ms
[2024-06-02 18:19:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11863160218983916098.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/CTLFireability14879394354718850452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11863160218983916098.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,4.11354e+06,0.054539,4392,2,1233,5,4701,6,0,324,3570,0


Converting to forward existential form...Done !
original formula: A((EF((p33==1)) + E(!((E((p12==1) U ((p86==1)&&(p99==1))) + (p79!=1))) U !(EF(((p77==1)&&(p58==1)))))) U EG(AF(((!((p77==1)||(p81==1)))||...179
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(EG(!(((!((p77==1)||(p81==1)))||((p46==1)&&(p52==1))))))))))) * !(E(!(EG(!(EG(!(((!((p77==1...396
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t8, t10, t13, t17, t19, t39, t44, t49, t52, Intersection with reachable ...224
(forward)formula 0,1,1.864,56504,1,0,648,315256,149,79,2030,298523,646
FORMULA MedleyA-PT-03-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 93 transition count 86
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 92 transition count 85
Applied a total of 28 rules in 5 ms. Remains 92 /106 variables (removed 14) and now considering 85/99 (removed 14) transitions.
// Phase 1: matrix 85 rows 92 cols
[2024-06-02 18:19:32] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:19:32] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:19:32] [INFO ] Invariant cache hit.
[2024-06-02 18:19:32] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-02 18:19:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:19:33] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:19:33] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:19:34] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 103 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3624 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 84/187 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:19:37] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 188 constraints, problems are : Problem set: 0 solved, 84 unsolved in 6254 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints]
After SMT, in 9899ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 9900ms
Starting structural reductions in LTL mode, iteration 1 : 92/106 places, 85/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10085 ms. Remains : 92/106 places, 85/99 transitions.
[2024-06-02 18:19:42] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:19:42] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:19:42] [INFO ] Input system was already deterministic with 85 transitions.
[2024-06-02 18:19:42] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:19:42] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:19:42] [INFO ] Time to serialize gal into /tmp/CTLFireability564817593551769158.gal : 2 ms
[2024-06-02 18:19:42] [INFO ] Time to serialize properties into /tmp/CTLFireability630899830168546138.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/CTLFireability564817593551769158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability630899830168546138.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10961e+08,0.406029,13708,2,1668,5,33021,6,0,455,63355,0


Converting to forward existential form...Done !
original formula: AX(EX(AG(((p86==0)||(p106==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U !(((p86==0)||(p106==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t13, t18, t20, t25, t27, t32, t34, t39, t41, t47, t50, t51, t71, Intersection w...238
(forward)formula 0,0,1.11982,33096,1,0,209,142779,192,96,2738,209334,208
FORMULA MedleyA-PT-03-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 87
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 93 transition count 86
Applied a total of 26 rules in 5 ms. Remains 93 /106 variables (removed 13) and now considering 86/99 (removed 13) transitions.
// Phase 1: matrix 86 rows 93 cols
[2024-06-02 18:19:43] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:19:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 18:19:43] [INFO ] Invariant cache hit.
[2024-06-02 18:19:43] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:19:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:19:44] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:19:44] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:19:44] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:19:44] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:19:44] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:19:45] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:19:45] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/179 variables, 93/108 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:19:46] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:19:46] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:19:46] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 111 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4942 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:19:49] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:19:49] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:19:49] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:19:49] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:19:49] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:19:49] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
[2024-06-02 18:19:49] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 86/179 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 85/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:19:52] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:19:52] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/179 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:19:55] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 206 constraints, problems are : Problem set: 0 solved, 85 unsolved in 13667 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 20/20 constraints]
After SMT, in 18635ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 18637ms
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 86/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18853 ms. Remains : 93/106 places, 86/99 transitions.
[2024-06-02 18:20:02] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:20:02] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:20:02] [INFO ] Input system was already deterministic with 86 transitions.
[2024-06-02 18:20:02] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:20:02] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:20:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3225743071729636717.gal : 1 ms
[2024-06-02 18:20:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6949905885082674294.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/CTLFireability3225743071729636717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6949905885082674294.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18819e+08,0.299888,13712,2,3198,5,33044,6,0,460,63217,0


Converting to forward existential form...Done !
original formula: E(!((EG(AG((p35==1))) * AF((p2==1)))) U ((AG(((p86==1)&&(p98==1))) * (p86==1)) * ((p93==1) * (EX((p55!=1)) + (p79==1)))))
=> equivalent forward existential formula: ([(EY(((FwdU(Init,!((EG(!(E(TRUE U !((p35==1))))) * !(EG(!((p2==1))))))) * (!(E(TRUE U !(((p86==1)&&(p98==1)))))...362
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t10, t12, t14, t19, t21, t26, t28, t33, t35, t40, t42, t48, t51, t52, t72, Intersect...243
(forward)formula 0,0,1.48817,46820,1,0,191,180579,198,82,2629,237253,186
FORMULA MedleyA-PT-03-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 105 transition count 87
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 94 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 93 transition count 86
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 24 place count 93 transition count 79
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 38 place count 86 transition count 79
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 45 place count 79 transition count 72
Iterating global reduction 3 with 7 rules applied. Total rules applied 52 place count 79 transition count 72
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 70 place count 70 transition count 63
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 70 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 69 transition count 62
Applied a total of 72 rules in 16 ms. Remains 69 /106 variables (removed 37) and now considering 62/99 (removed 37) transitions.
// Phase 1: matrix 62 rows 69 cols
[2024-06-02 18:20:03] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:20:03] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:20:03] [INFO ] Invariant cache hit.
[2024-06-02 18:20:04] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-06-02 18:20:04] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-02 18:20:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 4/69 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:20:04] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:20:04] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 62/131 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:20:05] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:20:05] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/131 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 81 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2758 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 4/69 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 62/131 variables, 69/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:20:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:20:09] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:20:10] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:20:10] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 143 constraints, problems are : Problem set: 0 solved, 58 unsolved in 6279 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 8/8 constraints]
After SMT, in 9058ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 9060ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/106 places, 62/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9276 ms. Remains : 69/106 places, 62/99 transitions.
[2024-06-02 18:20:13] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:20:13] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:20:13] [INFO ] Input system was already deterministic with 62 transitions.
[2024-06-02 18:20:13] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:20:13] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:20:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4536373428852444767.gal : 1 ms
[2024-06-02 18:20:13] [INFO ] Time to serialize properties into /tmp/CTLFireability371921781962033570.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/CTLFireability4536373428852444767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability371921781962033570.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.58351e+07,0.059128,4932,2,1343,5,7005,6,0,338,6842,0


Converting to forward existential form...Done !
original formula: E((AG(((AF((p19!=1)) * (p86==1)) * (p104==1))) + EG(!(EF(((p56==1)&&(p62==1)))))) U ((!(E(((E((p85==1) U (p85==1)) * (p19==1)) * (p83==1)...358
=> equivalent forward existential formula: ([((FwdU(Init,(!(E(TRUE U !(((!(EG(!((p19!=1)))) * (p86==1)) * (p104==1))))) + EG(!(E(TRUE U ((p56==1)&&(p62==1)...1776
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t9, t10, t12, t13, t16, t20, t22, t41, t48, t53, t61, Intersection with reachable at...222
(forward)formula 0,0,21.2068,568520,1,0,1506,3.60384e+06,201,554,2140,4.79835e+06,1514
FORMULA MedleyA-PT-03-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 97 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 97 transition count 90
Applied a total of 18 rules in 2 ms. Remains 97 /106 variables (removed 9) and now considering 90/99 (removed 9) transitions.
// Phase 1: matrix 90 rows 97 cols
[2024-06-02 18:20:34] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:20:34] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:20:34] [INFO ] Invariant cache hit.
[2024-06-02 18:20:34] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-06-02 18:20:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-02 18:20:35] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:20:35] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:20:35] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:20:35] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:20:35] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:20:35] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:20:35] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:20:35] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-02 18:20:37] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:20:37] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:20:37] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/187 variables, 97/131 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-02 18:20:39] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:20:39] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/187 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 133 constraints, problems are : Problem set: 0 solved, 89 unsolved in 6721 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-02 18:20:42] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/187 variables, 97/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-02 18:20:43] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:20:43] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:20:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-02 18:20:45] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-02 18:20:49] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-02 18:20:51] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-02 18:20:55] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:20:55] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-02 18:21:00] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/187 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 15 (OVERLAPS) 0/187 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 232 constraints, problems are : Problem set: 0 solved, 89 unsolved in 25109 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 38/38 constraints]
After SMT, in 31845ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 31846ms
Starting structural reductions in LTL mode, iteration 1 : 97/106 places, 90/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32011 ms. Remains : 97/106 places, 90/99 transitions.
[2024-06-02 18:21:06] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:21:06] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:21:06] [INFO ] Input system was already deterministic with 90 transitions.
[2024-06-02 18:21:06] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:21:06] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:21:06] [INFO ] Time to serialize gal into /tmp/CTLFireability7726407385436220382.gal : 1 ms
[2024-06-02 18:21:06] [INFO ] Time to serialize properties into /tmp/CTLFireability18076741209231123569.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/CTLFireability7726407385436220382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18076741209231123569.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26317e+08,0.344358,15072,2,4680,5,36797,6,0,480,72614,0


Converting to forward existential form...Done !
original formula: A((AX(AF((((p74!=1)||(p59==1))||((p86==1)&&(p94==1))))) * (AF(AG((p59!=1))) + ((!(AX(((p86==1)&&(p93==1)))) * !(AX((p57==1)))) * (((E(((p...404
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((E(!(!(EG(!(EX(((p86==1)&&(p106==1))))))) U (!(((!(EG(!((p35==1)))) * !(((p86==1)&&(p91==1)...1188
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t10, t13, t15, t16, t20, t23, t26, t29, t31, t32, t36, t38, t44, t46, t47, t52, t55, ...263
Detected timeout of ITS tools.
[2024-06-02 18:21:36] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:21:36] [INFO ] Applying decomposition
[2024-06-02 18:21:36] [INFO ] Flatten gal took : 3 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/graph15179772910473842145.txt' '-o' '/tmp/graph15179772910473842145.bin' '-w' '/tmp/graph15179772910473842145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15179772910473842145.bin' '-l' '-1' '-v' '-w' '/tmp/graph15179772910473842145.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:21:36] [INFO ] Decomposing Gal with order
[2024-06-02 18:21:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:21:36] [INFO ] Removed a total of 1 redundant transitions.
[2024-06-02 18:21:36] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:21:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-02 18:21:36] [INFO ] Time to serialize gal into /tmp/CTLFireability14381446692786902149.gal : 3 ms
[2024-06-02 18:21:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11911808163487109479.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/CTLFireability14381446692786902149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11911808163487109479.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26317e+08,0.092988,6440,546,184,4673,2933,232,4804,117,9894,0


Converting to forward existential form...Done !
original formula: A((AX(AF((((i9.u27.p74!=1)||(i7.u23.p59==1))||((u33.p86==1)&&(u33.p94==1))))) * (AF(AG((i7.u23.p59!=1))) + ((!(AX(((u33.p86==1)&&(u33.p93...568
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((E(!(!(EG(!(EX(((u33.p86==1)&&(u33.p106==1))))))) U (!(((!(EG(!((i3.u11.p35==1)))) * !(((u3...1534
Reverse transition relation is NOT exact ! Due to transitions u33.t76, i0.u1.t56, i1.i0.u17.t36, i1.i1.t44, i1.i1.u12.t47, i2.t55, i2.u8.t52, i3.u13.t46, i...404
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,12.831,448160,1,0,1.01911e+06,8150,1544,1.0921e+06,795,78264,1162325
FORMULA MedleyA-PT-03-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 105 transition count 80
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 87 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 86 transition count 79
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 38 place count 86 transition count 71
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 54 place count 78 transition count 71
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 61 place count 71 transition count 64
Iterating global reduction 3 with 7 rules applied. Total rules applied 68 place count 71 transition count 64
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 94 place count 58 transition count 51
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 57 transition count 50
Applied a total of 96 rules in 15 ms. Remains 57 /106 variables (removed 49) and now considering 50/99 (removed 49) transitions.
// Phase 1: matrix 50 rows 57 cols
[2024-06-02 18:21:49] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:21:49] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 18:21:49] [INFO ] Invariant cache hit.
[2024-06-02 18:21:49] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-06-02 18:21:49] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-02 18:21:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 50/107 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 65 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1065 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 50/107 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 49/114 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 114 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2155 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 3244ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 3245ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/106 places, 50/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3401 ms. Remains : 57/106 places, 50/99 transitions.
[2024-06-02 18:21:52] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:21:52] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:21:52] [INFO ] Input system was already deterministic with 50 transitions.
[2024-06-02 18:21:52] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:21:52] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:21:52] [INFO ] Time to serialize gal into /tmp/CTLFireability11063590626542495115.gal : 2 ms
[2024-06-02 18:21:52] [INFO ] Time to serialize properties into /tmp/CTLFireability2882631756745901081.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/CTLFireability11063590626542495115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2882631756745901081.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: ((!(E((p85!=1) U (p33==1))) + EG(AF((p54!=1)))) + (EG((p34!=1)) * !(E(AG(((p9==1)&&(p50==1))) U !(((p86==1)&&(p94==1)))))))
=> equivalent forward existential formula: ([((Init * !((!(E((p85!=1) U (p33==1))) + EG(!(EG(!((p54!=1)))))))) * !(EG((p34!=1))))] = FALSE * [(FwdU((Init *...286
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t6, t8, t12, t13, t33, t35, t43, Intersection with reachable at each step enabled. (...200
(forward)formula 0,1,4.5935,136260,1,0,827,824885,144,213,1798,1.09653e+06,839
FORMULA MedleyA-PT-03-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 95 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 95 transition count 88
Applied a total of 22 rules in 2 ms. Remains 95 /106 variables (removed 11) and now considering 88/99 (removed 11) transitions.
// Phase 1: matrix 88 rows 95 cols
[2024-06-02 18:21:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:21:57] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 18:21:57] [INFO ] Invariant cache hit.
[2024-06-02 18:21:57] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-06-02 18:21:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
[2024-06-02 18:21:59] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:21:59] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/183 variables, 95/110 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:22:00] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 111 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4916 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/183 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 87/198 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:22:04] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-02 18:22:05] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 200 constraints, problems are : Problem set: 0 solved, 87 unsolved in 8746 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 10/10 constraints]
After SMT, in 13674ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 13675ms
Starting structural reductions in LTL mode, iteration 1 : 95/106 places, 88/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13835 ms. Remains : 95/106 places, 88/99 transitions.
[2024-06-02 18:22:11] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:22:11] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:22:11] [INFO ] Input system was already deterministic with 88 transitions.
[2024-06-02 18:22:11] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:22:11] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:22:11] [INFO ] Time to serialize gal into /tmp/CTLFireability7084905993264964539.gal : 1 ms
[2024-06-02 18:22:11] [INFO ] Time to serialize properties into /tmp/CTLFireability13484717565060760518.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/CTLFireability7084905993264964539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13484717565060760518.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19424e+08,0.07098,5804,2,2029,5,10503,6,0,470,8973,0


Converting to forward existential form...Done !
original formula: EG((AF(AG((AX(((p86==1)&&(p104==1))) * (p87==0)))) + ((!(E(AF((p4==1)) U ((p18==1)||(p33==1)))) * A((p0==1) U (p68==1))) * EX(((p46==1)&&...168
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(!(E(TRUE U !((!(EX(!(((p86==1)&&(p104==1))))) * (p87==0)))))))) + ((!(E(!(EG(!((p4==1)))) U (...286
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t8, t12, t14, t19, t21, t26, t28, t33, t35, t40, t43, t46, t47, t49, t53, t73, t84, ...252
Detected timeout of ITS tools.
[2024-06-02 18:22:41] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:22:41] [INFO ] Applying decomposition
[2024-06-02 18:22:41] [INFO ] Flatten gal took : 3 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/graph5513278728378386879.txt' '-o' '/tmp/graph5513278728378386879.bin' '-w' '/tmp/graph5513278728378386879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5513278728378386879.bin' '-l' '-1' '-v' '-w' '/tmp/graph5513278728378386879.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:22:41] [INFO ] Decomposing Gal with order
[2024-06-02 18:22:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:22:41] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:22:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-02 18:22:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11387585545633659413.gal : 2 ms
[2024-06-02 18:22:41] [INFO ] Time to serialize properties into /tmp/CTLFireability827678420517236016.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/CTLFireability11387585545633659413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability827678420517236016.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19424e+08,0.11861,7700,379,201,5100,5848,219,7066,130,21228,0


Converting to forward existential form...Done !
original formula: EG((AF(AG((AX(((u28.p86==1)&&(u28.p104==1))) * (i9.u26.p87==0)))) + ((!(E(AF((i0.u2.p4==1)) U ((i3.u8.p18==1)||(i4.u12.p33==1)))) * A((i0...229
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(!(E(TRUE U !((!(EX(!(((u28.p86==1)&&(u28.p104==1))))) * (i9.u26.p87==0)))))))) + ((!(E(!(EG(!...361
Reverse transition relation is NOT exact ! Due to transitions t5, u27.t7, u28.t8, u28.t73, i0.u2.t53, i1.u18.t26, i1.u22.t19, i2.u10.t40, i2.u14.t33, i3.u8...367
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,4.08946,129140,1,0,276240,14668,1618,323188,903,111530,313277
FORMULA MedleyA-PT-03-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-06-02 18:22:45] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:22:45] [INFO ] Flatten gal took : 3 ms
Total runtime 421350 ms.

BK_STOP 1717352565750

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

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