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.r334-tall-171679079500066.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 RingSingleMessageInMbox-PT-d1m010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079500066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 00:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 13 00:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 00:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Apr 13 00:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M May 18 16:43 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 RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716795091260

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-27 07:31:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 07:31:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:31:32] [INFO ] Load time of PNML (sax parser for PT used): 448 ms
[2024-05-27 07:31:32] [INFO ] Transformed 6690 places.
[2024-05-27 07:31:33] [INFO ] Transformed 11934 transitions.
[2024-05-27 07:31:33] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 613 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Deduced a syphon composed of 4305 places in 37 ms
Reduce places removed 4305 places and 0 transitions.
Support contains 61 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1067 places :
Symmetric choice reduction at 1 with 1067 rule applications. Total rules 1186 place count 1301 transition count 10355
Iterating global reduction 1 with 1067 rules applied. Total rules applied 2253 place count 1301 transition count 10355
Ensure Unique test removed 425 transitions
Reduce isomorphic transitions removed 425 transitions.
Iterating post reduction 1 with 425 rules applied. Total rules applied 2678 place count 1301 transition count 9930
Discarding 864 places :
Symmetric choice reduction at 2 with 864 rule applications. Total rules 3542 place count 437 transition count 9066
Iterating global reduction 2 with 864 rules applied. Total rules applied 4406 place count 437 transition count 9066
Ensure Unique test removed 7010 transitions
Reduce isomorphic transitions removed 7010 transitions.
Iterating post reduction 2 with 7010 rules applied. Total rules applied 11416 place count 437 transition count 2056
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 11431 place count 422 transition count 2041
Iterating global reduction 3 with 15 rules applied. Total rules applied 11446 place count 422 transition count 2041
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 11448 place count 422 transition count 2039
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 11456 place count 414 transition count 2031
Iterating global reduction 4 with 8 rules applied. Total rules applied 11464 place count 414 transition count 2031
Applied a total of 11464 rules in 659 ms. Remains 414 /2385 variables (removed 1971) and now considering 2031/11934 (removed 9903) transitions.
// Phase 1: matrix 2031 rows 414 cols
[2024-05-27 07:31:33] [INFO ] Computed 3 invariants in 38 ms
[2024-05-27 07:31:34] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-27 07:31:34] [INFO ] Invariant cache hit.
[2024-05-27 07:31:34] [INFO ] State equation strengthened by 1660 read => feed constraints.
[2024-05-27 07:31:37] [INFO ] Implicit Places using invariants and state equation in 3413 ms returned []
Implicit Place search using SMT with State Equation took 3862 ms to find 0 implicit places.
Running 2030 sub problems to find dead transitions.
[2024-05-27 07:31:37] [INFO ] Invariant cache hit.
[2024-05-27 07:31:37] [INFO ] State equation strengthened by 1660 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 2 (OVERLAPS) 1/414 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/2445 variables, and 3 constraints, problems are : Problem set: 0 solved, 2030 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/414 constraints, ReadFeed: 0/1660 constraints, PredecessorRefiner: 2030/2030 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2030 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 2 (OVERLAPS) 1/414 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2030 unsolved
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD1992 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD1998 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2002 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2009 is UNSAT
Problem TDEAD2010 is UNSAT
At refinement iteration 4 (OVERLAPS) 2031/2445 variables, 414/417 constraints. Problems are: Problem set: 24 solved, 2006 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2445 variables, 1660/2077 constraints. Problems are: Problem set: 24 solved, 2006 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2445/2445 variables, and 4083 constraints, problems are : Problem set: 24 solved, 2006 unsolved in 32299 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 414/414 constraints, ReadFeed: 1660/1660 constraints, PredecessorRefiner: 2006/2030 constraints, Known Traps: 0/0 constraints]
After SMT, in 72891ms problems are : Problem set: 24 solved, 2006 unsolved
Search for dead transitions found 24 dead transitions in 72922ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 414/2385 places, 2007/11934 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 390 transition count 1995
Applied a total of 36 rules in 12 ms. Remains 390 /414 variables (removed 24) and now considering 1995/2007 (removed 12) transitions.
// Phase 1: matrix 1995 rows 390 cols
[2024-05-27 07:32:50] [INFO ] Computed 2 invariants in 9 ms
[2024-05-27 07:32:50] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-27 07:32:50] [INFO ] Invariant cache hit.
[2024-05-27 07:32:51] [INFO ] State equation strengthened by 1656 read => feed constraints.
[2024-05-27 07:32:53] [INFO ] Implicit Places using invariants and state equation in 2952 ms returned []
Implicit Place search using SMT with State Equation took 3106 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 390/2385 places, 1995/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80599 ms. Remains : 390/2385 places, 1995/11934 transitions.
Support contains 61 out of 390 places after structural reductions.
[2024-05-27 07:32:54] [INFO ] Flatten gal took : 130 ms
[2024-05-27 07:32:54] [INFO ] Flatten gal took : 91 ms
[2024-05-27 07:32:54] [INFO ] Input system was already deterministic with 1995 transitions.
Reduction of identical properties reduced properties to check from 60 to 58
RANDOM walk for 40000 steps (6717 resets) in 2892 ms. (13 steps per ms) remains 11/58 properties
BEST_FIRST walk for 40004 steps (675 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (673 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (665 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (746 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (811 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (660 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (654 resets) in 109 ms. (363 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (660 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (652 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (923 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (633 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
[2024-05-27 07:32:55] [INFO ] Invariant cache hit.
[2024-05-27 07:32:55] [INFO ] State equation strengthened by 1656 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 65/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 7/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 924/1018 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1018 variables, 585/681 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1018 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 8 (OVERLAPS) 1367/2385 variables, 296/977 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2385 variables, 1071/2048 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-05-27 07:32:57] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 16 ms to minimize.
[2024-05-27 07:32:57] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-05-27 07:32:57] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 2 ms to minimize.
Problem AtomicPropp40 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/2385 variables, 3/2051 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2385 variables, 0/2051 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2385 variables, 0/2051 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2385/2385 variables, and 2051 constraints, problems are : Problem set: 10 solved, 1 unsolved in 1566 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 390/390 constraints, ReadFeed: 1656/1656 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/69 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/76 variables, 1/2 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 367/443 variables, 76/78 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 28/106 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/106 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1939/2382 variables, 311/417 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2382 variables, 1628/2045 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2382 variables, 1/2046 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2382 variables, 3/2049 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2382 variables, 0/2049 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/2385 variables, 3/2052 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2385 variables, 0/2052 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2385 variables, 0/2052 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2385/2385 variables, and 2052 constraints, problems are : Problem set: 10 solved, 1 unsolved in 1549 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 390/390 constraints, ReadFeed: 1656/1656 constraints, PredecessorRefiner: 1/11 constraints, Known Traps: 3/3 constraints]
After SMT, in 3292ms problems are : Problem set: 10 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 2 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Graph (complete) has 2678 edges and 390 vertex of which 389 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 389 transition count 1986
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 59 place count 340 transition count 560
Iterating global reduction 1 with 49 rules applied. Total rules applied 108 place count 340 transition count 560
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 119 place count 340 transition count 549
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 186 place count 273 transition count 482
Iterating global reduction 2 with 67 rules applied. Total rules applied 253 place count 273 transition count 482
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 292 place count 273 transition count 443
Discarding 116 places :
Symmetric choice reduction at 3 with 116 rule applications. Total rules 408 place count 157 transition count 327
Iterating global reduction 3 with 116 rules applied. Total rules applied 524 place count 157 transition count 327
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 620 place count 157 transition count 231
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 623 place count 154 transition count 192
Iterating global reduction 4 with 3 rules applied. Total rules applied 626 place count 154 transition count 192
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 628 place count 152 transition count 190
Iterating global reduction 4 with 2 rules applied. Total rules applied 630 place count 152 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 631 place count 152 transition count 189
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 635 place count 148 transition count 185
Iterating global reduction 5 with 4 rules applied. Total rules applied 639 place count 148 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 643 place count 148 transition count 181
Applied a total of 643 rules in 85 ms. Remains 148 /390 variables (removed 242) and now considering 181/1995 (removed 1814) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 148/390 places, 181/1995 transitions.
RANDOM walk for 40000 steps (8496 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1586 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2493116 steps, run timeout after 3001 ms. (steps per millisecond=830 ) properties seen :0 out of 1
Probabilistic random walk after 2493116 steps, saw 1086054 distinct states, run finished after 3004 ms. (steps per millisecond=829 ) properties seen :0
// Phase 1: matrix 181 rows 148 cols
[2024-05-27 07:33:02] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 07:33:02] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 187/322 variables, 139/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 48/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/329 variables, 7/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 07:33:02] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/329 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 148/148 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 187/322 variables, 139/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 48/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 07:33:02] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/329 variables, 7/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/329 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 148/148 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 394ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 181/181 transitions.
Applied a total of 0 rules in 10 ms. Remains 148 /148 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 148/148 places, 181/181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 181/181 transitions.
Applied a total of 0 rules in 8 ms. Remains 148 /148 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2024-05-27 07:33:02] [INFO ] Invariant cache hit.
[2024-05-27 07:33:02] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-27 07:33:02] [INFO ] Invariant cache hit.
[2024-05-27 07:33:02] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-27 07:33:03] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-27 07:33:03] [INFO ] Redundant transitions in 4 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-27 07:33:03] [INFO ] Invariant cache hit.
[2024-05-27 07:33:03] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-27 07:33:04] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-27 07:33:04] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 4 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
[2024-05-27 07:33:04] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
[2024-05-27 07:33:05] [INFO ] Deduced a trap composed of 57 places in 33 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
[2024-05-27 07:33:05] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 5/8 constraints. Problems are: Problem set: 22 solved, 158 unsolved
[2024-05-27 07:33:05] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/9 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/9 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 181/329 variables, 148/157 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 49/206 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/206 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 0/329 variables, 0/206 constraints. Problems are: Problem set: 22 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 206 constraints, problems are : Problem set: 22 solved, 158 unsolved in 6309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 148/148 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 22 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 19/148 variables, 3/3 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 6/9 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/9 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 181/329 variables, 148/157 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 49/206 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 158/364 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/364 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 0/329 variables, 0/364 constraints. Problems are: Problem set: 22 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 364 constraints, problems are : Problem set: 22 solved, 158 unsolved in 9777 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 148/148 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 158/180 constraints, Known Traps: 6/6 constraints]
After SMT, in 16394ms problems are : Problem set: 22 solved, 158 unsolved
Search for dead transitions found 22 dead transitions in 16395ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 148/148 places, 159/181 transitions.
Graph (complete) has 405 edges and 148 vertex of which 130 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 127 transition count 152
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 10 rules in 12 ms. Remains 127 /148 variables (removed 21) and now considering 151/159 (removed 8) transitions.
// Phase 1: matrix 151 rows 127 cols
[2024-05-27 07:33:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:33:19] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-27 07:33:19] [INFO ] Invariant cache hit.
[2024-05-27 07:33:19] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-27 07:33:19] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 127/148 places, 151/181 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16969 ms. Remains : 127/148 places, 151/181 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2024-05-27 07:33:19] [INFO ] Flatten gal took : 60 ms
[2024-05-27 07:33:19] [INFO ] Flatten gal took : 76 ms
[2024-05-27 07:33:20] [INFO ] Input system was already deterministic with 1995 transitions.
Computed a total of 125 stabilizing places and 965 stable transitions
Graph (complete) has 2765 edges and 390 vertex of which 389 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 345 transition count 763
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 345 transition count 763
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 107 place count 345 transition count 746
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 170 place count 282 transition count 683
Iterating global reduction 1 with 63 rules applied. Total rules applied 233 place count 282 transition count 683
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 309 place count 282 transition count 607
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 409 place count 182 transition count 507
Iterating global reduction 2 with 100 rules applied. Total rules applied 509 place count 182 transition count 507
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 2 with 152 rules applied. Total rules applied 661 place count 182 transition count 355
Applied a total of 661 rules in 16 ms. Remains 182 /390 variables (removed 208) and now considering 355/1995 (removed 1640) transitions.
// Phase 1: matrix 355 rows 182 cols
[2024-05-27 07:33:20] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:33:20] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-27 07:33:20] [INFO ] Invariant cache hit.
[2024-05-27 07:33:20] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-05-27 07:33:20] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2024-05-27 07:33:20] [INFO ] Invariant cache hit.
[2024-05-27 07:33:20] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/182 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (OVERLAPS) 355/537 variables, 182/184 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 196/380 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (OVERLAPS) 0/537 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 354 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 380 constraints, problems are : Problem set: 0 solved, 354 unsolved in 14106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 182/182 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/182 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (OVERLAPS) 355/537 variables, 182/184 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 196/380 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 354/734 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-05-27 07:33:45] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-27 07:33:46] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-27 07:33:46] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2024-05-27 07:33:46] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
[2024-05-27 07:33:51] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 07:33:51] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:33:51] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:33:51] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 8/742 constraints. Problems are: Problem set: 22 solved, 332 unsolved
[2024-05-27 07:33:58] [INFO ] Deduced a trap composed of 66 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 1/743 constraints. Problems are: Problem set: 22 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/537 variables, and 743 constraints, problems are : Problem set: 22 solved, 332 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 182/182 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 9/9 constraints]
After SMT, in 44829ms problems are : Problem set: 22 solved, 332 unsolved
Search for dead transitions found 22 dead transitions in 44835ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 182/390 places, 333/1995 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 164 transition count 327
Applied a total of 24 rules in 5 ms. Remains 164 /182 variables (removed 18) and now considering 327/333 (removed 6) transitions.
// Phase 1: matrix 327 rows 164 cols
[2024-05-27 07:34:05] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 07:34:05] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 07:34:05] [INFO ] Invariant cache hit.
[2024-05-27 07:34:05] [INFO ] State equation strengthened by 192 read => feed constraints.
[2024-05-27 07:34:05] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 164/390 places, 327/1995 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45950 ms. Remains : 164/390 places, 327/1995 transitions.
[2024-05-27 07:34:06] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:34:06] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:34:06] [INFO ] Input system was already deterministic with 327 transitions.
[2024-05-27 07:34:06] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:34:06] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:34:06] [INFO ] Time to serialize gal into /tmp/CTLFireability4742355543312584838.gal : 9 ms
[2024-05-27 07:34:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12981981186616149602.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/CTLFireability4742355543312584838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12981981186616149602.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.95826e+08,1.62242,54656,2,11847,5,120803,6,0,983,126319,0


Converting to forward existential form...Done !
original formula: AF((AG((((p701>=1)&&(l0>=1))||((s1>=1)&&(l3922>=1)))) * (A(((s1>=1)&&(l3936>=1)) U ((s1>=1)&&(l3930>=1))) + ((AX(((s1>=1)&&(l3933>=1))) *...181
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((((p701>=1)&&(l0>=1))||((s1>=1)&&(l3922>=1)))))) * (!((E(!(((s1>=1)&&(l3930>=1))) U (...315
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t11, t12, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, ...1284
(forward)formula 0,0,26.1285,683824,1,0,714,2.57238e+06,694,277,7421,2.66108e+06,908
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 343 transition count 667
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 343 transition count 667
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 109 place count 343 transition count 652
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 174 place count 278 transition count 587
Iterating global reduction 1 with 65 rules applied. Total rules applied 239 place count 278 transition count 587
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 297 place count 278 transition count 529
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 405 place count 170 transition count 421
Iterating global reduction 2 with 108 rules applied. Total rules applied 513 place count 170 transition count 421
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 641 place count 170 transition count 293
Applied a total of 641 rules in 21 ms. Remains 170 /390 variables (removed 220) and now considering 293/1995 (removed 1702) transitions.
// Phase 1: matrix 293 rows 170 cols
[2024-05-27 07:34:32] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:34:32] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-27 07:34:32] [INFO ] Invariant cache hit.
[2024-05-27 07:34:32] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-27 07:34:33] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-27 07:34:33] [INFO ] Invariant cache hit.
[2024-05-27 07:34:33] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/463 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 144/316 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 316 constraints, problems are : Problem set: 0 solved, 292 unsolved in 11327 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/463 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 144/316 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 292/608 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-27 07:34:51] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:34:51] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:34:52] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-27 07:34:52] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
[2024-05-27 07:34:52] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
[2024-05-27 07:34:55] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
Problem TDEAD256 is UNSAT
[2024-05-27 07:34:55] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
[2024-05-27 07:34:56] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 8/616 constraints. Problems are: Problem set: 22 solved, 270 unsolved
[2024-05-27 07:35:04] [INFO ] Deduced a trap composed of 68 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 1/617 constraints. Problems are: Problem set: 22 solved, 270 unsolved
[2024-05-27 07:35:11] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 1/618 constraints. Problems are: Problem set: 22 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 618 constraints, problems are : Problem set: 22 solved, 270 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 10/10 constraints]
After SMT, in 41804ms problems are : Problem set: 22 solved, 270 unsolved
Search for dead transitions found 22 dead transitions in 41811ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 170/390 places, 271/1995 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 152 transition count 265
Applied a total of 24 rules in 3 ms. Remains 152 /170 variables (removed 18) and now considering 265/271 (removed 6) transitions.
// Phase 1: matrix 265 rows 152 cols
[2024-05-27 07:35:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:35:14] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-27 07:35:14] [INFO ] Invariant cache hit.
[2024-05-27 07:35:15] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-05-27 07:35:15] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/390 places, 265/1995 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42795 ms. Remains : 152/390 places, 265/1995 transitions.
[2024-05-27 07:35:15] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:35:15] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:35:15] [INFO ] Input system was already deterministic with 265 transitions.
[2024-05-27 07:35:15] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:35:15] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:35:15] [INFO ] Time to serialize gal into /tmp/CTLFireability11772472502311612994.gal : 3 ms
[2024-05-27 07:35:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3174822453649899887.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/CTLFireability11772472502311612994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3174822453649899887.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.76337e+08,1.25215,42208,2,10097,5,114163,6,0,873,90227,0


Converting to forward existential form...Done !
original formula: EG((AX(EG(!(E(((p158>=1)&&(l0>=1)) U ((s1>=1)&&(l3926>=1)))))) * ((s1<1)||(l3920<1))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(EG(!(E(((p158>=1)&&(l0>=1)) U ((s1>=1)&&(l3926>=1)))))))) * ((s1<1)||(l3920<1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27,...1004
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-27 07:35:45] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:35:45] [INFO ] Applying decomposition
[2024-05-27 07:35:45] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2111625705219817893.txt' '-o' '/tmp/graph2111625705219817893.bin' '-w' '/tmp/graph2111625705219817893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2111625705219817893.bin' '-l' '-1' '-v' '-w' '/tmp/graph2111625705219817893.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:35:45] [INFO ] Decomposing Gal with order
[2024-05-27 07:35:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:35:45] [INFO ] Removed a total of 272 redundant transitions.
[2024-05-27 07:35:45] [INFO ] Flatten gal took : 204 ms
[2024-05-27 07:35:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 28 ms.
[2024-05-27 07:35:45] [INFO ] Time to serialize gal into /tmp/CTLFireability5534465847402586712.gal : 8 ms
[2024-05-27 07:35:45] [INFO ] Time to serialize properties into /tmp/CTLFireability7491962840682313515.ctl : 6 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/CTLFireability5534465847402586712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7491962840682313515.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.76337e+08,22.5595,508916,3317,2545,225036,120117,537,3.81906e+06,278,2.53304e+06,0


Converting to forward existential form...Done !
original formula: EG((AX(EG(!(E(((i3.u3.p158>=1)&&(i0.u0.l0>=1)) U ((i0.u0.s1>=1)&&(u5.l3926>=1)))))) * ((i0.u0.s1<1)||(u5.l3920<1))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(EG(!(E(((i3.u3.p158>=1)&&(i0.u0.l0>=1)) U ((i0.u0.s1>=1)&&(u5.l3926>=1)))))))) * ((i0.u0.s1<1...183
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t57, t58, t121, t125, t138, t142, t151, t208, t209, t210, t211, t216, t217, t218, t...629
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 346 transition count 812
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 346 transition count 812
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 107 place count 346 transition count 793
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 169 place count 284 transition count 731
Iterating global reduction 1 with 62 rules applied. Total rules applied 231 place count 284 transition count 731
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 317 place count 284 transition count 645
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 413 place count 188 transition count 549
Iterating global reduction 2 with 96 rules applied. Total rules applied 509 place count 188 transition count 549
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 2 with 168 rules applied. Total rules applied 677 place count 188 transition count 381
Applied a total of 677 rules in 21 ms. Remains 188 /390 variables (removed 202) and now considering 381/1995 (removed 1614) transitions.
// Phase 1: matrix 381 rows 188 cols
[2024-05-27 07:36:15] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:36:16] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-27 07:36:16] [INFO ] Invariant cache hit.
[2024-05-27 07:36:16] [INFO ] State equation strengthened by 217 read => feed constraints.
[2024-05-27 07:36:16] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2024-05-27 07:36:16] [INFO ] Invariant cache hit.
[2024-05-27 07:36:16] [INFO ] State equation strengthened by 217 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 381/569 variables, 188/190 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 217/407 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-05-27 07:36:26] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 8 (OVERLAPS) 0/569 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 380 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 408 constraints, problems are : Problem set: 0 solved, 380 unsolved in 22362 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 217/217 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (OVERLAPS) 381/569 variables, 188/191 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 217/408 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 380/788 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-05-27 07:36:50] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:36:51] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
[2024-05-27 07:36:52] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
[2024-05-27 07:36:57] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 0 ms to minimize.
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
[2024-05-27 07:36:57] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 5/793 constraints. Problems are: Problem set: 22 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/569 variables, and 793 constraints, problems are : Problem set: 22 solved, 358 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 217/217 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 6/6 constraints]
After SMT, in 53164ms problems are : Problem set: 22 solved, 358 unsolved
Search for dead transitions found 22 dead transitions in 53167ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 188/390 places, 359/1995 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 170 transition count 353
Applied a total of 24 rules in 4 ms. Remains 170 /188 variables (removed 18) and now considering 353/359 (removed 6) transitions.
// Phase 1: matrix 353 rows 170 cols
[2024-05-27 07:37:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:37:10] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 07:37:10] [INFO ] Invariant cache hit.
[2024-05-27 07:37:10] [INFO ] State equation strengthened by 213 read => feed constraints.
[2024-05-27 07:37:10] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 170/390 places, 353/1995 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54445 ms. Remains : 170/390 places, 353/1995 transitions.
[2024-05-27 07:37:10] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:37:10] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:37:10] [INFO ] Input system was already deterministic with 353 transitions.
[2024-05-27 07:37:10] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:37:10] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:37:10] [INFO ] Time to serialize gal into /tmp/CTLFireability7461777269451157699.gal : 1 ms
[2024-05-27 07:37:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14773941480981642799.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/CTLFireability7461777269451157699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14773941480981642799.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.95826e+08,6.97786,190032,2,12636,5,497099,6,0,1033,309937,0


Converting to forward existential form...Done !
original formula: AG((((AX((((s1>=1)&&(l3932>=1))||((((s1<1)||(l3910<1))&&(s1>=1))&&(l3910>=1)))) + EF(AX(FALSE))) + (((p246>=1)&&(l0>=1)) + (EG(((s1>=1)&&...288
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !((!((E(!(((s1>=1)&&(l3927>=1))) U (!(((s1>=1)&&(l195>=1))) * !(((s1>=1)&&(l3927>=1)))...446
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t30, t31, t32, t33, t34,...1394
(forward)formula 0,1,15.4841,316440,1,0,546,1.26616e+06,728,218,7411,610454,726
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 341 transition count 616
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 341 transition count 616
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 110 place count 341 transition count 604
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 177 place count 274 transition count 537
Iterating global reduction 1 with 67 rules applied. Total rules applied 244 place count 274 transition count 537
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 293 place count 274 transition count 488
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 405 place count 162 transition count 376
Iterating global reduction 2 with 112 rules applied. Total rules applied 517 place count 162 transition count 376
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 629 place count 162 transition count 264
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 631 place count 160 transition count 238
Iterating global reduction 3 with 2 rules applied. Total rules applied 633 place count 160 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 634 place count 159 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 635 place count 159 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 636 place count 159 transition count 236
Applied a total of 636 rules in 25 ms. Remains 159 /390 variables (removed 231) and now considering 236/1995 (removed 1759) transitions.
// Phase 1: matrix 236 rows 159 cols
[2024-05-27 07:37:26] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:37:26] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 07:37:26] [INFO ] Invariant cache hit.
[2024-05-27 07:37:26] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-27 07:37:26] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-05-27 07:37:26] [INFO ] Invariant cache hit.
[2024-05-27 07:37:26] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 236/395 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 95/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-27 07:37:30] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-27 07:37:33] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-27 07:37:34] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-27 07:37:34] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 2/260 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/260 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 0/395 variables, 0/260 constraints. Problems are: Problem set: 20 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 260 constraints, problems are : Problem set: 20 solved, 215 unsolved in 13583 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 20 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 1/2 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 8/151 variables, 1/3 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/3 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 236/387 variables, 151/154 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 95/249 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 41/290 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/290 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 8/395 variables, 8/298 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 174/472 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 3/475 constraints. Problems are: Problem set: 20 solved, 215 unsolved
[2024-05-27 07:37:52] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-05-27 07:37:53] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
[2024-05-27 07:37:53] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 3 ms to minimize.
[2024-05-27 07:37:53] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:37:55] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
[2024-05-27 07:37:55] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:37:55] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 7/482 constraints. Problems are: Problem set: 22 solved, 213 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 0/482 constraints. Problems are: Problem set: 22 solved, 213 unsolved
At refinement iteration 15 (OVERLAPS) 0/395 variables, 0/482 constraints. Problems are: Problem set: 22 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 482 constraints, problems are : Problem set: 22 solved, 213 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 215/235 constraints, Known Traps: 11/11 constraints]
After SMT, in 43920ms problems are : Problem set: 22 solved, 213 unsolved
Search for dead transitions found 22 dead transitions in 43923ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 159/390 places, 214/1995 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 141 transition count 208
Applied a total of 24 rules in 2 ms. Remains 141 /159 variables (removed 18) and now considering 208/214 (removed 6) transitions.
// Phase 1: matrix 208 rows 141 cols
[2024-05-27 07:38:10] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:38:10] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-27 07:38:10] [INFO ] Invariant cache hit.
[2024-05-27 07:38:10] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-27 07:38:10] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/390 places, 208/1995 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44707 ms. Remains : 141/390 places, 208/1995 transitions.
[2024-05-27 07:38:10] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:38:10] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:38:10] [INFO ] Input system was already deterministic with 208 transitions.
[2024-05-27 07:38:10] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:38:10] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:38:10] [INFO ] Time to serialize gal into /tmp/CTLFireability10023526883867374102.gal : 2 ms
[2024-05-27 07:38:10] [INFO ] Time to serialize properties into /tmp/CTLFireability3648350340511537496.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/CTLFireability10023526883867374102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3648350340511537496.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.60264e+08,0.807361,34716,2,8475,5,97779,6,0,772,75770,0


Converting to forward existential form...Done !
original formula: EX(AG(EF(((s1<1)||(l3924<1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U ((s1<1)||(l3924<1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t16, t17, t18, t19, t36, t37, t38, t41, t50, t53, t59, t64, t75, t76, t77, t78, t79,...686
(forward)formula 0,1,5.15911,158968,1,0,381,532405,437,158,5466,376857,427
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 347 transition count 861
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 347 transition count 861
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 107 place count 347 transition count 840
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 138 place count 316 transition count 809
Iterating global reduction 1 with 31 rules applied. Total rules applied 169 place count 316 transition count 809
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 188 place count 316 transition count 790
Discarding 115 places :
Symmetric choice reduction at 2 with 115 rule applications. Total rules 303 place count 201 transition count 675
Iterating global reduction 2 with 115 rules applied. Total rules applied 418 place count 201 transition count 675
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Iterating post reduction 2 with 230 rules applied. Total rules applied 648 place count 201 transition count 445
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 649 place count 200 transition count 430
Iterating global reduction 3 with 1 rules applied. Total rules applied 650 place count 200 transition count 430
Applied a total of 650 rules in 61 ms. Remains 200 /390 variables (removed 190) and now considering 430/1995 (removed 1565) transitions.
// Phase 1: matrix 430 rows 200 cols
[2024-05-27 07:38:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:38:16] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-27 07:38:16] [INFO ] Invariant cache hit.
[2024-05-27 07:38:16] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-27 07:38:16] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2024-05-27 07:38:16] [INFO ] Redundant transitions in 21 ms returned []
Running 429 sub problems to find dead transitions.
[2024-05-27 07:38:16] [INFO ] Invariant cache hit.
[2024-05-27 07:38:16] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 430/630 variables, 200/202 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 255/457 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 7 (OVERLAPS) 0/630 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 429 unsolved
No progress, stopping.
After SMT solving in domain Real declared 630/630 variables, and 457 constraints, problems are : Problem set: 0 solved, 429 unsolved in 23359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 430/630 variables, 200/202 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 255/457 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 429/886 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-05-27 07:38:54] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
[2024-05-27 07:38:55] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
[2024-05-27 07:38:55] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 2 ms to minimize.
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
[2024-05-27 07:39:01] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
[2024-05-27 07:39:01] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
[2024-05-27 07:39:02] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
Problem TDEAD393 is UNSAT
[2024-05-27 07:39:02] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
[2024-05-27 07:39:02] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
[2024-05-27 07:39:02] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:39:02] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:39:02] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/630 variables, 11/897 constraints. Problems are: Problem set: 22 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/630 variables, and 897 constraints, problems are : Problem set: 22 solved, 407 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 200/200 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 11/11 constraints]
After SMT, in 54228ms problems are : Problem set: 22 solved, 407 unsolved
Search for dead transitions found 22 dead transitions in 54233ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 200/390 places, 408/1995 transitions.
Graph (complete) has 791 edges and 200 vertex of which 182 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.6 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 182 transition count 402
Applied a total of 7 rules in 33 ms. Remains 182 /200 variables (removed 18) and now considering 402/408 (removed 6) transitions.
// Phase 1: matrix 402 rows 182 cols
[2024-05-27 07:39:11] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 07:39:11] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-27 07:39:11] [INFO ] Invariant cache hit.
[2024-05-27 07:39:11] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-27 07:39:11] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 182/390 places, 402/1995 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 55791 ms. Remains : 182/390 places, 402/1995 transitions.
[2024-05-27 07:39:11] [INFO ] Flatten gal took : 12 ms
[2024-05-27 07:39:11] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:39:11] [INFO ] Input system was already deterministic with 402 transitions.
[2024-05-27 07:39:11] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:39:11] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:39:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3775102336931821177.gal : 2 ms
[2024-05-27 07:39:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9214629501699499647.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/CTLFireability3775102336931821177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9214629501699499647.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-27 07:39:41] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:39:41] [INFO ] Applying decomposition
[2024-05-27 07:39:41] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8990598596982942878.txt' '-o' '/tmp/graph8990598596982942878.bin' '-w' '/tmp/graph8990598596982942878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8990598596982942878.bin' '-l' '-1' '-v' '-w' '/tmp/graph8990598596982942878.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:39:42] [INFO ] Decomposing Gal with order
[2024-05-27 07:39:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:39:42] [INFO ] Removed a total of 304 redundant transitions.
[2024-05-27 07:39:42] [INFO ] Flatten gal took : 25 ms
[2024-05-27 07:39:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 193 labels/synchronizations in 8 ms.
[2024-05-27 07:39:42] [INFO ] Time to serialize gal into /tmp/CTLFireability10817543041513038769.gal : 4 ms
[2024-05-27 07:39:42] [INFO ] Time to serialize properties into /tmp/CTLFireability1186065351203846565.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/CTLFireability10817543041513038769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1186065351203846565.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.84519e+08,6.2386,148500,2265,1787,124532,49598,573,863896,480,365198,0


Converting to forward existential form...Done !
original formula: (EG(EF(AG((((u0.s1>=1)&&(u0.l3915>=1))||((u0.s1>=1)&&(u0.l3927>=1)))))) + (AG(((u0.s1>=1)&&(u0.l3919>=1))) * AF(((E((!(((u0.s1>=1)&&(u0.l...268
=> equivalent forward existential formula: ([(FwdU((Init * !(EG(E(TRUE U !(E(TRUE U !((((u0.s1>=1)&&(u0.l3915>=1))||((u0.s1>=1)&&(u0.l3927>=1)))))))))),TRU...465
Reverse transition relation is NOT exact ! Due to transitions t1, t45, t54, t55, t56, t57, t58, t103, t104, t105, t108, t120, t126, t130, t296, t298, t300,...1877
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 343 transition count 665
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 343 transition count 665
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 106 place count 343 transition count 653
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 172 place count 277 transition count 587
Iterating global reduction 1 with 66 rules applied. Total rules applied 238 place count 277 transition count 587
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 297 place count 277 transition count 528
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 405 place count 169 transition count 420
Iterating global reduction 2 with 108 rules applied. Total rules applied 513 place count 169 transition count 420
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 641 place count 169 transition count 292
Applied a total of 641 rules in 40 ms. Remains 169 /390 variables (removed 221) and now considering 292/1995 (removed 1703) transitions.
// Phase 1: matrix 292 rows 169 cols
[2024-05-27 07:40:12] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:40:12] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-27 07:40:12] [INFO ] Invariant cache hit.
[2024-05-27 07:40:12] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-27 07:40:12] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-05-27 07:40:12] [INFO ] Redundant transitions in 5 ms returned []
Running 291 sub problems to find dead transitions.
[2024-05-27 07:40:12] [INFO ] Invariant cache hit.
[2024-05-27 07:40:12] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 292/461 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 144/315 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 0/461 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 315 constraints, problems are : Problem set: 0 solved, 291 unsolved in 10963 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 292/461 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 144/315 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 291/606 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-27 07:40:30] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:40:31] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-27 07:40:31] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
[2024-05-27 07:40:34] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
[2024-05-27 07:40:34] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 0 ms to minimize.
[2024-05-27 07:40:34] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 6/612 constraints. Problems are: Problem set: 22 solved, 269 unsolved
[2024-05-27 07:40:41] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 1 ms to minimize.
[2024-05-27 07:40:42] [INFO ] Deduced a trap composed of 79 places in 41 ms of which 1 ms to minimize.
[2024-05-27 07:40:42] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 3/615 constraints. Problems are: Problem set: 22 solved, 269 unsolved
[2024-05-27 07:40:49] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 1/616 constraints. Problems are: Problem set: 22 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 616 constraints, problems are : Problem set: 22 solved, 269 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 10/10 constraints]
After SMT, in 41421ms problems are : Problem set: 22 solved, 269 unsolved
Search for dead transitions found 22 dead transitions in 41426ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 169/390 places, 270/1995 transitions.
Graph (complete) has 593 edges and 169 vertex of which 151 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 151 transition count 264
Applied a total of 7 rules in 9 ms. Remains 151 /169 variables (removed 18) and now considering 264/270 (removed 6) transitions.
// Phase 1: matrix 264 rows 151 cols
[2024-05-27 07:40:54] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:40:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 07:40:54] [INFO ] Invariant cache hit.
[2024-05-27 07:40:54] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-05-27 07:40:54] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 151/390 places, 264/1995 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 42457 ms. Remains : 151/390 places, 264/1995 transitions.
[2024-05-27 07:40:54] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:40:54] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:40:54] [INFO ] Input system was already deterministic with 264 transitions.
[2024-05-27 07:40:54] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:40:54] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:40:54] [INFO ] Time to serialize gal into /tmp/CTLFireability7613913703652117690.gal : 2 ms
[2024-05-27 07:40:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16202533409220675502.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/CTLFireability7613913703652117690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16202533409220675502.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.60264e+08,1.212,41608,2,9913,5,111888,6,0,868,89725,0


Converting to forward existential form...Done !
original formula: ((AG(EF(((s1<1)||(l3939<1)))) + AF(((s1>=1)&&(l3940>=1)))) + A(!(((s1>=1)&&(l195>=1))) U ((s1>=1)&&(l2754>=1))))
=> equivalent forward existential formula: [FwdG(((Init * !(!((E(!(((s1>=1)&&(l2754>=1))) U (!(!(((s1>=1)&&(l195>=1)))) * !(((s1>=1)&&(l2754>=1))))) + EG(!...270
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27,...1003
(forward)formula 0,1,11.2847,303912,1,0,507,961885,559,180,6209,811594,594
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 345 transition count 716
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 345 transition count 716
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 106 place count 345 transition count 700
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 169 place count 282 transition count 637
Iterating global reduction 1 with 63 rules applied. Total rules applied 232 place count 282 transition count 637
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 298 place count 282 transition count 571
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 402 place count 178 transition count 467
Iterating global reduction 2 with 104 rules applied. Total rules applied 506 place count 178 transition count 467
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 654 place count 178 transition count 319
Applied a total of 654 rules in 21 ms. Remains 178 /390 variables (removed 212) and now considering 319/1995 (removed 1676) transitions.
// Phase 1: matrix 319 rows 178 cols
[2024-05-27 07:41:06] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:41:06] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-27 07:41:06] [INFO ] Invariant cache hit.
[2024-05-27 07:41:06] [INFO ] State equation strengthened by 163 read => feed constraints.
[2024-05-27 07:41:06] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2024-05-27 07:41:06] [INFO ] Invariant cache hit.
[2024-05-27 07:41:06] [INFO ] State equation strengthened by 163 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 1/178 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 319/497 variables, 178/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 163/343 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 343 constraints, problems are : Problem set: 0 solved, 318 unsolved in 13151 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 178/178 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 1/178 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 319/497 variables, 178/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 163/343 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 318/661 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-05-27 07:41:28] [INFO ] Deduced a trap composed of 49 places in 31 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-05-27 07:41:29] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
[2024-05-27 07:41:29] [INFO ] Deduced a trap composed of 67 places in 43 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
[2024-05-27 07:41:32] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
[2024-05-27 07:41:32] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD282 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
[2024-05-27 07:41:32] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:41:33] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 7/668 constraints. Problems are: Problem set: 22 solved, 296 unsolved
[2024-05-27 07:41:44] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 1/669 constraints. Problems are: Problem set: 22 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 669 constraints, problems are : Problem set: 22 solved, 296 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 178/178 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 8/8 constraints]
After SMT, in 43687ms problems are : Problem set: 22 solved, 296 unsolved
Search for dead transitions found 22 dead transitions in 43692ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 178/390 places, 297/1995 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 160 transition count 291
Applied a total of 24 rules in 4 ms. Remains 160 /178 variables (removed 18) and now considering 291/297 (removed 6) transitions.
// Phase 1: matrix 291 rows 160 cols
[2024-05-27 07:41:50] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 07:41:50] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-27 07:41:50] [INFO ] Invariant cache hit.
[2024-05-27 07:41:50] [INFO ] State equation strengthened by 159 read => feed constraints.
[2024-05-27 07:41:50] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/390 places, 291/1995 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44669 ms. Remains : 160/390 places, 291/1995 transitions.
[2024-05-27 07:41:50] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:41:50] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:41:50] [INFO ] Input system was already deterministic with 291 transitions.
[2024-05-27 07:41:50] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:41:50] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:41:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3345940584418191663.gal : 2 ms
[2024-05-27 07:41:50] [INFO ] Time to serialize properties into /tmp/CTLFireability3885767788574792191.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/CTLFireability3345940584418191663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3885767788574792191.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.63679e+08,4.37127,119780,2,14152,5,254877,6,0,931,222075,0


Converting to forward existential form...Done !
original formula: AF(((EF(EX(TRUE)) * (s1>=1)) * ((l3910>=1) * ((!(A(((s1>=1)&&(l195>=1)) U ((s1>=1)&&(l3933>=1)))) + ((p894>=1)&&(l0>=1))) + (((l3929>=1)&...180
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U EX(TRUE)) * (s1>=1)) * ((l3910>=1) * ((!(!((E(!(((s1>=1)&&(l3933>=1))) U (!(((s1>=1)&&(l...302
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t11, t12, t21, t22, t23, t24, t25, t26, t27, t28, t29, t31, t32, t33, t34, t35, ...1104
Detected timeout of ITS tools.
[2024-05-27 07:42:20] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:42:20] [INFO ] Applying decomposition
[2024-05-27 07:42:20] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2308007787222771791.txt' '-o' '/tmp/graph2308007787222771791.bin' '-w' '/tmp/graph2308007787222771791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2308007787222771791.bin' '-l' '-1' '-v' '-w' '/tmp/graph2308007787222771791.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:42:20] [INFO ] Decomposing Gal with order
[2024-05-27 07:42:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:42:20] [INFO ] Removed a total of 252 redundant transitions.
[2024-05-27 07:42:20] [INFO ] Flatten gal took : 17 ms
[2024-05-27 07:42:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 164 labels/synchronizations in 6 ms.
[2024-05-27 07:42:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16711573227261680548.gal : 2 ms
[2024-05-27 07:42:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7855742495816679565.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/CTLFireability16711573227261680548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7855742495816679565.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.63679e+08,4.79577,136928,4282,2630,168077,37363,562,850483,330,148893,0


Converting to forward existential form...Done !
original formula: AF(((EF(EX(TRUE)) * (i2.u0.s1>=1)) * ((i2.u0.l3910>=1) * ((!(A(((i2.u0.s1>=1)&&(i2.u0.l195>=1)) U ((i2.u0.s1>=1)&&(i2.u0.l3933>=1)))) + (...246
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U EX(TRUE)) * (i2.u0.s1>=1)) * ((i2.u0.l3910>=1) * ((!(!((E(!(((i2.u0.s1>=1)&&(i2.u0.l3933...392
Reverse transition relation is NOT exact ! Due to transitions t1, t24, t25, t26, t27, t28, t29, t70, t71, t72, t75, t83, t87, t93, t98, t188, t190, t192, t...1543
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 343 transition count 713
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 343 transition count 713
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 109 place count 343 transition count 698
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 174 place count 278 transition count 633
Iterating global reduction 1 with 65 rules applied. Total rules applied 239 place count 278 transition count 633
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 308 place count 278 transition count 564
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 412 place count 174 transition count 460
Iterating global reduction 2 with 104 rules applied. Total rules applied 516 place count 174 transition count 460
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 2 with 156 rules applied. Total rules applied 672 place count 174 transition count 304
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 673 place count 173 transition count 291
Iterating global reduction 3 with 1 rules applied. Total rules applied 674 place count 173 transition count 291
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 675 place count 172 transition count 290
Iterating global reduction 3 with 1 rules applied. Total rules applied 676 place count 172 transition count 290
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 680 place count 168 transition count 286
Iterating global reduction 3 with 4 rules applied. Total rules applied 684 place count 168 transition count 286
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 708 place count 168 transition count 262
Applied a total of 708 rules in 32 ms. Remains 168 /390 variables (removed 222) and now considering 262/1995 (removed 1733) transitions.
// Phase 1: matrix 262 rows 168 cols
[2024-05-27 07:42:50] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:42:51] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-27 07:42:51] [INFO ] Invariant cache hit.
[2024-05-27 07:42:51] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-27 07:42:51] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-05-27 07:42:51] [INFO ] Redundant transitions in 4 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-27 07:42:51] [INFO ] Invariant cache hit.
[2024-05-27 07:42:51] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/430 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 115/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-27 07:42:55] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:42:56] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:42:56] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 3/288 constraints. Problems are: Problem set: 20 solved, 241 unsolved
[2024-05-27 07:43:00] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-27 07:43:01] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 2/290 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/290 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/290 constraints. Problems are: Problem set: 20 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 290 constraints, problems are : Problem set: 20 solved, 241 unsolved in 17932 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 20 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 2/2 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/3 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 8/160 variables, 1/4 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/4 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 262/422 variables, 160/164 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 115/279 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 41/320 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/320 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 8/430 variables, 8/328 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 200/528 constraints. Problems are: Problem set: 20 solved, 241 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 3/531 constraints. Problems are: Problem set: 20 solved, 241 unsolved
[2024-05-27 07:43:23] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2024-05-27 07:43:26] [INFO ] Deduced a trap composed of 57 places in 35 ms of which 1 ms to minimize.
[2024-05-27 07:43:26] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
[2024-05-27 07:43:26] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 0 ms to minimize.
Problem TDEAD225 is UNSAT
[2024-05-27 07:43:27] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 0 ms to minimize.
[2024-05-27 07:43:27] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 6/537 constraints. Problems are: Problem set: 22 solved, 239 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/537 constraints. Problems are: Problem set: 22 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 537 constraints, problems are : Problem set: 22 solved, 239 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 241/261 constraints, Known Traps: 11/11 constraints]
After SMT, in 48327ms problems are : Problem set: 22 solved, 239 unsolved
Search for dead transitions found 22 dead transitions in 48330ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 168/390 places, 240/1995 transitions.
Graph (complete) has 561 edges and 168 vertex of which 150 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 150 transition count 234
Applied a total of 7 rules in 8 ms. Remains 150 /168 variables (removed 18) and now considering 234/240 (removed 6) transitions.
// Phase 1: matrix 234 rows 150 cols
[2024-05-27 07:43:39] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:43:39] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 07:43:39] [INFO ] Invariant cache hit.
[2024-05-27 07:43:39] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 07:43:40] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 150/390 places, 234/1995 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 49334 ms. Remains : 150/390 places, 234/1995 transitions.
[2024-05-27 07:43:40] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:43:40] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:43:40] [INFO ] Input system was already deterministic with 234 transitions.
[2024-05-27 07:43:40] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:43:40] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:43:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4315971531205306685.gal : 1 ms
[2024-05-27 07:43:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9311556168075561406.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/CTLFireability4315971531205306685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9311556168075561406.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.28117e+08,2.82653,81328,2,11835,5,193329,6,0,834,172153,0


Converting to forward existential form...Done !
original formula: A(((s1>=1)&&(l3927>=1)) U AG(E(((s1>=1)&&(l3929>=1)) U AF(((s1>=1)&&(l3931>=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(((s1>=1)&&(l3929>=1)) U !(EG(!(((s1>=1)&&(l3931>=1))))))))))))) * !(E(!(!(E(TRUE...344
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t30, t31, t32, t33, t34, t35, t36, t37, t38,...812
(forward)formula 0,0,19.358,496788,1,0,605,2.21752e+06,502,244,5907,1.6681e+06,714
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 351 transition count 1052
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 351 transition count 1052
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 98 place count 351 transition count 1032
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 156 place count 293 transition count 974
Iterating global reduction 1 with 58 rules applied. Total rules applied 214 place count 293 transition count 974
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 353 place count 293 transition count 835
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 429 place count 217 transition count 759
Iterating global reduction 2 with 76 rules applied. Total rules applied 505 place count 217 transition count 759
Ensure Unique test removed 220 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 2 with 220 rules applied. Total rules applied 725 place count 217 transition count 539
Applied a total of 725 rules in 19 ms. Remains 217 /390 variables (removed 173) and now considering 539/1995 (removed 1456) transitions.
// Phase 1: matrix 539 rows 217 cols
[2024-05-27 07:43:59] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 07:43:59] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 07:43:59] [INFO ] Invariant cache hit.
[2024-05-27 07:44:00] [INFO ] State equation strengthened by 351 read => feed constraints.
[2024-05-27 07:44:00] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Running 538 sub problems to find dead transitions.
[2024-05-27 07:44:00] [INFO ] Invariant cache hit.
[2024-05-27 07:44:00] [INFO ] State equation strengthened by 351 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 4 (OVERLAPS) 539/756 variables, 217/219 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/756 variables, 351/570 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 7 (OVERLAPS) 0/756 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 538 unsolved
No progress, stopping.
After SMT solving in domain Real declared 756/756 variables, and 570 constraints, problems are : Problem set: 0 solved, 538 unsolved in 29015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, ReadFeed: 351/351 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 538 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 4 (OVERLAPS) 539/756 variables, 217/219 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/756 variables, 351/570 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 538/1108 constraints. Problems are: Problem set: 0 solved, 538 unsolved
[2024-05-27 07:44:53] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-27 07:44:53] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
[2024-05-27 07:44:53] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:44:53] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 756/756 variables, and 1112 constraints, problems are : Problem set: 12 solved, 526 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, ReadFeed: 351/351 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 4/4 constraints]
After SMT, in 60314ms problems are : Problem set: 12 solved, 526 unsolved
Search for dead transitions found 12 dead transitions in 60322ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 217/390 places, 527/1995 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 209 transition count 527
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 205 transition count 523
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 205 transition count 523
Applied a total of 16 rules in 5 ms. Remains 205 /217 variables (removed 12) and now considering 523/527 (removed 4) transitions.
// Phase 1: matrix 523 rows 205 cols
[2024-05-27 07:45:01] [INFO ] Computed 1 invariants in 3 ms
[2024-05-27 07:45:01] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-27 07:45:01] [INFO ] Invariant cache hit.
[2024-05-27 07:45:01] [INFO ] State equation strengthened by 347 read => feed constraints.
[2024-05-27 07:45:02] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 205/390 places, 523/1995 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62357 ms. Remains : 205/390 places, 523/1995 transitions.
[2024-05-27 07:45:02] [INFO ] Flatten gal took : 12 ms
[2024-05-27 07:45:02] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:45:02] [INFO ] Input system was already deterministic with 523 transitions.
[2024-05-27 07:45:02] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:45:02] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:45:02] [INFO ] Time to serialize gal into /tmp/CTLFireability4079190842016344893.gal : 2 ms
[2024-05-27 07:45:02] [INFO ] Time to serialize properties into /tmp/CTLFireability3254119249496182276.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/CTLFireability4079190842016344893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3254119249496182276.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-27 07:45:32] [INFO ] Flatten gal took : 13 ms
[2024-05-27 07:45:32] [INFO ] Applying decomposition
[2024-05-27 07:45:32] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4049479204911907041.txt' '-o' '/tmp/graph4049479204911907041.bin' '-w' '/tmp/graph4049479204911907041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4049479204911907041.bin' '-l' '-1' '-v' '-w' '/tmp/graph4049479204911907041.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:45:32] [INFO ] Decomposing Gal with order
[2024-05-27 07:45:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:45:32] [INFO ] Removed a total of 534 redundant transitions.
[2024-05-27 07:45:32] [INFO ] Flatten gal took : 29 ms
[2024-05-27 07:45:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 353 labels/synchronizations in 12 ms.
[2024-05-27 07:45:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11303275120041078832.gal : 3 ms
[2024-05-27 07:45:32] [INFO ] Time to serialize properties into /tmp/CTLFireability8337136199693144391.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/CTLFireability11303275120041078832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8337136199693144391.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.28835e+08,20.3127,450196,3535,3633,266725,112597,722,3.35165e+06,497,1.76585e+06,0


Converting to forward existential form...Done !
original formula: A(!(EX(E(((u0.s1>=1)&&(u0.l3921>=1)) U ((u0.s1>=1)&&(u0.l3921>=1))))) U EF(((!((!(((u0.s1>=1)&&(u10.l3296>=1))) * EF(((u0.s1>=1)&&(u10.l3...434
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((!((!(((u0.s1>=1)&&(u10.l3296>=1))) * E(TRUE U ((u0.s1>=1)&&(u10.l3918>=1))))) * ((EG...1305
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t26, t27, t28, t29, t48, t50, t51, t52, t53, t54, t99, t108, t109, t110, t113, t135...1820
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 343 transition count 667
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 343 transition count 667
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 108 place count 343 transition count 653
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 174 place count 277 transition count 587
Iterating global reduction 1 with 66 rules applied. Total rules applied 240 place count 277 transition count 587
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 299 place count 277 transition count 528
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 407 place count 169 transition count 420
Iterating global reduction 2 with 108 rules applied. Total rules applied 515 place count 169 transition count 420
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 651 place count 169 transition count 284
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 652 place count 168 transition count 271
Iterating global reduction 3 with 1 rules applied. Total rules applied 653 place count 168 transition count 271
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 654 place count 167 transition count 270
Iterating global reduction 3 with 1 rules applied. Total rules applied 655 place count 167 transition count 270
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 659 place count 163 transition count 266
Iterating global reduction 3 with 4 rules applied. Total rules applied 663 place count 163 transition count 266
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 683 place count 163 transition count 246
Applied a total of 683 rules in 25 ms. Remains 163 /390 variables (removed 227) and now considering 246/1995 (removed 1749) transitions.
// Phase 1: matrix 246 rows 163 cols
[2024-05-27 07:46:02] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:46:02] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 07:46:02] [INFO ] Invariant cache hit.
[2024-05-27 07:46:02] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-27 07:46:02] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2024-05-27 07:46:02] [INFO ] Invariant cache hit.
[2024-05-27 07:46:02] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/409 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 103/268 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (OVERLAPS) 0/409 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 268 constraints, problems are : Problem set: 0 solved, 245 unsolved in 8565 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/409 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 103/268 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 245/513 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-27 07:46:16] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-27 07:46:17] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
[2024-05-27 07:46:17] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
[2024-05-27 07:46:19] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
[2024-05-27 07:46:19] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
[2024-05-27 07:46:19] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-05-27 07:46:19] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 7/520 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/520 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/409 variables, 0/520 constraints. Problems are: Problem set: 22 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 520 constraints, problems are : Problem set: 22 solved, 223 unsolved in 23628 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 7/7 constraints]
After SMT, in 32607ms problems are : Problem set: 22 solved, 223 unsolved
Search for dead transitions found 22 dead transitions in 32612ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 163/390 places, 224/1995 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 145 transition count 218
Applied a total of 24 rules in 5 ms. Remains 145 /163 variables (removed 18) and now considering 218/224 (removed 6) transitions.
// Phase 1: matrix 218 rows 145 cols
[2024-05-27 07:46:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:46:35] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-27 07:46:35] [INFO ] Invariant cache hit.
[2024-05-27 07:46:35] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-27 07:46:35] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 145/390 places, 218/1995 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33451 ms. Remains : 145/390 places, 218/1995 transitions.
[2024-05-27 07:46:35] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:46:35] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:46:35] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-27 07:46:35] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:46:35] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:46:35] [INFO ] Time to serialize gal into /tmp/CTLFireability16564727105154353557.gal : 1 ms
[2024-05-27 07:46:35] [INFO ] Time to serialize properties into /tmp/CTLFireability18044671477065295685.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/CTLFireability16564727105154353557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18044671477065295685.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28116e+08,0.847285,32688,2,8263,5,91800,6,0,798,68527,0


Converting to forward existential form...Done !
original formula: AF(AX((A(((s1>=1)&&(l3218>=1)) U ((s1>=1)&&(l3911>=1))) * (EG(((s1>=1)&&(l192>=1))) + EX(((s1>=1)&&(l3933>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((!((E(!(((s1>=1)&&(l3911>=1))) U (!(((s1>=1)&&(l3218>=1))) * !(((s1>=1)&&(l3911>=1))))) + EG...255
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t27, t28, t29, t30, t31, t32, t33, t34, t35,...752
(forward)formula 0,0,16.2382,439348,1,0,804,1.9034e+06,473,384,5528,1.64999e+06,834
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 345 transition count 810
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 345 transition count 810
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 108 place count 345 transition count 792
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 171 place count 282 transition count 729
Iterating global reduction 1 with 63 rules applied. Total rules applied 234 place count 282 transition count 729
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 323 place count 282 transition count 640
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 419 place count 186 transition count 544
Iterating global reduction 2 with 96 rules applied. Total rules applied 515 place count 186 transition count 544
Ensure Unique test removed 184 transitions
Reduce isomorphic transitions removed 184 transitions.
Iterating post reduction 2 with 184 rules applied. Total rules applied 699 place count 186 transition count 360
Applied a total of 699 rules in 13 ms. Remains 186 /390 variables (removed 204) and now considering 360/1995 (removed 1635) transitions.
// Phase 1: matrix 360 rows 186 cols
[2024-05-27 07:46:52] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:46:52] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-27 07:46:52] [INFO ] Invariant cache hit.
[2024-05-27 07:46:52] [INFO ] State equation strengthened by 198 read => feed constraints.
[2024-05-27 07:46:53] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 359 sub problems to find dead transitions.
[2024-05-27 07:46:53] [INFO ] Invariant cache hit.
[2024-05-27 07:46:53] [INFO ] State equation strengthened by 198 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (OVERLAPS) 360/546 variables, 186/188 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 198/386 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-05-27 07:47:01] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-05-27 07:47:10] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/546 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 359 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 388 constraints, problems are : Problem set: 0 solved, 359 unsolved in 28152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, ReadFeed: 198/198 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (OVERLAPS) 1/186 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (OVERLAPS) 360/546 variables, 186/190 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 198/388 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 359/747 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-05-27 07:47:32] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
[2024-05-27 07:47:32] [INFO ] Deduced a trap composed of 68 places in 38 ms of which 1 ms to minimize.
[2024-05-27 07:47:32] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
[2024-05-27 07:47:32] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
[2024-05-27 07:47:37] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
Problem TDEAD323 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
[2024-05-27 07:47:37] [INFO ] Deduced a trap composed of 65 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 6/753 constraints. Problems are: Problem set: 22 solved, 337 unsolved
[2024-05-27 07:47:49] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:47:50] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:47:50] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 3/756 constraints. Problems are: Problem set: 22 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 756 constraints, problems are : Problem set: 22 solved, 337 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, ReadFeed: 198/198 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 11/11 constraints]
After SMT, in 58790ms problems are : Problem set: 22 solved, 337 unsolved
Search for dead transitions found 22 dead transitions in 58797ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 186/390 places, 338/1995 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 168 transition count 332
Applied a total of 24 rules in 1 ms. Remains 168 /186 variables (removed 18) and now considering 332/338 (removed 6) transitions.
// Phase 1: matrix 332 rows 168 cols
[2024-05-27 07:47:51] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:47:51] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 07:47:51] [INFO ] Invariant cache hit.
[2024-05-27 07:47:52] [INFO ] State equation strengthened by 194 read => feed constraints.
[2024-05-27 07:47:52] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 168/390 places, 332/1995 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60054 ms. Remains : 168/390 places, 332/1995 transitions.
[2024-05-27 07:47:52] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:47:52] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:47:52] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-27 07:47:52] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:47:52] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:47:52] [INFO ] Time to serialize gal into /tmp/CTLFireability11892784322636265454.gal : 2 ms
[2024-05-27 07:47:52] [INFO ] Time to serialize properties into /tmp/CTLFireability10722802366366295171.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/CTLFireability11892784322636265454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10722802366366295171.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.60265e+08,18.7025,454956,2,14388,5,995539,6,0,1004,626152,0


Converting to forward existential form...Done !
original formula: AX((AF(((s1>=1)&&(l3928>=1))) * ((AF(((s1<1)||(l3929<1))) + E(((s1>=1)&&(l3921>=1)) U !(((s1<1)||(l3939<1))))) + AF(((s1>=1)&&(l3925>=1))...159
=> equivalent forward existential formula: ([FwdG(EY(Init),!(((s1>=1)&&(l3928>=1))))] = FALSE * [FwdG((EY(Init) * !((!(EG(!(((s1<1)||(l3929<1))))) + E(((s1...237
Reverse transition relation is NOT exact ! Due to transitions t1, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38,...1282
Detected timeout of ITS tools.
[2024-05-27 07:48:22] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:48:22] [INFO ] Applying decomposition
[2024-05-27 07:48:22] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1065043335071980696.txt' '-o' '/tmp/graph1065043335071980696.bin' '-w' '/tmp/graph1065043335071980696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1065043335071980696.bin' '-l' '-1' '-v' '-w' '/tmp/graph1065043335071980696.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:48:22] [INFO ] Decomposing Gal with order
[2024-05-27 07:48:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:48:22] [INFO ] Removed a total of 305 redundant transitions.
[2024-05-27 07:48:22] [INFO ] Flatten gal took : 16 ms
[2024-05-27 07:48:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 5 ms.
[2024-05-27 07:48:22] [INFO ] Time to serialize gal into /tmp/CTLFireability5659667632151701429.gal : 2 ms
[2024-05-27 07:48:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17658704954505110717.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/CTLFireability5659667632151701429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17658704954505110717.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.60265e+08,2.33577,84040,2123,2206,66130,26072,589,508222,353,398785,0


Converting to forward existential form...Done !
original formula: AX((AF(((i3.u0.s1>=1)&&(i3.u0.l3928>=1))) * ((AF(((i3.u0.s1<1)||(i3.u0.l3929<1))) + E(((i3.u0.s1>=1)&&(i3.u0.l3921>=1)) U !(((i3.u0.s1<1)...219
=> equivalent forward existential formula: ([FwdG(EY(Init),!(((i3.u0.s1>=1)&&(i3.u0.l3928>=1))))] = FALSE * [FwdG((EY(Init) * !((!(EG(!(((i3.u0.s1<1)||(i3....297
Reverse transition relation is NOT exact ! Due to transitions t1, t27, t29, t30, t31, t32, t33, t83, t84, t85, t88, t97, t100, t106, t111, t229, t231, t233...1817
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 342 transition count 618
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 342 transition count 618
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 109 place count 342 transition count 605
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 175 place count 276 transition count 539
Iterating global reduction 1 with 66 rules applied. Total rules applied 241 place count 276 transition count 539
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 289 place count 276 transition count 491
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 401 place count 164 transition count 379
Iterating global reduction 2 with 112 rules applied. Total rules applied 513 place count 164 transition count 379
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 625 place count 164 transition count 267
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 626 place count 163 transition count 254
Iterating global reduction 3 with 1 rules applied. Total rules applied 627 place count 163 transition count 254
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 628 place count 162 transition count 253
Iterating global reduction 3 with 1 rules applied. Total rules applied 629 place count 162 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 630 place count 162 transition count 252
Applied a total of 630 rules in 21 ms. Remains 162 /390 variables (removed 228) and now considering 252/1995 (removed 1743) transitions.
// Phase 1: matrix 252 rows 162 cols
[2024-05-27 07:48:52] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:48:52] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 07:48:52] [INFO ] Invariant cache hit.
[2024-05-27 07:48:52] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-05-27 07:48:52] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-05-27 07:48:53] [INFO ] Invariant cache hit.
[2024-05-27 07:48:53] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 252/414 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 109/273 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 0/414 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 273 constraints, problems are : Problem set: 0 solved, 251 unsolved in 7759 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 252/414 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 109/273 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 251/524 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-27 07:49:05] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
[2024-05-27 07:49:06] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-27 07:49:06] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
[2024-05-27 07:49:09] [INFO ] Deduced a trap composed of 58 places in 39 ms of which 0 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
[2024-05-27 07:49:09] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
[2024-05-27 07:49:09] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-05-27 07:49:09] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-27 07:49:09] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 8/532 constraints. Problems are: Problem set: 22 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/532 constraints. Problems are: Problem set: 22 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 0/414 variables, 0/532 constraints. Problems are: Problem set: 22 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 532 constraints, problems are : Problem set: 22 solved, 229 unsolved in 27109 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 8/8 constraints]
After SMT, in 35226ms problems are : Problem set: 22 solved, 229 unsolved
Search for dead transitions found 22 dead transitions in 35230ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 162/390 places, 230/1995 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 144 transition count 224
Applied a total of 24 rules in 1 ms. Remains 144 /162 variables (removed 18) and now considering 224/230 (removed 6) transitions.
// Phase 1: matrix 224 rows 144 cols
[2024-05-27 07:49:28] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:49:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-27 07:49:28] [INFO ] Invariant cache hit.
[2024-05-27 07:49:28] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-05-27 07:49:28] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 144/390 places, 224/1995 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35921 ms. Remains : 144/390 places, 224/1995 transitions.
[2024-05-27 07:49:28] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:49:28] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:49:28] [INFO ] Input system was already deterministic with 224 transitions.
[2024-05-27 07:49:28] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:49:28] [INFO ] Flatten gal took : 4 ms
[2024-05-27 07:49:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12862371634116810963.gal : 1 ms
[2024-05-27 07:49:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7544437789679844239.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/CTLFireability12862371634116810963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7544437789679844239.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.63678e+08,1.47865,48480,2,10327,5,123071,6,0,800,111547,0


Converting to forward existential form...Done !
original formula: AG((AF(((s1<1)||(l3910<1))) + AX(((p775<1)||(l0<1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(!(EG(!(((s1<1)||(l3910<1)))))))) * !(((p775<1)||(l0<1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t37, t38, t39, t42, t51, t5...809
(forward)formula 0,1,12.213,298952,1,0,527,1.01641e+06,473,200,5654,876093,616
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 341 transition count 617
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 341 transition count 617
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 111 place count 341 transition count 604
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 178 place count 274 transition count 537
Iterating global reduction 1 with 67 rules applied. Total rules applied 245 place count 274 transition count 537
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 294 place count 274 transition count 488
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 406 place count 162 transition count 376
Iterating global reduction 2 with 112 rules applied. Total rules applied 518 place count 162 transition count 376
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 634 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 636 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 638 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 639 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 640 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 644 place count 155 transition count 229
Iterating global reduction 3 with 4 rules applied. Total rules applied 648 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 660 place count 155 transition count 217
Applied a total of 660 rules in 22 ms. Remains 155 /390 variables (removed 235) and now considering 217/1995 (removed 1778) transitions.
// Phase 1: matrix 217 rows 155 cols
[2024-05-27 07:49:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:49:41] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 07:49:41] [INFO ] Invariant cache hit.
[2024-05-27 07:49:41] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-27 07:49:41] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-27 07:49:41] [INFO ] Invariant cache hit.
[2024-05-27 07:49:41] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-27 07:49:47] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-27 07:49:47] [INFO ] Deduced a trap composed of 61 places in 37 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-27 07:49:47] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
At refinement iteration 7 (OVERLAPS) 0/372 variables, 3/240 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/240 constraints. Problems are: Problem set: 21 solved, 195 unsolved
[2024-05-27 07:49:50] [INFO ] Deduced a trap composed of 69 places in 39 ms of which 1 ms to minimize.
[2024-05-27 07:49:50] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-27 07:49:51] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/372 variables, 3/243 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/243 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/243 constraints. Problems are: Problem set: 21 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 243 constraints, problems are : Problem set: 21 solved, 195 unsolved in 14577 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 21 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 2/2 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/3 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/3 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 8/146 variables, 1/4 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 217/363 variables, 146/150 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 80/230 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 40/270 constraints. Problems are: Problem set: 21 solved, 195 unsolved
[2024-05-27 07:50:00] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 1/271 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/271 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 11 (OVERLAPS) 9/372 variables, 9/280 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 155/435 constraints. Problems are: Problem set: 21 solved, 195 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 4/439 constraints. Problems are: Problem set: 21 solved, 195 unsolved
[2024-05-27 07:50:09] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 1/440 constraints. Problems are: Problem set: 22 solved, 194 unsolved
[2024-05-27 07:50:17] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:50:18] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:50:18] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 3/443 constraints. Problems are: Problem set: 22 solved, 194 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 0/443 constraints. Problems are: Problem set: 22 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 443 constraints, problems are : Problem set: 22 solved, 194 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 195/216 constraints, Known Traps: 11/11 constraints]
After SMT, in 44867ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 44870ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/390 places, 195/1995 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 137 transition count 189
Applied a total of 24 rules in 2 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 07:50:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:50:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-27 07:50:26] [INFO ] Invariant cache hit.
[2024-05-27 07:50:26] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 07:50:26] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/390 places, 189/1995 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45574 ms. Remains : 137/390 places, 189/1995 transitions.
[2024-05-27 07:50:26] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:50:26] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:50:26] [INFO ] Input system was already deterministic with 189 transitions.
[2024-05-27 07:50:26] [INFO ] Flatten gal took : 4 ms
[2024-05-27 07:50:26] [INFO ] Flatten gal took : 4 ms
[2024-05-27 07:50:26] [INFO ] Time to serialize gal into /tmp/CTLFireability16066172866535021458.gal : 1 ms
[2024-05-27 07:50:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13465746128125233447.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/CTLFireability16066172866535021458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13465746128125233447.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28116e+08,1.75399,58416,2,12261,5,132506,6,0,737,129101,0


Converting to forward existential form...Done !
original formula: EX(EF(((s1>=1)&&(l3927>=1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((s1>=1)&&(l3927>=1)))] != FALSE
(forward)formula 0,1,2.94778,60000,1,0,9,132797,9,1,1551,129148,4
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 343 transition count 666
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 343 transition count 666
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 107 place count 343 transition count 653
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 173 place count 277 transition count 587
Iterating global reduction 1 with 66 rules applied. Total rules applied 239 place count 277 transition count 587
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 298 place count 277 transition count 528
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 406 place count 169 transition count 420
Iterating global reduction 2 with 108 rules applied. Total rules applied 514 place count 169 transition count 420
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 646 place count 169 transition count 288
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 647 place count 168 transition count 275
Iterating global reduction 3 with 1 rules applied. Total rules applied 648 place count 168 transition count 275
Applied a total of 648 rules in 33 ms. Remains 168 /390 variables (removed 222) and now considering 275/1995 (removed 1720) transitions.
// Phase 1: matrix 275 rows 168 cols
[2024-05-27 07:50:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:50:29] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 07:50:29] [INFO ] Invariant cache hit.
[2024-05-27 07:50:29] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-27 07:50:30] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-27 07:50:30] [INFO ] Redundant transitions in 2 ms returned []
Running 274 sub problems to find dead transitions.
[2024-05-27 07:50:30] [INFO ] Invariant cache hit.
[2024-05-27 07:50:30] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/443 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 127/297 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-27 07:50:35] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-27 07:50:40] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-27 07:50:40] [INFO ] Deduced a trap composed of 68 places in 42 ms of which 1 ms to minimize.
[2024-05-27 07:50:40] [INFO ] Deduced a trap composed of 61 places in 38 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/443 variables, 3/301 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/301 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 10 (OVERLAPS) 0/443 variables, 0/301 constraints. Problems are: Problem set: 20 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 301 constraints, problems are : Problem set: 20 solved, 254 unsolved in 19614 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 20 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 8/160 variables, 1/3 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 275/435 variables, 160/163 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 127/290 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 41/331 constraints. Problems are: Problem set: 20 solved, 254 unsolved
[2024-05-27 07:50:56] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 1/332 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/332 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 11 (OVERLAPS) 8/443 variables, 8/340 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 213/553 constraints. Problems are: Problem set: 20 solved, 254 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 3/556 constraints. Problems are: Problem set: 20 solved, 254 unsolved
[2024-05-27 07:51:12] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-05-27 07:51:12] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:51:14] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 0 ms to minimize.
Problem TDEAD234 is UNSAT
Problem TDEAD238 is UNSAT
[2024-05-27 07:51:15] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:51:15] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 5/561 constraints. Problems are: Problem set: 22 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/443 variables, and 561 constraints, problems are : Problem set: 22 solved, 252 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 254/274 constraints, Known Traps: 10/10 constraints]
After SMT, in 50041ms problems are : Problem set: 22 solved, 252 unsolved
Search for dead transitions found 22 dead transitions in 50045ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 168/390 places, 253/1995 transitions.
Graph (complete) has 576 edges and 168 vertex of which 150 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 150 transition count 247
Applied a total of 7 rules in 6 ms. Remains 150 /168 variables (removed 18) and now considering 247/253 (removed 6) transitions.
// Phase 1: matrix 247 rows 150 cols
[2024-05-27 07:51:20] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:51:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 07:51:20] [INFO ] Invariant cache hit.
[2024-05-27 07:51:20] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-27 07:51:20] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 150/390 places, 247/1995 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 50973 ms. Remains : 150/390 places, 247/1995 transitions.
[2024-05-27 07:51:20] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:51:20] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:51:20] [INFO ] Input system was already deterministic with 247 transitions.
[2024-05-27 07:51:20] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:51:20] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:51:20] [INFO ] Time to serialize gal into /tmp/CTLFireability9157897328154325901.gal : 3 ms
[2024-05-27 07:51:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9884395076700666454.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/CTLFireability9157897328154325901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9884395076700666454.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.60264e+08,1.21563,41400,2,9963,5,113961,6,0,847,85797,0


Converting to forward existential form...Done !
original formula: AF(EG(E(!(AF(((s1>=1)&&(l3921>=1)))) U A(((s1>=1)&&(l3405>=1)) U EG(((s1>=1)&&(l3918>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(!(!(EG(!(((s1>=1)&&(l3921>=1)))))) U !((E(!(EG(((s1>=1)&&(l3918>=1)))) U (!(((s1>=1)&&(l3405>=...242
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t20, t21, t22, t23, t24, t25, t26, t35, t36, t37, t38, t39,...865
(forward)formula 0,0,17.9465,478456,1,0,795,2.06039e+06,540,326,6296,1.57559e+06,945
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 348 transition count 814
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 348 transition count 814
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 100 place count 348 transition count 798
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 163 place count 285 transition count 735
Iterating global reduction 1 with 63 rules applied. Total rules applied 226 place count 285 transition count 735
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 315 place count 285 transition count 646
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 411 place count 189 transition count 550
Iterating global reduction 2 with 96 rules applied. Total rules applied 507 place count 189 transition count 550
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Iterating post reduction 2 with 164 rules applied. Total rules applied 671 place count 189 transition count 386
Applied a total of 671 rules in 18 ms. Remains 189 /390 variables (removed 201) and now considering 386/1995 (removed 1609) transitions.
// Phase 1: matrix 386 rows 189 cols
[2024-05-27 07:51:38] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 07:51:38] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-27 07:51:38] [INFO ] Invariant cache hit.
[2024-05-27 07:51:38] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-05-27 07:51:39] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 385 sub problems to find dead transitions.
[2024-05-27 07:51:39] [INFO ] Invariant cache hit.
[2024-05-27 07:51:39] [INFO ] State equation strengthened by 222 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 4 (OVERLAPS) 386/575 variables, 189/191 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 222/413 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-27 07:51:49] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-27 07:51:57] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
[2024-05-27 07:51:57] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
[2024-05-27 07:51:59] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/575 variables, 3/417 constraints. Problems are: Problem set: 20 solved, 365 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/575 variables, 0/417 constraints. Problems are: Problem set: 20 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 575/575 variables, and 417 constraints, problems are : Problem set: 20 solved, 365 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 20 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 2/2 constraints. Problems are: Problem set: 20 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/173 variables, 1/3 constraints. Problems are: Problem set: 20 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 20 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 8/181 variables, 1/4 constraints. Problems are: Problem set: 20 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/4 constraints. Problems are: Problem set: 20 solved, 365 unsolved
At refinement iteration 6 (OVERLAPS) 386/567 variables, 181/185 constraints. Problems are: Problem set: 20 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 222/407 constraints. Problems are: Problem set: 20 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 41/448 constraints. Problems are: Problem set: 20 solved, 365 unsolved
[2024-05-27 07:52:21] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 1/449 constraints. Problems are: Problem set: 20 solved, 365 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/449 constraints. Problems are: Problem set: 20 solved, 365 unsolved
At refinement iteration 11 (OVERLAPS) 8/575 variables, 8/457 constraints. Problems are: Problem set: 20 solved, 365 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/575 variables, 324/781 constraints. Problems are: Problem set: 20 solved, 365 unsolved
SMT process timed out in 60808ms, After SMT, problems are : Problem set: 20 solved, 365 unsolved
Search for dead transitions found 20 dead transitions in 60813ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/390 places, 366/1995 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 173 transition count 362
Applied a total of 20 rules in 2 ms. Remains 173 /189 variables (removed 16) and now considering 362/366 (removed 4) transitions.
// Phase 1: matrix 362 rows 173 cols
[2024-05-27 07:52:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:52:40] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-27 07:52:40] [INFO ] Invariant cache hit.
[2024-05-27 07:52:40] [INFO ] State equation strengthened by 218 read => feed constraints.
[2024-05-27 07:52:40] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 173/390 places, 362/1995 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62067 ms. Remains : 173/390 places, 362/1995 transitions.
[2024-05-27 07:52:40] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:52:40] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:52:40] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-27 07:52:40] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:52:40] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:52:40] [INFO ] Time to serialize gal into /tmp/CTLFireability13040866764809067591.gal : 2 ms
[2024-05-27 07:52:40] [INFO ] Time to serialize properties into /tmp/CTLFireability3817461153378347606.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/CTLFireability13040866764809067591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3817461153378347606.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.916e+08,13.2932,302508,2,12482,5,725986,6,0,1054,517040,0


Converting to forward existential form...Done !
original formula: !(A(A(((EX(((s1>=1)&&(l5550>=1))) + (AX(((s1>=1)&&(l2875>=1))) * !(((s1>=1)&&(l3931>=1))))) + !(((s1>=1)&&(l3911>=1)))) U AG(EX(((s1>=1)&...257
=> equivalent forward existential formula: ([((FwdU(Init,!(EX(((!(!((E(!(((s1>=1)&&(l3060>=1))) U (!(((s1>=1)&&(l3910>=1))) * !(((s1>=1)&&(l3060>=1))))) + ...850
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t32, t33, t34, t35, t36,...1411
Detected timeout of ITS tools.
[2024-05-27 07:53:10] [INFO ] Flatten gal took : 15 ms
[2024-05-27 07:53:10] [INFO ] Applying decomposition
[2024-05-27 07:53:10] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7887966802091010280.txt' '-o' '/tmp/graph7887966802091010280.bin' '-w' '/tmp/graph7887966802091010280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7887966802091010280.bin' '-l' '-1' '-v' '-w' '/tmp/graph7887966802091010280.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:53:10] [INFO ] Decomposing Gal with order
[2024-05-27 07:53:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:53:10] [INFO ] Removed a total of 468 redundant transitions.
[2024-05-27 07:53:10] [INFO ] Flatten gal took : 20 ms
[2024-05-27 07:53:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 334 labels/synchronizations in 8 ms.
[2024-05-27 07:53:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3414390658258588264.gal : 2 ms
[2024-05-27 07:53:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6628835281929347936.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/CTLFireability3414390658258588264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6628835281929347936.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 390/390 places, 1995/1995 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 341 transition count 617
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 341 transition count 617
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 111 place count 341 transition count 604
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 178 place count 274 transition count 537
Iterating global reduction 1 with 67 rules applied. Total rules applied 245 place count 274 transition count 537
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 294 place count 274 transition count 488
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 406 place count 162 transition count 376
Iterating global reduction 2 with 112 rules applied. Total rules applied 518 place count 162 transition count 376
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 634 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 636 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 638 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 639 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 640 place count 159 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 641 place count 159 transition count 232
Applied a total of 641 rules in 31 ms. Remains 159 /390 variables (removed 231) and now considering 232/1995 (removed 1763) transitions.
// Phase 1: matrix 232 rows 159 cols
[2024-05-27 07:53:40] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:53:41] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-27 07:53:41] [INFO ] Invariant cache hit.
[2024-05-27 07:53:41] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-27 07:53:41] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-27 07:53:41] [INFO ] Redundant transitions in 0 ms returned []
Running 231 sub problems to find dead transitions.
[2024-05-27 07:53:41] [INFO ] Invariant cache hit.
[2024-05-27 07:53:41] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/391 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/391 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 252 constraints, problems are : Problem set: 0 solved, 231 unsolved in 7240 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/391 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 231/483 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-27 07:53:53] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-27 07:53:53] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-27 07:53:53] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
[2024-05-27 07:53:55] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 0 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
[2024-05-27 07:53:55] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-05-27 07:53:56] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:53:56] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 7/490 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/490 constraints. Problems are: Problem set: 22 solved, 209 unsolved
[2024-05-27 07:54:06] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/391 variables, 1/491 constraints. Problems are: Problem set: 22 solved, 209 unsolved
[2024-05-27 07:54:12] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-05-27 07:54:13] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 2/493 constraints. Problems are: Problem set: 22 solved, 209 unsolved
[2024-05-27 07:54:18] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 1/494 constraints. Problems are: Problem set: 22 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/391 variables, and 494 constraints, problems are : Problem set: 22 solved, 209 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 11/11 constraints]
After SMT, in 37574ms problems are : Problem set: 22 solved, 209 unsolved
Search for dead transitions found 22 dead transitions in 37577ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 159/390 places, 210/1995 transitions.
Graph (complete) has 517 edges and 159 vertex of which 141 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 141 transition count 204
Applied a total of 7 rules in 7 ms. Remains 141 /159 variables (removed 18) and now considering 204/210 (removed 6) transitions.
// Phase 1: matrix 204 rows 141 cols
[2024-05-27 07:54:18] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:54:18] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 07:54:18] [INFO ] Invariant cache hit.
[2024-05-27 07:54:19] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-27 07:54:19] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 141/390 places, 204/1995 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 38326 ms. Remains : 141/390 places, 204/1995 transitions.
[2024-05-27 07:54:19] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:54:19] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:54:19] [INFO ] Input system was already deterministic with 204 transitions.
RANDOM walk for 1189 steps (250 resets) in 7 ms. (148 steps per ms) remains 0/1 properties
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-27 07:54:19] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:54:19] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:54:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16315294439899615510.gal : 1 ms
[2024-05-27 07:54:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2337109907166518416.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16315294439899615510.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2337109907166518416.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-27 07:54:19] [INFO ] Flatten gal took : 39 ms
[2024-05-27 07:54:19] [INFO ] Flatten gal took : 40 ms
[2024-05-27 07:54:19] [INFO ] Applying decomposition
[2024-05-27 07:54:19] [INFO ] Flatten gal took : 40 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/graph9461302797138857648.txt' '-o' '/tmp/graph9461302797138857648.bin' '-w' '/tmp/graph9461302797138857648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9461302797138857648.bin' '-l' '-1' '-v' '-w' '/tmp/graph9461302797138857648.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:54:19] [INFO ] Decomposing Gal with order
[2024-05-27 07:54:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:54:19] [INFO ] Removed a total of 1401 redundant transitions.
[2024-05-27 07:54:19] [INFO ] Flatten gal took : 302 ms
[2024-05-27 07:54:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 1316 labels/synchronizations in 27 ms.
[2024-05-27 07:54:19] [INFO ] Time to serialize gal into /tmp/CTLFireability4505895573989469893.gal : 9 ms
[2024-05-27 07:54:19] [INFO ] Time to serialize properties into /tmp/CTLFireability3560198565419464829.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/CTLFireability4505895573989469893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3560198565419464829.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 6 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.00943e+09,947.294,9010556,2522,13731,446720,1.83613e+07,938,5.49994e+06,2113,1.42698e+08,0


Converting to forward existential form...Done !
original formula: EG((AX(EG(!(E(((i1.u5.p158>=1)&&(u0.l0>=1)) U ((u0.s1>=1)&&(u8.l3926>=1)))))) * ((u0.s1<1)||(u8.l3920<1))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(EG(!(E(((i1.u5.p158>=1)&&(u0.l0>=1)) U ((u0.s1>=1)&&(u8.l3926>=1)))))))) * ((u0.s1<1)||(u8.l3...174
Reverse transition relation is NOT exact ! Due to transitions t13, t48, t55, t56, t57, t58, t59, t104, t105, t106, t107, t108, t115, t117, t252, t288, t291...8247
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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,1,1326.13,9010556,1,0,1.59584e+06,1.83613e+07,7295,3.0366e+07,12355,1.42698e+08,2474064
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EG(EF(AG((((u0.s1>=1)&&(u0.l3915>=1))||((u0.s1>=1)&&(u8.l3927>=1)))))) + (AG(((u0.s1>=1)&&(u8.l3919>=1))) * AF(((E((!(((u0.s1>=1)&&(u8.l...271
=> equivalent forward existential formula: ([(FwdU((Init * !(EG(E(TRUE U !(E(TRUE U !((((u0.s1>=1)&&(u0.l3915>=1))||((u0.s1>=1)&&(u8.l3927>=1)))))))))),TRU...468
(forward)formula 1,0,1415.06,9010556,1,0,1.78568e+06,1.83613e+07,7400,3.11315e+07,12365,1.42698e+08,2780977
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((EF(EX(TRUE)) * (u0.s1>=1)) * ((u8.l3910>=1) * ((!(A(((u0.s1>=1)&&(i1.u6.l195>=1)) U ((u0.s1>=1)&&(u8.l3933>=1)))) + ((u0.p894>=1)&&(...219
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U EX(TRUE)) * (u0.s1>=1)) * ((u8.l3910>=1) * ((!(!((E(!(((u0.s1>=1)&&(u8.l3933>=1))) U (!(...353
(forward)formula 2,0,1421.62,9010556,1,0,1.79474e+06,1.83613e+07,7438,3.12017e+07,12369,1.42698e+08,2800526
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(!(EX(E(((u0.s1>=1)&&(u0.l3921>=1)) U ((u0.s1>=1)&&(u0.l3921>=1))))) U EF(((!((!(((u0.s1>=1)&&(u8.l3296>=1))) * EF(((u0.s1>=1)&&(u8.l391...430
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((!((!(((u0.s1>=1)&&(u8.l3296>=1))) * E(TRUE U ((u0.s1>=1)&&(u8.l3918>=1))))) * ((EG((...1293
(forward)formula 3,0,1425.45,9010556,1,0,1.81303e+06,1.83613e+07,7511,3.13124e+07,12387,1.42698e+08,2841443
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX((AF(((u0.s1>=1)&&(u8.l3928>=1))) * ((AF(((u0.s1<1)||(u0.l3929<1))) + E(((u0.s1>=1)&&(u0.l3921>=1)) U !(((u0.s1<1)||(u0.l3939<1))))) + ...189
=> equivalent forward existential formula: ([FwdG(EY(Init),!(((u0.s1>=1)&&(u8.l3928>=1))))] = FALSE * [FwdG((EY(Init) * !((!(EG(!(((u0.s1<1)||(u0.l3929<1))...267
(forward)formula 4,0,1443.79,9010556,1,0,1.819e+06,1.83613e+07,7543,3.13214e+07,12391,1.42698e+08,2861616
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(A(A(((EX(((u0.s1>=1)&&(i4.i1.u35.l5550>=1))) + (AX(((u0.s1>=1)&&(i1.u5.l2875>=1))) * !(((u0.s1>=1)&&(u0.l3931>=1))))) + !(((u0.s1>=1)&&...318
=> equivalent forward existential formula: ([((FwdU(Init,!(EX(((!(!((E(!(((u0.s1>=1)&&(i1.u6.l3060>=1))) U (!(((u0.s1>=1)&&(u8.l3910>=1))) * !(((u0.s1>=1)&...1019
(forward)formula 5,1,1504.18,9010556,1,0,1.94229e+06,1.83613e+07,7572,3.20799e+07,12393,1.42698e+08,3064940
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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

BK_STOP 1716797970386

--------------------
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="RingSingleMessageInMbox-PT-d1m010"
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 RingSingleMessageInMbox-PT-d1m010, 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 r334-tall-171679079500066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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