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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 13 00:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 00:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 00:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 00:12 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-d1m005-CTLFireability-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716793957251

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-d1m005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-27 07:12:38] [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:12:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:12:38] [INFO ] Load time of PNML (sax parser for PT used): 436 ms
[2024-05-27 07:12:38] [INFO ] Transformed 6690 places.
[2024-05-27 07:12:39] [INFO ] Transformed 11934 transitions.
[2024-05-27 07:12:39] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 610 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 4305 places in 39 ms
Reduce places removed 4305 places and 0 transitions.
Support contains 54 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 10624
Iterating global reduction 1 with 1067 rules applied. Total rules applied 2253 place count 1301 transition count 10624
Ensure Unique test removed 435 transitions
Reduce isomorphic transitions removed 435 transitions.
Iterating post reduction 1 with 435 rules applied. Total rules applied 2688 place count 1301 transition count 10189
Discarding 864 places :
Symmetric choice reduction at 2 with 864 rule applications. Total rules 3552 place count 437 transition count 9325
Iterating global reduction 2 with 864 rules applied. Total rules applied 4416 place count 437 transition count 9325
Ensure Unique test removed 7147 transitions
Reduce isomorphic transitions removed 7147 transitions.
Iterating post reduction 2 with 7147 rules applied. Total rules applied 11563 place count 437 transition count 2178
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 11573 place count 427 transition count 2168
Iterating global reduction 3 with 10 rules applied. Total rules applied 11583 place count 427 transition count 2168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 11585 place count 427 transition count 2166
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 11593 place count 419 transition count 2158
Iterating global reduction 4 with 8 rules applied. Total rules applied 11601 place count 419 transition count 2158
Applied a total of 11601 rules in 399 ms. Remains 419 /2385 variables (removed 1966) and now considering 2158/11934 (removed 9776) transitions.
// Phase 1: matrix 2158 rows 419 cols
[2024-05-27 07:12:39] [INFO ] Computed 3 invariants in 34 ms
[2024-05-27 07:12:40] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-27 07:12:40] [INFO ] Invariant cache hit.
[2024-05-27 07:12:40] [INFO ] State equation strengthened by 1781 read => feed constraints.
[2024-05-27 07:12:43] [INFO ] Implicit Places using invariants and state equation in 3553 ms returned []
Implicit Place search using SMT with State Equation took 4038 ms to find 0 implicit places.
Running 2157 sub problems to find dead transitions.
[2024-05-27 07:12:43] [INFO ] Invariant cache hit.
[2024-05-27 07:12:43] [INFO ] State equation strengthened by 1781 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2157 unsolved
At refinement iteration 2 (OVERLAPS) 1/419 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/2577 variables, and 3 constraints, problems are : Problem set: 0 solved, 2157 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/419 constraints, ReadFeed: 0/1781 constraints, PredecessorRefiner: 2157/2157 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2157 unsolved
At refinement iteration 2 (OVERLAPS) 1/419 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/2577 variables, and 3 constraints, problems are : Problem set: 0 solved, 2157 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/419 constraints, ReadFeed: 0/1781 constraints, PredecessorRefiner: 0/2157 constraints, Known Traps: 0/0 constraints]
After SMT, in 72432ms problems are : Problem set: 0 solved, 2157 unsolved
Search for dead transitions found 0 dead transitions in 72475ms
Starting structural reductions in LTL mode, iteration 1 : 419/2385 places, 2158/11934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76958 ms. Remains : 419/2385 places, 2158/11934 transitions.
Support contains 54 out of 419 places after structural reductions.
[2024-05-27 07:13:56] [INFO ] Flatten gal took : 142 ms
[2024-05-27 07:13:56] [INFO ] Flatten gal took : 101 ms
[2024-05-27 07:13:56] [INFO ] Input system was already deterministic with 2158 transitions.
Support contains 53 out of 419 places (down from 54) after GAL structural reductions.
RANDOM walk for 40000 steps (6937 resets) in 2940 ms. (13 steps per ms) remains 6/53 properties
BEST_FIRST walk for 40004 steps (775 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (654 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (393 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (647 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (685 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (794 resets) in 207 ms. (192 steps per ms) remains 6/6 properties
[2024-05-27 07:13:58] [INFO ] Invariant cache hit.
[2024-05-27 07:13:58] [INFO ] State equation strengthened by 1781 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (OVERLAPS) 112/130 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/137 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 45/182 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1066/1248 variables, 182/185 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1248 variables, 689/874 constraints. Problems are: Problem set: 1 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1248 variables, 0/874 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
After SMT solving in domain Real declared 2577/2577 variables, and 1111 constraints, problems are : Problem set: 6 solved, 0 unsolved in 1588 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 419/419 constraints, ReadFeed: 689/1781 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1760ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-05-27 07:14:00] [INFO ] Flatten gal took : 59 ms
[2024-05-27 07:14:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:14:00] [INFO ] Flatten gal took : 63 ms
[2024-05-27 07:14:00] [INFO ] Input system was already deterministic with 2158 transitions.
Support contains 40 out of 419 places (down from 46) after GAL structural reductions.
Computed a total of 126 stabilizing places and 1045 stable transitions
Graph (complete) has 3001 edges and 419 vertex of which 418 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 372 transition count 711
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 372 transition count 711
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 111 place count 372 transition count 694
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 179 place count 304 transition count 626
Iterating global reduction 1 with 68 rules applied. Total rules applied 247 place count 304 transition count 626
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 307 place count 304 transition count 566
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 419 place count 192 transition count 454
Iterating global reduction 2 with 112 rules applied. Total rules applied 531 place count 192 transition count 454
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 667 place count 192 transition count 318
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 669 place count 190 transition count 292
Iterating global reduction 3 with 2 rules applied. Total rules applied 671 place count 190 transition count 292
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 672 place count 189 transition count 291
Iterating global reduction 3 with 1 rules applied. Total rules applied 673 place count 189 transition count 291
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 677 place count 185 transition count 287
Iterating global reduction 3 with 4 rules applied. Total rules applied 681 place count 185 transition count 287
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 697 place count 185 transition count 271
Applied a total of 697 rules in 43 ms. Remains 185 /419 variables (removed 234) and now considering 271/2158 (removed 1887) transitions.
// Phase 1: matrix 271 rows 185 cols
[2024-05-27 07:14:00] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 07:14:00] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-27 07:14:00] [INFO ] Invariant cache hit.
[2024-05-27 07:14:00] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-27 07:14:01] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-27 07:14:01] [INFO ] Invariant cache hit.
[2024-05-27 07:14:01] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 4 (OVERLAPS) 271/456 variables, 185/188 constraints. Problems are: Problem set: 24 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 97/285 constraints. Problems are: Problem set: 24 solved, 246 unsolved
[2024-05-27 07:14:06] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 13 ms to minimize.
[2024-05-27 07:14:06] [INFO ] Deduced a trap composed of 110 places in 71 ms of which 2 ms to minimize.
[2024-05-27 07:14:06] [INFO ] Deduced a trap composed of 103 places in 59 ms of which 1 ms to minimize.
[2024-05-27 07:14:06] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 3 ms to minimize.
[2024-05-27 07:14:06] [INFO ] Deduced a trap composed of 100 places in 69 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
[2024-05-27 07:14:06] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 2 ms to minimize.
[2024-05-27 07:14:06] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 1 ms to minimize.
[2024-05-27 07:14:07] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 9 ms to minimize.
[2024-05-27 07:14:07] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 9/294 constraints. Problems are: Problem set: 44 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/294 constraints. Problems are: Problem set: 44 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/456 variables, 0/294 constraints. Problems are: Problem set: 44 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 294 constraints, problems are : Problem set: 44 solved, 226 unsolved in 12864 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 44 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 25/169 variables, 2/2 constraints. Problems are: Problem set: 44 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 44 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 16/185 variables, 1/3 constraints. Problems are: Problem set: 44 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 9/12 constraints. Problems are: Problem set: 44 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/12 constraints. Problems are: Problem set: 44 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 271/456 variables, 185/197 constraints. Problems are: Problem set: 44 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 97/294 constraints. Problems are: Problem set: 44 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 226/520 constraints. Problems are: Problem set: 44 solved, 226 unsolved
[2024-05-27 07:14:23] [INFO ] Deduced a trap composed of 102 places in 70 ms of which 1 ms to minimize.
[2024-05-27 07:14:23] [INFO ] Deduced a trap composed of 92 places in 52 ms of which 2 ms to minimize.
[2024-05-27 07:14:24] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
[2024-05-27 07:14:24] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 2 ms to minimize.
Problem TDEAD218 is UNSAT
[2024-05-27 07:14:24] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 5/525 constraints. Problems are: Problem set: 46 solved, 224 unsolved
[2024-05-27 07:14:31] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 2 ms to minimize.
[2024-05-27 07:14:32] [INFO ] Deduced a trap composed of 102 places in 62 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 2/527 constraints. Problems are: Problem set: 46 solved, 224 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 0/527 constraints. Problems are: Problem set: 46 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 527 constraints, problems are : Problem set: 46 solved, 224 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 226/270 constraints, Known Traps: 16/16 constraints]
After SMT, in 43367ms problems are : Problem set: 46 solved, 224 unsolved
Search for dead transitions found 46 dead transitions in 43372ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 185/419 places, 225/2158 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 143 transition count 207
Applied a total of 60 rules in 4 ms. Remains 143 /185 variables (removed 42) and now considering 207/225 (removed 18) transitions.
// Phase 1: matrix 207 rows 143 cols
[2024-05-27 07:14:44] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:14:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 07:14:44] [INFO ] Invariant cache hit.
[2024-05-27 07:14:44] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-27 07:14:44] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 143/419 places, 207/2158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44705 ms. Remains : 143/419 places, 207/2158 transitions.
[2024-05-27 07:14:44] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:14:44] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:14:44] [INFO ] Input system was already deterministic with 207 transitions.
[2024-05-27 07:14:44] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:14:45] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:14:45] [INFO ] Time to serialize gal into /tmp/CTLFireability18249305037305669055.gal : 9 ms
[2024-05-27 07:14:45] [INFO ] Time to serialize properties into /tmp/CTLFireability813009473423467471.ctl : 15 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/CTLFireability18249305037305669055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability813009473423467471.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,156896,0.968338,38212,2,6054,5,70243,6,0,779,51623,0


Converting to forward existential form...Done !
original formula: EG(!(E(EF(((s1>=1)&&(l3921>=1))) U EX(((s1>=1)&&(l3929>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(E(TRUE U ((s1>=1)&&(l3921>=1))) U EX(((s1>=1)&&(l3929>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t18, t19, t20, t21, t22, t23, t24, t25, t30, t31, t32, t33, t34, t51, t52, t53, t56,...670
(forward)formula 0,1,5.46144,165816,1,0,552,541485,445,266,5529,478009,567
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 379 transition count 968
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 379 transition count 968
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 104 place count 379 transition count 944
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 166 place count 317 transition count 882
Iterating global reduction 1 with 62 rules applied. Total rules applied 228 place count 317 transition count 882
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 347 place count 317 transition count 763
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 439 place count 225 transition count 671
Iterating global reduction 2 with 92 rules applied. Total rules applied 531 place count 225 transition count 671
Ensure Unique test removed 188 transitions
Reduce isomorphic transitions removed 188 transitions.
Iterating post reduction 2 with 188 rules applied. Total rules applied 719 place count 225 transition count 483
Applied a total of 719 rules in 31 ms. Remains 225 /419 variables (removed 194) and now considering 483/2158 (removed 1675) transitions.
// Phase 1: matrix 483 rows 225 cols
[2024-05-27 07:14:50] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 07:14:50] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-27 07:14:50] [INFO ] Invariant cache hit.
[2024-05-27 07:14:51] [INFO ] State equation strengthened by 276 read => feed constraints.
[2024-05-27 07:14:51] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-27 07:14:51] [INFO ] Invariant cache hit.
[2024-05-27 07:14:51] [INFO ] State equation strengthened by 276 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/225 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
At refinement iteration 4 (OVERLAPS) 483/708 variables, 225/228 constraints. Problems are: Problem set: 24 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/708 variables, 276/504 constraints. Problems are: Problem set: 24 solved, 458 unsolved
[2024-05-27 07:15:05] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-27 07:15:05] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/708 variables, 2/506 constraints. Problems are: Problem set: 24 solved, 458 unsolved
[2024-05-27 07:15:13] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 2 ms to minimize.
[2024-05-27 07:15:13] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2024-05-27 07:15:13] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/708 variables, 3/509 constraints. Problems are: Problem set: 29 solved, 453 unsolved
[2024-05-27 07:15:20] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-27 07:15:20] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 2 ms to minimize.
[2024-05-27 07:15:20] [INFO ] Deduced a trap composed of 104 places in 88 ms of which 1 ms to minimize.
[2024-05-27 07:15:20] [INFO ] Deduced a trap composed of 110 places in 91 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/708 variables, 4/513 constraints. Problems are: Problem set: 29 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 708/708 variables, and 513 constraints, problems are : Problem set: 29 solved, 453 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 225/225 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 29 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 2/2 constraints. Problems are: Problem set: 29 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/2 constraints. Problems are: Problem set: 29 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 19/215 variables, 2/4 constraints. Problems are: Problem set: 29 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 4/8 constraints. Problems are: Problem set: 29 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 29 solved, 453 unsolved
At refinement iteration 5 (OVERLAPS) 10/225 variables, 1/9 constraints. Problems are: Problem set: 29 solved, 453 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 3/12 constraints. Problems are: Problem set: 29 solved, 453 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/12 constraints. Problems are: Problem set: 29 solved, 453 unsolved
At refinement iteration 8 (OVERLAPS) 483/708 variables, 225/237 constraints. Problems are: Problem set: 29 solved, 453 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/708 variables, 276/513 constraints. Problems are: Problem set: 29 solved, 453 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/708 variables, 453/966 constraints. Problems are: Problem set: 29 solved, 453 unsolved
[2024-05-27 07:15:42] [INFO ] Deduced a trap composed of 111 places in 68 ms of which 1 ms to minimize.
[2024-05-27 07:15:42] [INFO ] Deduced a trap composed of 101 places in 62 ms of which 2 ms to minimize.
[2024-05-27 07:15:42] [INFO ] Deduced a trap composed of 100 places in 56 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
[2024-05-27 07:15:44] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 2 ms to minimize.
[2024-05-27 07:15:44] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
[2024-05-27 07:15:44] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD149 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 708/708 variables, and 972 constraints, problems are : Problem set: 38 solved, 444 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 225/225 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 453/482 constraints, Known Traps: 15/15 constraints]
After SMT, in 61139ms problems are : Problem set: 38 solved, 444 unsolved
Search for dead transitions found 38 dead transitions in 61146ms
Found 38 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 38 transitions
Dead transitions reduction (with SMT) removed 38 transitions
Starting structural reductions in LTL mode, iteration 1 : 225/419 places, 445/2158 transitions.
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 191 transition count 432
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 189 transition count 430
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 189 transition count 430
Applied a total of 51 rules in 8 ms. Remains 189 /225 variables (removed 36) and now considering 430/445 (removed 15) transitions.
// Phase 1: matrix 430 rows 189 cols
[2024-05-27 07:15:53] [INFO ] Computed 1 invariants in 4 ms
[2024-05-27 07:15:53] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-27 07:15:53] [INFO ] Invariant cache hit.
[2024-05-27 07:15:53] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-27 07:15:53] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 189/419 places, 430/2158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63259 ms. Remains : 189/419 places, 430/2158 transitions.
[2024-05-27 07:15:53] [INFO ] Flatten gal took : 12 ms
[2024-05-27 07:15:53] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:15:53] [INFO ] Input system was already deterministic with 430 transitions.
[2024-05-27 07:15:53] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:15:53] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:15:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16988243034462283186.gal : 3 ms
[2024-05-27 07:15:53] [INFO ] Time to serialize properties into /tmp/CTLFireability7678911270711373794.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/CTLFireability16988243034462283186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7678911270711373794.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,286275,2.73428,93100,2,7681,5,193022,6,0,1186,113577,0


Converting to forward existential form...Done !
original formula: EF((EX(A(((s1>=1)&&(l3926>=1)) U ((s1>=1)&&(l3490>=1)))) + ((EF(((s1>=1)&&(l3939>=1))) * ((((s1<1)||(l3922<1))||(((s1>=1)&&(l3927>=1))||(...249
=> equivalent forward existential formula: ([((EY(FwdU(Init,TRUE)) * !(EG(!(((s1>=1)&&(l3490>=1)))))) * !(E(!(((s1>=1)&&(l3490>=1))) U (!(((s1>=1)&&(l3926>...413
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t35,...1696
(forward)formula 0,1,12.189,329296,1,0,704,1.41491e+06,881,281,8547,699353,1009
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 373 transition count 762
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 373 transition count 762
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 111 place count 373 transition count 743
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 178 place count 306 transition count 676
Iterating global reduction 1 with 67 rules applied. Total rules applied 245 place count 306 transition count 676
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 317 place count 306 transition count 604
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 425 place count 198 transition count 496
Iterating global reduction 2 with 108 rules applied. Total rules applied 533 place count 198 transition count 496
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 2 with 144 rules applied. Total rules applied 677 place count 198 transition count 352
Applied a total of 677 rules in 79 ms. Remains 198 /419 variables (removed 221) and now considering 352/2158 (removed 1806) transitions.
// Phase 1: matrix 352 rows 198 cols
[2024-05-27 07:16:06] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 07:16:06] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 07:16:06] [INFO ] Invariant cache hit.
[2024-05-27 07:16:06] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-27 07:16:07] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-27 07:16:07] [INFO ] Redundant transitions in 25 ms returned []
Running 351 sub problems to find dead transitions.
[2024-05-27 07:16:07] [INFO ] Invariant cache hit.
[2024-05-27 07:16:07] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 4 (OVERLAPS) 352/550 variables, 198/201 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 168/369 constraints. Problems are: Problem set: 24 solved, 327 unsolved
[2024-05-27 07:16:13] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 1 ms to minimize.
[2024-05-27 07:16:14] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 2 ms to minimize.
[2024-05-27 07:16:14] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 2 ms to minimize.
[2024-05-27 07:16:14] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 4 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
[2024-05-27 07:16:14] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
[2024-05-27 07:16:16] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2024-05-27 07:16:16] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-27 07:16:16] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 8/377 constraints. Problems are: Problem set: 44 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/377 constraints. Problems are: Problem set: 44 solved, 307 unsolved
[2024-05-27 07:16:24] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 2 ms to minimize.
[2024-05-27 07:16:24] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 2 ms to minimize.
[2024-05-27 07:16:24] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2024-05-27 07:16:24] [INFO ] Deduced a trap composed of 97 places in 68 ms of which 1 ms to minimize.
[2024-05-27 07:16:24] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 2 ms to minimize.
[2024-05-27 07:16:24] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/550 variables, 6/383 constraints. Problems are: Problem set: 44 solved, 307 unsolved
[2024-05-27 07:16:28] [INFO ] Deduced a trap composed of 96 places in 66 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 1/384 constraints. Problems are: Problem set: 44 solved, 307 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/384 constraints. Problems are: Problem set: 44 solved, 307 unsolved
At refinement iteration 11 (OVERLAPS) 0/550 variables, 0/384 constraints. Problems are: Problem set: 44 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 384 constraints, problems are : Problem set: 44 solved, 307 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 44 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 3/3 constraints. Problems are: Problem set: 44 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 44 solved, 307 unsolved
At refinement iteration 2 (OVERLAPS) 25/182 variables, 2/5 constraints. Problems are: Problem set: 44 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 5/10 constraints. Problems are: Problem set: 44 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/10 constraints. Problems are: Problem set: 44 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 16/198 variables, 1/11 constraints. Problems are: Problem set: 44 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 7/18 constraints. Problems are: Problem set: 44 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/18 constraints. Problems are: Problem set: 44 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 352/550 variables, 198/216 constraints. Problems are: Problem set: 44 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 168/384 constraints. Problems are: Problem set: 44 solved, 307 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 307/691 constraints. Problems are: Problem set: 44 solved, 307 unsolved
[2024-05-27 07:16:54] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 2 ms to minimize.
[2024-05-27 07:16:54] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 1 ms to minimize.
Problem TDEAD295 is UNSAT
[2024-05-27 07:16:54] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 2 ms to minimize.
Problem TDEAD299 is UNSAT
[2024-05-27 07:16:55] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 2 ms to minimize.
[2024-05-27 07:16:55] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 2 ms to minimize.
[2024-05-27 07:16:55] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
[2024-05-27 07:16:55] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/550 variables, 7/698 constraints. Problems are: Problem set: 46 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 698 constraints, problems are : Problem set: 46 solved, 305 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 307/351 constraints, Known Traps: 22/22 constraints]
After SMT, in 60691ms problems are : Problem set: 46 solved, 305 unsolved
Search for dead transitions found 46 dead transitions in 60695ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 198/419 places, 306/2158 transitions.
Graph (complete) has 658 edges and 198 vertex of which 156 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 156 transition count 288
Applied a total of 19 rules in 15 ms. Remains 156 /198 variables (removed 42) and now considering 288/306 (removed 18) transitions.
// Phase 1: matrix 288 rows 156 cols
[2024-05-27 07:17:07] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:17:07] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 07:17:07] [INFO ] Invariant cache hit.
[2024-05-27 07:17:07] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 07:17:08] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 156/419 places, 288/2158 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 61951 ms. Remains : 156/419 places, 288/2158 transitions.
[2024-05-27 07:17:08] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:17:08] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:17:08] [INFO ] Input system was already deterministic with 288 transitions.
[2024-05-27 07:17:08] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:17:08] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:17:08] [INFO ] Time to serialize gal into /tmp/CTLFireability10240569727737455046.gal : 1 ms
[2024-05-27 07:17:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6294875275652615759.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/CTLFireability10240569727737455046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6294875275652615759.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,247676,1.06287,39908,2,6392,5,87234,6,0,912,53741,0


Converting to forward existential form...Done !
original formula: AF((EF(EG(((s1<1)||(l3910<1)))) * !(E(((s1>=1)&&(l3915>=1)) U ((s1>=1)&&(l3924>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U EG(((s1<1)||(l3910<1)))) * !(E(((s1>=1)&&(l3915>=1)) U ((s1>=1)&&(l3924>=1)))))))] = FALS...156
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t26, t27, t28, t29, t30, ...1110
(forward)formula 0,1,7.63602,233728,1,0,597,1.0006e+06,612,240,6565,622525,741
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 371 transition count 660
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 371 transition count 660
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 107 place count 371 transition count 649
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 176 place count 302 transition count 580
Iterating global reduction 1 with 69 rules applied. Total rules applied 245 place count 302 transition count 580
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 297 place count 302 transition count 528
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 413 place count 186 transition count 412
Iterating global reduction 2 with 116 rules applied. Total rules applied 529 place count 186 transition count 412
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 645 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 647 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 649 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 650 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 651 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 655 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 659 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 671 place count 179 transition count 253
Applied a total of 671 rules in 60 ms. Remains 179 /419 variables (removed 240) and now considering 253/2158 (removed 1905) transitions.
// Phase 1: matrix 253 rows 179 cols
[2024-05-27 07:17:16] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 07:17:16] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 07:17:16] [INFO ] Invariant cache hit.
[2024-05-27 07:17:16] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-27 07:17:16] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2024-05-27 07:17:16] [INFO ] Redundant transitions in 9 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-27 07:17:16] [INFO ] Invariant cache hit.
[2024-05-27 07:17:16] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
[2024-05-27 07:17:24] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2024-05-27 07:17:24] [INFO ] Deduced a trap composed of 109 places in 68 ms of which 1 ms to minimize.
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/432 variables, 2/268 constraints. Problems are: Problem set: 29 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/268 constraints. Problems are: Problem set: 29 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/432 variables, 0/268 constraints. Problems are: Problem set: 29 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 268 constraints, problems are : Problem set: 29 solved, 223 unsolved in 12593 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 29 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 29 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 29 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 28/179 variables, 2/3 constraints. Problems are: Problem set: 29 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/5 constraints. Problems are: Problem set: 29 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/5 constraints. Problems are: Problem set: 29 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 253/432 variables, 179/184 constraints. Problems are: Problem set: 29 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 84/268 constraints. Problems are: Problem set: 29 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 223/491 constraints. Problems are: Problem set: 29 solved, 223 unsolved
[2024-05-27 07:17:35] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2024-05-27 07:17:35] [INFO ] Deduced a trap composed of 107 places in 62 ms of which 3 ms to minimize.
[2024-05-27 07:17:35] [INFO ] Deduced a trap composed of 119 places in 58 ms of which 1 ms to minimize.
[2024-05-27 07:17:36] [INFO ] Deduced a trap composed of 89 places in 47 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:17:36] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 1 ms to minimize.
[2024-05-27 07:17:36] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD98 is UNSAT
[2024-05-27 07:17:39] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
[2024-05-27 07:17:39] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 2 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
[2024-05-27 07:17:40] [INFO ] Deduced a trap composed of 95 places in 67 ms of which 1 ms to minimize.
[2024-05-27 07:17:40] [INFO ] Deduced a trap composed of 100 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 10/501 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/501 constraints. Problems are: Problem set: 46 solved, 206 unsolved
[2024-05-27 07:17:53] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/432 variables, 1/502 constraints. Problems are: Problem set: 46 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 502 constraints, problems are : Problem set: 46 solved, 206 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 223/252 constraints, Known Traps: 13/13 constraints]
After SMT, in 43004ms problems are : Problem set: 46 solved, 206 unsolved
Search for dead transitions found 46 dead transitions in 43009ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 179/419 places, 207/2158 transitions.
Graph (complete) has 526 edges and 179 vertex of which 137 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 137 transition count 189
Applied a total of 19 rules in 8 ms. Remains 137 /179 variables (removed 42) and now considering 189/207 (removed 18) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 07:17:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:17:59] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-27 07:17:59] [INFO ] Invariant cache hit.
[2024-05-27 07:17:59] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 07:17:59] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 137/419 places, 189/2158 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 43849 ms. Remains : 137/419 places, 189/2158 transitions.
[2024-05-27 07:17:59] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:17:59] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:17:59] [INFO ] Input system was already deterministic with 189 transitions.
[2024-05-27 07:17:59] [INFO ] Flatten gal took : 5 ms
RANDOM walk for 1424 steps (271 resets) in 8 ms. (158 steps per ms) remains 0/1 properties
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-27 07:17:59] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:17:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17952342572202969384.gal : 3 ms
[2024-05-27 07:17:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3415271580881642513.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17952342572202969384.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3415271580881642513.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 375 transition count 814
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 375 transition count 814
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 106 place count 375 transition count 796
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 172 place count 309 transition count 730
Iterating global reduction 1 with 66 rules applied. Total rules applied 238 place count 309 transition count 730
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 322 place count 309 transition count 646
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 426 place count 205 transition count 542
Iterating global reduction 2 with 104 rules applied. Total rules applied 530 place count 205 transition count 542
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 2 with 152 rules applied. Total rules applied 682 place count 205 transition count 390
Applied a total of 682 rules in 19 ms. Remains 205 /419 variables (removed 214) and now considering 390/2158 (removed 1768) transitions.
// Phase 1: matrix 390 rows 205 cols
[2024-05-27 07:17:59] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 07:18:00] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-27 07:18:00] [INFO ] Invariant cache hit.
[2024-05-27 07:18:00] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-27 07:18:00] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
Running 389 sub problems to find dead transitions.
[2024-05-27 07:18:00] [INFO ] Invariant cache hit.
[2024-05-27 07:18:00] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 1/205 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 4 (OVERLAPS) 390/595 variables, 205/208 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 200/408 constraints. Problems are: Problem set: 24 solved, 365 unsolved
[2024-05-27 07:18:10] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-27 07:18:10] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 2/410 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 0/410 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 8 (OVERLAPS) 0/595 variables, 0/410 constraints. Problems are: Problem set: 24 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 410 constraints, problems are : Problem set: 24 solved, 365 unsolved in 20964 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 24 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 17/197 variables, 2/4 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/4 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 8/205 variables, 1/5 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 6 (OVERLAPS) 390/595 variables, 205/210 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 200/410 constraints. Problems are: Problem set: 24 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 365/775 constraints. Problems are: Problem set: 24 solved, 365 unsolved
[2024-05-27 07:18:35] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-05-27 07:18:35] [INFO ] Deduced a trap composed of 100 places in 62 ms of which 2 ms to minimize.
[2024-05-27 07:18:36] [INFO ] Deduced a trap composed of 99 places in 60 ms of which 2 ms to minimize.
[2024-05-27 07:18:37] [INFO ] Deduced a trap composed of 89 places in 54 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:18:37] [INFO ] Deduced a trap composed of 78 places in 59 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:18:37] [INFO ] Deduced a trap composed of 98 places in 54 ms of which 2 ms to minimize.
[2024-05-27 07:18:38] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
[2024-05-27 07:18:43] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
[2024-05-27 07:18:43] [INFO ] Deduced a trap composed of 100 places in 64 ms of which 2 ms to minimize.
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
[2024-05-27 07:18:43] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 1 ms to minimize.
[2024-05-27 07:18:43] [INFO ] Deduced a trap composed of 101 places in 57 ms of which 1 ms to minimize.
[2024-05-27 07:18:43] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 2 ms to minimize.
[2024-05-27 07:18:44] [INFO ] Deduced a trap composed of 108 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 13/788 constraints. Problems are: Problem set: 46 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/595 variables, and 788 constraints, problems are : Problem set: 46 solved, 343 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 365/389 constraints, Known Traps: 15/15 constraints]
After SMT, in 51752ms problems are : Problem set: 46 solved, 343 unsolved
Search for dead transitions found 46 dead transitions in 51760ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 205/419 places, 344/2158 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 163 transition count 326
Applied a total of 60 rules in 2 ms. Remains 163 /205 variables (removed 42) and now considering 326/344 (removed 18) transitions.
// Phase 1: matrix 326 rows 163 cols
[2024-05-27 07:18:52] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:18:52] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 07:18:52] [INFO ] Invariant cache hit.
[2024-05-27 07:18:52] [INFO ] State equation strengthened by 192 read => feed constraints.
[2024-05-27 07:18:53] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/419 places, 326/2158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53152 ms. Remains : 163/419 places, 326/2158 transitions.
[2024-05-27 07:18:53] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:18:53] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:18:53] [INFO ] Input system was already deterministic with 326 transitions.
[2024-05-27 07:18:53] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:18:53] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:18:53] [INFO ] Time to serialize gal into /tmp/CTLFireability801709940997551702.gal : 1 ms
[2024-05-27 07:18:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8494770625011738685.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/CTLFireability801709940997551702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8494770625011738685.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,283394,2.4494,76620,2,6012,5,168642,6,0,978,125052,0


Converting to forward existential form...Done !
original formula: AF((A(!(((s1<1)||(l3928<1))) U A(((AX(((s1>=1)&&(l3924>=1))) + ((s1>=1)&&(l3917>=1))) + ((s1>=1)&&(l3914>=1))) U ((s1>=1)&&(l3239>=1)))) ...179
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!(!((E(!(((s1>=1)&&(l3239>=1))) U (!(((!(EX(!(((s1>=1)&&(l3924>=1))))) + ((s1>=1)&&(l3917>=1)...692
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30,...1284
Using saturation style SCC detection
(forward)formula 0,0,13.3895,358660,1,0,778,1.49702e+06,691,377,7096,1.11011e+06,942
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 373 transition count 762
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 373 transition count 762
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 111 place count 373 transition count 743
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 178 place count 306 transition count 676
Iterating global reduction 1 with 67 rules applied. Total rules applied 245 place count 306 transition count 676
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 317 place count 306 transition count 604
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 425 place count 198 transition count 496
Iterating global reduction 2 with 108 rules applied. Total rules applied 533 place count 198 transition count 496
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 2 with 144 rules applied. Total rules applied 677 place count 198 transition count 352
Applied a total of 677 rules in 20 ms. Remains 198 /419 variables (removed 221) and now considering 352/2158 (removed 1806) transitions.
// Phase 1: matrix 352 rows 198 cols
[2024-05-27 07:19:06] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 07:19:06] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-27 07:19:06] [INFO ] Invariant cache hit.
[2024-05-27 07:19:06] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-27 07:19:07] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
Running 351 sub problems to find dead transitions.
[2024-05-27 07:19:07] [INFO ] Invariant cache hit.
[2024-05-27 07:19:07] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 4 (OVERLAPS) 352/550 variables, 198/201 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 168/369 constraints. Problems are: Problem set: 24 solved, 327 unsolved
[2024-05-27 07:19:14] [INFO ] Deduced a trap composed of 102 places in 56 ms of which 1 ms to minimize.
[2024-05-27 07:19:15] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:19:15] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:19:16] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 4/373 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/373 constraints. Problems are: Problem set: 36 solved, 315 unsolved
[2024-05-27 07:19:24] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-27 07:19:24] [INFO ] Deduced a trap composed of 100 places in 75 ms of which 1 ms to minimize.
[2024-05-27 07:19:24] [INFO ] Deduced a trap composed of 116 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/550 variables, 3/376 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/376 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 10 (OVERLAPS) 0/550 variables, 0/376 constraints. Problems are: Problem set: 36 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 376 constraints, problems are : Problem set: 36 solved, 315 unsolved in 28040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 36 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 23/186 variables, 2/4 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/5 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/5 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 5 (OVERLAPS) 12/198 variables, 1/6 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 4/10 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/10 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 8 (OVERLAPS) 352/550 variables, 198/208 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 168/376 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 315/691 constraints. Problems are: Problem set: 36 solved, 315 unsolved
[2024-05-27 07:19:46] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
[2024-05-27 07:19:53] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
[2024-05-27 07:19:53] [INFO ] Deduced a trap composed of 108 places in 52 ms of which 2 ms to minimize.
[2024-05-27 07:19:53] [INFO ] Deduced a trap composed of 103 places in 65 ms of which 1 ms to minimize.
[2024-05-27 07:19:53] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:19:53] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 1 ms to minimize.
[2024-05-27 07:19:54] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:19:54] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/550 variables, 8/699 constraints. Problems are: Problem set: 46 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 699 constraints, problems are : Problem set: 46 solved, 305 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 315/351 constraints, Known Traps: 15/15 constraints]
After SMT, in 58727ms problems are : Problem set: 46 solved, 305 unsolved
Search for dead transitions found 46 dead transitions in 58734ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 198/419 places, 306/2158 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 156 transition count 288
Applied a total of 60 rules in 4 ms. Remains 156 /198 variables (removed 42) and now considering 288/306 (removed 18) transitions.
// Phase 1: matrix 288 rows 156 cols
[2024-05-27 07:20:06] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:20:06] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-27 07:20:06] [INFO ] Invariant cache hit.
[2024-05-27 07:20:06] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 07:20:06] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/419 places, 288/2158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59891 ms. Remains : 156/419 places, 288/2158 transitions.
[2024-05-27 07:20:06] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:20:06] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:20:06] [INFO ] Input system was already deterministic with 288 transitions.
[2024-05-27 07:20:06] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:20:06] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:20:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10499237789303754385.gal : 1 ms
[2024-05-27 07:20:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5643661140936706624.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/CTLFireability10499237789303754385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5643661140936706624.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,247676,0.595965,26464,2,5230,5,51999,6,0,912,35109,0


Converting to forward existential form...Done !
original formula: !(A(AX(!(((s1>=1)&&(l3913>=1)))) U AG(E(EF(((s1>=1)&&(l3940>=1))) U (EF(((s1>=1)&&(l195>=1))) * !(((s1>=1)&&(l3934>=1))))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !(E(E(TRUE U ((s1>=1)&&(l3940>=1))) U (E(TRUE U ((s1>=1)&&(l195>=1))) * !(((s1>=...479
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30,...1108
(forward)formula 0,1,4.3432,144260,1,0,513,411243,605,216,6606,291233,644
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 375 transition count 864
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 375 transition count 864
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 111 place count 375 transition count 841
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 176 place count 310 transition count 776
Iterating global reduction 1 with 65 rules applied. Total rules applied 241 place count 310 transition count 776
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 337 place count 310 transition count 680
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 437 place count 210 transition count 580
Iterating global reduction 2 with 100 rules applied. Total rules applied 537 place count 210 transition count 580
Ensure Unique test removed 184 transitions
Reduce isomorphic transitions removed 184 transitions.
Iterating post reduction 2 with 184 rules applied. Total rules applied 721 place count 210 transition count 396
Applied a total of 721 rules in 27 ms. Remains 210 /419 variables (removed 209) and now considering 396/2158 (removed 1762) transitions.
// Phase 1: matrix 396 rows 210 cols
[2024-05-27 07:20:11] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 07:20:11] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-27 07:20:11] [INFO ] Invariant cache hit.
[2024-05-27 07:20:11] [INFO ] State equation strengthened by 202 read => feed constraints.
[2024-05-27 07:20:11] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-05-27 07:20:11] [INFO ] Invariant cache hit.
[2024-05-27 07:20:11] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
At refinement iteration 4 (OVERLAPS) 396/606 variables, 210/213 constraints. Problems are: Problem set: 24 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/606 variables, 202/415 constraints. Problems are: Problem set: 24 solved, 371 unsolved
[2024-05-27 07:20:20] [INFO ] Deduced a trap composed of 89 places in 45 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
[2024-05-27 07:20:20] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
[2024-05-27 07:20:22] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-27 07:20:22] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/606 variables, 4/419 constraints. Problems are: Problem set: 44 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 0/419 constraints. Problems are: Problem set: 44 solved, 351 unsolved
At refinement iteration 8 (OVERLAPS) 0/606 variables, 0/419 constraints. Problems are: Problem set: 44 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 419 constraints, problems are : Problem set: 44 solved, 351 unsolved in 24104 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 44 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 2/2 constraints. Problems are: Problem set: 44 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 44 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 25/194 variables, 2/4 constraints. Problems are: Problem set: 44 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/4 constraints. Problems are: Problem set: 44 solved, 351 unsolved
At refinement iteration 4 (OVERLAPS) 16/210 variables, 1/5 constraints. Problems are: Problem set: 44 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 2/7 constraints. Problems are: Problem set: 44 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/7 constraints. Problems are: Problem set: 44 solved, 351 unsolved
At refinement iteration 7 (OVERLAPS) 396/606 variables, 210/217 constraints. Problems are: Problem set: 44 solved, 351 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 202/419 constraints. Problems are: Problem set: 44 solved, 351 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 351/770 constraints. Problems are: Problem set: 44 solved, 351 unsolved
[2024-05-27 07:20:49] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
[2024-05-27 07:20:51] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2024-05-27 07:20:52] [INFO ] Deduced a trap composed of 109 places in 66 ms of which 2 ms to minimize.
[2024-05-27 07:20:52] [INFO ] Deduced a trap composed of 106 places in 66 ms of which 1 ms to minimize.
[2024-05-27 07:20:52] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 2 ms to minimize.
[2024-05-27 07:20:56] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:20:57] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 1 ms to minimize.
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
[2024-05-27 07:20:57] [INFO ] Deduced a trap composed of 108 places in 63 ms of which 1 ms to minimize.
[2024-05-27 07:20:58] [INFO ] Deduced a trap composed of 92 places in 51 ms of which 1 ms to minimize.
[2024-05-27 07:20:58] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2024-05-27 07:20:58] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 11/781 constraints. Problems are: Problem set: 46 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/606 variables, and 781 constraints, problems are : Problem set: 46 solved, 349 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 351/395 constraints, Known Traps: 15/15 constraints]
After SMT, in 54967ms problems are : Problem set: 46 solved, 349 unsolved
Search for dead transitions found 46 dead transitions in 54975ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 210/419 places, 350/2158 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 168 transition count 332
Applied a total of 60 rules in 4 ms. Remains 168 /210 variables (removed 42) and now considering 332/350 (removed 18) transitions.
// Phase 1: matrix 332 rows 168 cols
[2024-05-27 07:21:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:21:06] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 07:21:06] [INFO ] Invariant cache hit.
[2024-05-27 07:21:06] [INFO ] State equation strengthened by 194 read => feed constraints.
[2024-05-27 07:21:07] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 168/419 places, 332/2158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56354 ms. Remains : 168/419 places, 332/2158 transitions.
[2024-05-27 07:21:07] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:21:07] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:21:07] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-27 07:21:07] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:21:07] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:21:07] [INFO ] Time to serialize gal into /tmp/CTLFireability9665075639860360790.gal : 3 ms
[2024-05-27 07:21:07] [INFO ] Time to serialize properties into /tmp/CTLFireability16254070582388809411.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/CTLFireability9665075639860360790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16254070582388809411.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,218376,3.37647,109760,2,6667,5,196950,6,0,1004,159772,0


Converting to forward existential form...Done !
original formula: A((EG(!(((s1>=1)&&(l3937>=1)))) + ((s1>=1)&&(l3934>=1))) U (AG(((s1>=1)&&(l3913>=1))) * (EX(EF((((s1>=1)&&(l195>=1))||((s1>=1)&&(l3925>=1...187
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !(((s1>=1)&&(l3913>=1))))) * (EX(E(TRUE U (((s1>=1)&&(l195>=1))||((s1>=1)&&(l3925>=...536
Reverse transition relation is NOT exact ! Due to transitions t1, t21, t22, t23, t24, t25, t26, t27, t28, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42,...1282
(forward)formula 0,0,11.3132,300924,1,0,704,1.28188e+06,698,299,7200,745311,917
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 375 transition count 814
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 375 transition count 814
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 108 place count 375 transition count 794
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 174 place count 309 transition count 728
Iterating global reduction 1 with 66 rules applied. Total rules applied 240 place count 309 transition count 728
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 324 place count 309 transition count 644
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 428 place count 205 transition count 540
Iterating global reduction 2 with 104 rules applied. Total rules applied 532 place count 205 transition count 540
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 2 with 168 rules applied. Total rules applied 700 place count 205 transition count 372
Applied a total of 700 rules in 47 ms. Remains 205 /419 variables (removed 214) and now considering 372/2158 (removed 1786) transitions.
// Phase 1: matrix 372 rows 205 cols
[2024-05-27 07:21:18] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 07:21:18] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-27 07:21:18] [INFO ] Invariant cache hit.
[2024-05-27 07:21:19] [INFO ] State equation strengthened by 182 read => feed constraints.
[2024-05-27 07:21:19] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2024-05-27 07:21:19] [INFO ] Redundant transitions in 12 ms returned []
Running 371 sub problems to find dead transitions.
[2024-05-27 07:21:19] [INFO ] Invariant cache hit.
[2024-05-27 07:21:19] [INFO ] State equation strengthened by 182 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/205 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 4 (OVERLAPS) 372/577 variables, 205/208 constraints. Problems are: Problem set: 24 solved, 347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 182/390 constraints. Problems are: Problem set: 24 solved, 347 unsolved
[2024-05-27 07:21:27] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD132 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 1/391 constraints. Problems are: Problem set: 29 solved, 342 unsolved
[2024-05-27 07:21:34] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
[2024-05-27 07:21:35] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-05-27 07:21:36] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 3/394 constraints. Problems are: Problem set: 44 solved, 327 unsolved
[2024-05-27 07:21:37] [INFO ] Deduced a trap composed of 99 places in 58 ms of which 1 ms to minimize.
[2024-05-27 07:21:37] [INFO ] Deduced a trap composed of 108 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:21:40] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 3/397 constraints. Problems are: Problem set: 44 solved, 327 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 0/397 constraints. Problems are: Problem set: 44 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 577/577 variables, and 397 constraints, problems are : Problem set: 44 solved, 327 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 182/182 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 44 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 2/2 constraints. Problems are: Problem set: 44 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 44 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 25/189 variables, 2/4 constraints. Problems are: Problem set: 44 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/4 constraints. Problems are: Problem set: 44 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 16/205 variables, 1/5 constraints. Problems are: Problem set: 44 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 5/10 constraints. Problems are: Problem set: 44 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/10 constraints. Problems are: Problem set: 44 solved, 327 unsolved
At refinement iteration 7 (OVERLAPS) 372/577 variables, 205/215 constraints. Problems are: Problem set: 44 solved, 327 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 182/397 constraints. Problems are: Problem set: 44 solved, 327 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 327/724 constraints. Problems are: Problem set: 44 solved, 327 unsolved
[2024-05-27 07:22:08] [INFO ] Deduced a trap composed of 101 places in 57 ms of which 2 ms to minimize.
[2024-05-27 07:22:09] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2024-05-27 07:22:09] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 2 ms to minimize.
Problem TDEAD315 is UNSAT
[2024-05-27 07:22:09] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 1 ms to minimize.
[2024-05-27 07:22:09] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
Problem TDEAD319 is UNSAT
[2024-05-27 07:22:09] [INFO ] Deduced a trap composed of 94 places in 64 ms of which 1 ms to minimize.
[2024-05-27 07:22:10] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 7/731 constraints. Problems are: Problem set: 46 solved, 325 unsolved
[2024-05-27 07:22:20] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/577 variables, and 732 constraints, problems are : Problem set: 46 solved, 325 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 182/182 constraints, PredecessorRefiner: 327/371 constraints, Known Traps: 15/15 constraints]
After SMT, in 60773ms problems are : Problem set: 46 solved, 325 unsolved
Search for dead transitions found 46 dead transitions in 60776ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 205/419 places, 326/2158 transitions.
Graph (complete) has 691 edges and 205 vertex of which 163 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 163 transition count 308
Applied a total of 19 rules in 18 ms. Remains 163 /205 variables (removed 42) and now considering 308/326 (removed 18) transitions.
// Phase 1: matrix 308 rows 163 cols
[2024-05-27 07:22:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:22:20] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 07:22:20] [INFO ] Invariant cache hit.
[2024-05-27 07:22:20] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-05-27 07:22:20] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 163/419 places, 308/2158 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 62088 ms. Remains : 163/419 places, 308/2158 transitions.
[2024-05-27 07:22:20] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:22:20] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:22:20] [INFO ] Input system was already deterministic with 308 transitions.
[2024-05-27 07:22:20] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:22:20] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:22:20] [INFO ] Time to serialize gal into /tmp/CTLFireability8430955293838575822.gal : 1 ms
[2024-05-27 07:22:20] [INFO ] Time to serialize properties into /tmp/CTLFireability14491262393745215100.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/CTLFireability8430955293838575822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14491262393745215100.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,218071,2.20053,75972,2,6934,5,141607,6,0,960,124289,0


Converting to forward existential form...Done !
original formula: AG((!(A(((s1>=1)&&(l3933>=1)) U ((AG(((s1>=1)&&(l3939>=1))) * (s1>=1)) * (l2795>=1)))) + AG((((s1>=1)&&(l3922>=1))||((s1>=1)&&(l3919>=1))...159
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(!((E(!(((!(E(TRUE U !(((s1>=1)&&(l3939>=1))))) * (s1>=1)) * (l2795>=1))) U (!(((s1...392
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t11, t12, t17, t18, t19, t20, t21, t22, t23, t24, t25, t31, t32, t33, t34, t35, ...1172
(forward)formula 0,1,8.72414,256404,1,0,577,1.05254e+06,647,234,6949,612107,731
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 383 transition count 1072
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 383 transition count 1072
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 98 place count 383 transition count 1046
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 125 place count 356 transition count 1019
Iterating global reduction 1 with 27 rules applied. Total rules applied 152 place count 356 transition count 1019
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 185 place count 356 transition count 986
Discarding 105 places :
Symmetric choice reduction at 2 with 105 rule applications. Total rules 290 place count 251 transition count 881
Iterating global reduction 2 with 105 rules applied. Total rules applied 395 place count 251 transition count 881
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 650 place count 251 transition count 626
Applied a total of 650 rules in 34 ms. Remains 251 /419 variables (removed 168) and now considering 626/2158 (removed 1532) transitions.
// Phase 1: matrix 626 rows 251 cols
[2024-05-27 07:22:29] [INFO ] Computed 3 invariants in 5 ms
[2024-05-27 07:22:29] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-27 07:22:29] [INFO ] Invariant cache hit.
[2024-05-27 07:22:30] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-27 07:22:30] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
Running 625 sub problems to find dead transitions.
[2024-05-27 07:22:30] [INFO ] Invariant cache hit.
[2024-05-27 07:22:30] [INFO ] State equation strengthened by 396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (OVERLAPS) 1/251 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
At refinement iteration 4 (OVERLAPS) 626/877 variables, 251/254 constraints. Problems are: Problem set: 24 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/877 variables, 396/650 constraints. Problems are: Problem set: 24 solved, 601 unsolved
[2024-05-27 07:22:46] [INFO ] Deduced a trap composed of 100 places in 69 ms of which 2 ms to minimize.
[2024-05-27 07:22:47] [INFO ] Deduced a trap composed of 89 places in 52 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
[2024-05-27 07:22:47] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 3/653 constraints. Problems are: Problem set: 44 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 877/877 variables, and 653 constraints, problems are : Problem set: 44 solved, 581 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 251/251 constraints, ReadFeed: 396/396 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 44 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 25/235 variables, 2/2 constraints. Problems are: Problem set: 44 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/2 constraints. Problems are: Problem set: 44 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 16/251 variables, 1/3 constraints. Problems are: Problem set: 44 solved, 581 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 3/6 constraints. Problems are: Problem set: 44 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/6 constraints. Problems are: Problem set: 44 solved, 581 unsolved
At refinement iteration 6 (OVERLAPS) 626/877 variables, 251/257 constraints. Problems are: Problem set: 44 solved, 581 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/877 variables, 396/653 constraints. Problems are: Problem set: 44 solved, 581 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/877 variables, 581/1234 constraints. Problems are: Problem set: 44 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 877/877 variables, and 1234 constraints, problems are : Problem set: 44 solved, 581 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 251/251 constraints, ReadFeed: 396/396 constraints, PredecessorRefiner: 581/625 constraints, Known Traps: 3/3 constraints]
After SMT, in 61687ms problems are : Problem set: 44 solved, 581 unsolved
Search for dead transitions found 44 dead transitions in 61696ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in LTL mode, iteration 1 : 251/419 places, 582/2158 transitions.
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 211 transition count 566
Applied a total of 56 rules in 4 ms. Remains 211 /251 variables (removed 40) and now considering 566/582 (removed 16) transitions.
// Phase 1: matrix 566 rows 211 cols
[2024-05-27 07:23:32] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:23:32] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-27 07:23:32] [INFO ] Invariant cache hit.
[2024-05-27 07:23:32] [INFO ] State equation strengthened by 388 read => feed constraints.
[2024-05-27 07:23:33] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 211/419 places, 566/2158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63756 ms. Remains : 211/419 places, 566/2158 transitions.
[2024-05-27 07:23:33] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:23:33] [INFO ] Flatten gal took : 13 ms
[2024-05-27 07:23:33] [INFO ] Input system was already deterministic with 566 transitions.
[2024-05-27 07:23:33] [INFO ] Flatten gal took : 12 ms
[2024-05-27 07:23:33] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:23:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10354110586315394106.gal : 2 ms
[2024-05-27 07:23:33] [INFO ] Time to serialize properties into /tmp/CTLFireability892683421506646890.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/CTLFireability10354110586315394106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability892683421506646890.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,414336,5.98158,180620,2,7972,5,337493,6,0,1410,181330,0


Converting to forward existential form...Done !
original formula: (E((!(((EX(((s1>=1)&&(l3911>=1))) + !(EX(((p36>=1)&&(l0>=1))))) + ((s1>=1)&&(l3911>=1)))) + ((s1>=1)&&(l3918>=1))) U ((((s1>=1)&&(l3932>=...494
=> equivalent forward existential formula: ([(FwdU((Init * !(E((!(((EX(((s1>=1)&&(l3911>=1))) + !(EX(((p36>=1)&&(l0>=1))))) + ((s1>=1)&&(l3911>=1)))) + ((s...985
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t50, t51, t52,...2321
(forward)formula 0,0,16.0495,359448,1,0,739,1.01113e+06,1170,311,10523,527279,1221
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 372 transition count 711
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 372 transition count 711
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 372 transition count 696
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 177 place count 304 transition count 628
Iterating global reduction 1 with 68 rules applied. Total rules applied 245 place count 304 transition count 628
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 307 place count 304 transition count 566
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 419 place count 192 transition count 454
Iterating global reduction 2 with 112 rules applied. Total rules applied 531 place count 192 transition count 454
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 663 place count 192 transition count 322
Applied a total of 663 rules in 23 ms. Remains 192 /419 variables (removed 227) and now considering 322/2158 (removed 1836) transitions.
// Phase 1: matrix 322 rows 192 cols
[2024-05-27 07:23:49] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 07:23:49] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-27 07:23:49] [INFO ] Invariant cache hit.
[2024-05-27 07:23:49] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-27 07:23:50] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-27 07:23:50] [INFO ] Invariant cache hit.
[2024-05-27 07:23:50] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
At refinement iteration 4 (OVERLAPS) 322/514 variables, 192/195 constraints. Problems are: Problem set: 24 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 143/338 constraints. Problems are: Problem set: 24 solved, 297 unsolved
[2024-05-27 07:23:56] [INFO ] Deduced a trap composed of 97 places in 41 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
[2024-05-27 07:23:56] [INFO ] Deduced a trap composed of 97 places in 45 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:23:56] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
[2024-05-27 07:23:56] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
[2024-05-27 07:23:58] [INFO ] Deduced a trap composed of 105 places in 77 ms of which 2 ms to minimize.
[2024-05-27 07:23:58] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2024-05-27 07:23:58] [INFO ] Deduced a trap composed of 102 places in 53 ms of which 1 ms to minimize.
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 7/345 constraints. Problems are: Problem set: 46 solved, 275 unsolved
[2024-05-27 07:24:03] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 1/346 constraints. Problems are: Problem set: 46 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 0/346 constraints. Problems are: Problem set: 46 solved, 275 unsolved
[2024-05-27 07:24:08] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/514 variables, 1/347 constraints. Problems are: Problem set: 46 solved, 275 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/347 constraints. Problems are: Problem set: 46 solved, 275 unsolved
[2024-05-27 07:24:15] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/514 variables, 1/348 constraints. Problems are: Problem set: 46 solved, 275 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/348 constraints. Problems are: Problem set: 46 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/514 variables, and 348 constraints, problems are : Problem set: 46 solved, 275 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 46 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 27/176 variables, 2/2 constraints. Problems are: Problem set: 46 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 1/3 constraints. Problems are: Problem set: 46 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/3 constraints. Problems are: Problem set: 46 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 16/192 variables, 1/4 constraints. Problems are: Problem set: 46 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 9/13 constraints. Problems are: Problem set: 46 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/13 constraints. Problems are: Problem set: 46 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 322/514 variables, 192/205 constraints. Problems are: Problem set: 46 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 143/348 constraints. Problems are: Problem set: 46 solved, 275 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 275/623 constraints. Problems are: Problem set: 46 solved, 275 unsolved
[2024-05-27 07:24:31] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2024-05-27 07:24:37] [INFO ] Deduced a trap composed of 107 places in 60 ms of which 2 ms to minimize.
[2024-05-27 07:24:37] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 3/626 constraints. Problems are: Problem set: 46 solved, 275 unsolved
[2024-05-27 07:24:48] [INFO ] Deduced a trap composed of 100 places in 52 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 1/627 constraints. Problems are: Problem set: 46 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 627 constraints, problems are : Problem set: 46 solved, 275 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 275/321 constraints, Known Traps: 14/14 constraints]
After SMT, in 60611ms problems are : Problem set: 46 solved, 275 unsolved
Search for dead transitions found 46 dead transitions in 60617ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 192/419 places, 276/2158 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 150 transition count 258
Applied a total of 60 rules in 1 ms. Remains 150 /192 variables (removed 42) and now considering 258/276 (removed 18) transitions.
// Phase 1: matrix 258 rows 150 cols
[2024-05-27 07:24:51] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:24:51] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-27 07:24:51] [INFO ] Invariant cache hit.
[2024-05-27 07:24:51] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-27 07:24:51] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/419 places, 258/2158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61629 ms. Remains : 150/419 places, 258/2158 transitions.
[2024-05-27 07:24:51] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:24:51] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:24:51] [INFO ] Input system was already deterministic with 258 transitions.
[2024-05-27 07:24:51] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:24:51] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:24:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1216735494683076453.gal : 1 ms
[2024-05-27 07:24:51] [INFO ] Time to serialize properties into /tmp/CTLFireability1107620322013652977.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/CTLFireability1216735494683076453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1107620322013652977.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,217416,0.445402,21812,2,4593,5,45745,6,0,858,27043,0


Converting to forward existential form...Done !
original formula: AX(A(AF(AG(AF(((s1>=1)&&(l195>=1))))) U EG(AX((((s1>=1)&&(l3936>=1))||((s1>=1)&&(l3913>=1)))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(EG(!(EX(!((((s1>=1)&&(l3936>=1))||((s1>=1)&&(l3913>=1))))))))) * !(!(EG(!(!(E(TRUE U !(!(EG(...356
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30,...972
Using saturation style SCC detection
(forward)formula 0,0,4.73845,154588,1,0,610,521839,545,276,6134,439975,656
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 371 transition count 660
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 371 transition count 660
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 107 place count 371 transition count 649
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 176 place count 302 transition count 580
Iterating global reduction 1 with 69 rules applied. Total rules applied 245 place count 302 transition count 580
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 297 place count 302 transition count 528
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 413 place count 186 transition count 412
Iterating global reduction 2 with 116 rules applied. Total rules applied 529 place count 186 transition count 412
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 645 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 647 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 649 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 650 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 651 place count 183 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 652 place count 183 transition count 268
Applied a total of 652 rules in 22 ms. Remains 183 /419 variables (removed 236) and now considering 268/2158 (removed 1890) transitions.
// Phase 1: matrix 268 rows 183 cols
[2024-05-27 07:24:56] [INFO ] Computed 3 invariants in 8 ms
[2024-05-27 07:24:56] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-27 07:24:56] [INFO ] Invariant cache hit.
[2024-05-27 07:24:56] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-27 07:24:56] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-05-27 07:24:56] [INFO ] Invariant cache hit.
[2024-05-27 07:24:56] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 4 (OVERLAPS) 268/451 variables, 183/186 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 95/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
[2024-05-27 07:25:01] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD85 is UNSAT
[2024-05-27 07:25:02] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 2/283 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/283 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 0/451 variables, 0/283 constraints. Problems are: Problem set: 40 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 283 constraints, problems are : Problem set: 40 solved, 227 unsolved in 11292 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 40 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 24/169 variables, 2/2 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 14/183 variables, 1/3 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 2/5 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 268/451 variables, 183/188 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 95/283 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 227/510 constraints. Problems are: Problem set: 40 solved, 227 unsolved
[2024-05-27 07:25:14] [INFO ] Deduced a trap composed of 91 places in 62 ms of which 1 ms to minimize.
[2024-05-27 07:25:15] [INFO ] Deduced a trap composed of 100 places in 53 ms of which 1 ms to minimize.
[2024-05-27 07:25:15] [INFO ] Deduced a trap composed of 88 places in 48 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-27 07:25:15] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-27 07:25:15] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
[2024-05-27 07:25:19] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
[2024-05-27 07:25:19] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
[2024-05-27 07:25:19] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-05-27 07:25:19] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2024-05-27 07:25:20] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
[2024-05-27 07:25:20] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 11/521 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/521 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/451 variables, 0/521 constraints. Problems are: Problem set: 46 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 521 constraints, problems are : Problem set: 46 solved, 221 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 227/267 constraints, Known Traps: 13/13 constraints]
After SMT, in 41736ms problems are : Problem set: 46 solved, 221 unsolved
Search for dead transitions found 46 dead transitions in 41740ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 183/419 places, 222/2158 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 141 transition count 204
Applied a total of 60 rules in 1 ms. Remains 141 /183 variables (removed 42) and now considering 204/222 (removed 18) transitions.
// Phase 1: matrix 204 rows 141 cols
[2024-05-27 07:25:38] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:25:38] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-27 07:25:38] [INFO ] Invariant cache hit.
[2024-05-27 07:25:38] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-27 07:25:38] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/419 places, 204/2158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42610 ms. Remains : 141/419 places, 204/2158 transitions.
[2024-05-27 07:25:38] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:25:38] [INFO ] Flatten gal took : 4 ms
[2024-05-27 07:25:38] [INFO ] Input system was already deterministic with 204 transitions.
[2024-05-27 07:25:38] [INFO ] Flatten gal took : 4 ms
[2024-05-27 07:25:38] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:25:38] [INFO ] Time to serialize gal into /tmp/CTLFireability4423594659764120436.gal : 1 ms
[2024-05-27 07:25:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1799997923510758645.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/CTLFireability4423594659764120436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1799997923510758645.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,217078,0.456761,22160,2,4724,5,46149,6,0,768,29971,0


Converting to forward existential form...Done !
original formula: AF(EX(((s1>=1)&&(l3936>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((s1>=1)&&(l3936>=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, t71, t72, t73, t74, t79,...662
(forward)formula 0,0,4.38648,145452,1,0,534,473699,430,252,5365,468002,539
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 372 transition count 711
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 372 transition count 711
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 372 transition count 696
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 177 place count 304 transition count 628
Iterating global reduction 1 with 68 rules applied. Total rules applied 245 place count 304 transition count 628
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 307 place count 304 transition count 566
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 419 place count 192 transition count 454
Iterating global reduction 2 with 112 rules applied. Total rules applied 531 place count 192 transition count 454
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 659 place count 192 transition count 326
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 661 place count 190 transition count 300
Iterating global reduction 3 with 2 rules applied. Total rules applied 663 place count 190 transition count 300
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 664 place count 189 transition count 299
Iterating global reduction 3 with 1 rules applied. Total rules applied 665 place count 189 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 666 place count 189 transition count 298
Applied a total of 666 rules in 26 ms. Remains 189 /419 variables (removed 230) and now considering 298/2158 (removed 1860) transitions.
// Phase 1: matrix 298 rows 189 cols
[2024-05-27 07:25:43] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 07:25:43] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-27 07:25:43] [INFO ] Invariant cache hit.
[2024-05-27 07:25:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 07:25:43] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2024-05-27 07:25:43] [INFO ] Invariant cache hit.
[2024-05-27 07:25:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
At refinement iteration 4 (OVERLAPS) 298/487 variables, 189/192 constraints. Problems are: Problem set: 24 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 120/312 constraints. Problems are: Problem set: 24 solved, 273 unsolved
[2024-05-27 07:25:49] [INFO ] Deduced a trap composed of 99 places in 55 ms of which 2 ms to minimize.
[2024-05-27 07:25:49] [INFO ] Deduced a trap composed of 88 places in 51 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-27 07:25:49] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
[2024-05-27 07:25:50] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-27 07:25:50] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 3 ms to minimize.
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 5/317 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/317 constraints. Problems are: Problem set: 44 solved, 253 unsolved
[2024-05-27 07:25:56] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2024-05-27 07:25:56] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 1 ms to minimize.
[2024-05-27 07:25:56] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/487 variables, 3/320 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 0/320 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 10 (OVERLAPS) 0/487 variables, 0/320 constraints. Problems are: Problem set: 44 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 320 constraints, problems are : Problem set: 44 solved, 253 unsolved in 18204 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 44 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 2/2 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/2 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 1/3 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 40/189 variables, 2/5 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 6/11 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/11 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 298/487 variables, 189/200 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 120/320 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 253/573 constraints. Problems are: Problem set: 44 solved, 253 unsolved
[2024-05-27 07:26:14] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 1 ms to minimize.
[2024-05-27 07:26:14] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
[2024-05-27 07:26:14] [INFO ] Deduced a trap composed of 94 places in 49 ms of which 1 ms to minimize.
Problem TDEAD241 is UNSAT
[2024-05-27 07:26:14] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:26:14] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
[2024-05-27 07:26:15] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:26:15] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:26:15] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
[2024-05-27 07:26:15] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 9/582 constraints. Problems are: Problem set: 46 solved, 251 unsolved
[2024-05-27 07:26:25] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 1/583 constraints. Problems are: Problem set: 46 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 583 constraints, problems are : Problem set: 46 solved, 251 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 253/297 constraints, Known Traps: 18/18 constraints]
After SMT, in 48733ms problems are : Problem set: 46 solved, 251 unsolved
Search for dead transitions found 46 dead transitions in 48738ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/419 places, 252/2158 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 147 transition count 234
Applied a total of 60 rules in 1 ms. Remains 147 /189 variables (removed 42) and now considering 234/252 (removed 18) transitions.
// Phase 1: matrix 234 rows 147 cols
[2024-05-27 07:26:32] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:26:32] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 07:26:32] [INFO ] Invariant cache hit.
[2024-05-27 07:26:32] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-27 07:26:32] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/419 places, 234/2158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49692 ms. Remains : 147/419 places, 234/2158 transitions.
[2024-05-27 07:26:33] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:26:33] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:26:33] [INFO ] Input system was already deterministic with 234 transitions.
[2024-05-27 07:26:33] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:26:33] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:26:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16346947285343975209.gal : 1 ms
[2024-05-27 07:26:33] [INFO ] Time to serialize properties into /tmp/CTLFireability4707798509726771134.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/CTLFireability16346947285343975209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4707798509726771134.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,247338,0.463278,22120,2,4695,5,46730,6,0,822,30441,0


Converting to forward existential form...Done !
original formula: AG(E(((s1>=1)&&(l3924>=1)) U !(AG(AX(((s1>=1)&&(l3936>=1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((s1>=1)&&(l3924>=1)) U !(!(E(TRUE U !(!(EX(!(((s1>=1)&&(l3936>=1))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t16, t17, t18, t19, t40, t41, t42, t45, t54, t57, t63, t68, t79, t80, t81, t82, t87,...803
(forward)formula 0,0,2.66596,94328,1,0,414,349324,494,174,5858,229565,491
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 372 transition count 711
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 372 transition count 711
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 111 place count 372 transition count 694
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 179 place count 304 transition count 626
Iterating global reduction 1 with 68 rules applied. Total rules applied 247 place count 304 transition count 626
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 307 place count 304 transition count 566
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 419 place count 192 transition count 454
Iterating global reduction 2 with 112 rules applied. Total rules applied 531 place count 192 transition count 454
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 667 place count 192 transition count 318
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 669 place count 190 transition count 292
Iterating global reduction 3 with 2 rules applied. Total rules applied 671 place count 190 transition count 292
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 672 place count 189 transition count 291
Iterating global reduction 3 with 1 rules applied. Total rules applied 673 place count 189 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 674 place count 189 transition count 290
Applied a total of 674 rules in 43 ms. Remains 189 /419 variables (removed 230) and now considering 290/2158 (removed 1868) transitions.
// Phase 1: matrix 290 rows 189 cols
[2024-05-27 07:26:35] [INFO ] Computed 3 invariants in 6 ms
[2024-05-27 07:26:35] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-27 07:26:35] [INFO ] Invariant cache hit.
[2024-05-27 07:26:35] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-27 07:26:36] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-05-27 07:26:36] [INFO ] Redundant transitions in 3 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-27 07:26:36] [INFO ] Invariant cache hit.
[2024-05-27 07:26:36] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
At refinement iteration 4 (OVERLAPS) 290/479 variables, 189/192 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 112/304 constraints. Problems are: Problem set: 24 solved, 265 unsolved
[2024-05-27 07:26:41] [INFO ] Deduced a trap composed of 105 places in 54 ms of which 1 ms to minimize.
[2024-05-27 07:26:41] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:26:41] [INFO ] Deduced a trap composed of 96 places in 49 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 3/307 constraints. Problems are: Problem set: 31 solved, 258 unsolved
[2024-05-27 07:26:45] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 1/308 constraints. Problems are: Problem set: 31 solved, 258 unsolved
[2024-05-27 07:26:48] [INFO ] Deduced a trap composed of 114 places in 71 ms of which 3 ms to minimize.
[2024-05-27 07:26:48] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 2 ms to minimize.
[2024-05-27 07:26:48] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-27 07:26:48] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 4/312 constraints. Problems are: Problem set: 31 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/312 constraints. Problems are: Problem set: 31 solved, 258 unsolved
At refinement iteration 10 (OVERLAPS) 0/479 variables, 0/312 constraints. Problems are: Problem set: 31 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 312 constraints, problems are : Problem set: 31 solved, 258 unsolved in 18147 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 31 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 2/2 constraints. Problems are: Problem set: 31 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 31 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 21/179 variables, 2/4 constraints. Problems are: Problem set: 31 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/5 constraints. Problems are: Problem set: 31 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/5 constraints. Problems are: Problem set: 31 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 10/189 variables, 1/6 constraints. Problems are: Problem set: 31 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 5/11 constraints. Problems are: Problem set: 31 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/11 constraints. Problems are: Problem set: 31 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 290/479 variables, 189/200 constraints. Problems are: Problem set: 31 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 112/312 constraints. Problems are: Problem set: 31 solved, 258 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 258/570 constraints. Problems are: Problem set: 31 solved, 258 unsolved
[2024-05-27 07:27:03] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 1 ms to minimize.
[2024-05-27 07:27:04] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-27 07:27:04] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
[2024-05-27 07:27:04] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
[2024-05-27 07:27:08] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
[2024-05-27 07:27:08] [INFO ] Deduced a trap composed of 115 places in 57 ms of which 1 ms to minimize.
Problem TDEAD243 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
[2024-05-27 07:27:09] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2024-05-27 07:27:09] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 8/578 constraints. Problems are: Problem set: 46 solved, 243 unsolved
[2024-05-27 07:27:18] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 1 ms to minimize.
[2024-05-27 07:27:18] [INFO ] Deduced a trap composed of 101 places in 60 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 2/580 constraints. Problems are: Problem set: 46 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 580 constraints, problems are : Problem set: 46 solved, 243 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 258/289 constraints, Known Traps: 18/18 constraints]
After SMT, in 48663ms problems are : Problem set: 46 solved, 243 unsolved
Search for dead transitions found 46 dead transitions in 48665ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 189/419 places, 244/2158 transitions.
Graph (complete) has 582 edges and 189 vertex of which 147 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 147 transition count 226
Applied a total of 19 rules in 8 ms. Remains 147 /189 variables (removed 42) and now considering 226/244 (removed 18) transitions.
// Phase 1: matrix 226 rows 147 cols
[2024-05-27 07:27:24] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:27:25] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-27 07:27:25] [INFO ] Invariant cache hit.
[2024-05-27 07:27:25] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-27 07:27:25] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 147/419 places, 226/2158 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 49611 ms. Remains : 147/419 places, 226/2158 transitions.
[2024-05-27 07:27:25] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:27:25] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:27:25] [INFO ] Input system was already deterministic with 226 transitions.
[2024-05-27 07:27:25] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:27:25] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:27:25] [INFO ] Time to serialize gal into /tmp/CTLFireability9147867688933893666.gal : 4 ms
[2024-05-27 07:27:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15777227564287488418.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/CTLFireability9147867688933893666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15777227564287488418.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,247338,0.378854,20476,2,4718,5,45486,6,0,814,29377,0


Converting to forward existential form...Done !
original formula: (EG(((s1<1)||(l3922<1))) + E(((s1>=1)&&(l3938>=1)) U !(((s1<1)||(l3922<1)))))
=> equivalent forward existential formula: ([FwdG(Init,((s1<1)||(l3922<1)))] != FALSE + [(FwdU(Init,((s1>=1)&&(l3938>=1))) * !(((s1<1)||(l3922<1))))] != FA...159
Hit Full ! (commute/partial/dont) 9/0/217
(forward)formula 0,1,3.59235,123872,1,0,39,433295,19,4,4248,288671,36
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 371 transition count 660
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 371 transition count 660
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 107 place count 371 transition count 649
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 176 place count 302 transition count 580
Iterating global reduction 1 with 69 rules applied. Total rules applied 245 place count 302 transition count 580
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 297 place count 302 transition count 528
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 413 place count 186 transition count 412
Iterating global reduction 2 with 116 rules applied. Total rules applied 529 place count 186 transition count 412
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 645 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 647 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 649 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 650 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 651 place count 183 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 652 place count 183 transition count 268
Applied a total of 652 rules in 16 ms. Remains 183 /419 variables (removed 236) and now considering 268/2158 (removed 1890) transitions.
// Phase 1: matrix 268 rows 183 cols
[2024-05-27 07:27:29] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 07:27:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 07:27:29] [INFO ] Invariant cache hit.
[2024-05-27 07:27:29] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-27 07:27:29] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-05-27 07:27:29] [INFO ] Invariant cache hit.
[2024-05-27 07:27:29] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 4 (OVERLAPS) 268/451 variables, 183/186 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 95/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
[2024-05-27 07:27:33] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD85 is UNSAT
[2024-05-27 07:27:35] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 1 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 2/283 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/283 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 0/451 variables, 0/283 constraints. Problems are: Problem set: 40 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 283 constraints, problems are : Problem set: 40 solved, 227 unsolved in 11307 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 40 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 24/169 variables, 2/2 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 14/183 variables, 1/3 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 2/5 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 268/451 variables, 183/188 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 95/283 constraints. Problems are: Problem set: 40 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 227/510 constraints. Problems are: Problem set: 40 solved, 227 unsolved
[2024-05-27 07:27:47] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:27:47] [INFO ] Deduced a trap composed of 100 places in 61 ms of which 2 ms to minimize.
[2024-05-27 07:27:48] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-27 07:27:48] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 2 ms to minimize.
[2024-05-27 07:27:48] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
[2024-05-27 07:27:51] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 2 ms to minimize.
Problem TDEAD211 is UNSAT
[2024-05-27 07:27:52] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
[2024-05-27 07:27:52] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2024-05-27 07:27:52] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2024-05-27 07:27:52] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:27:52] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 11/521 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/521 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/451 variables, 0/521 constraints. Problems are: Problem set: 46 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 521 constraints, problems are : Problem set: 46 solved, 221 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 227/267 constraints, Known Traps: 13/13 constraints]
After SMT, in 41747ms problems are : Problem set: 46 solved, 221 unsolved
Search for dead transitions found 46 dead transitions in 41751ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 183/419 places, 222/2158 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 141 transition count 204
Applied a total of 60 rules in 3 ms. Remains 141 /183 variables (removed 42) and now considering 204/222 (removed 18) transitions.
// Phase 1: matrix 204 rows 141 cols
[2024-05-27 07:28:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:28:11] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 07:28:11] [INFO ] Invariant cache hit.
[2024-05-27 07:28:11] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-27 07:28:11] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/419 places, 204/2158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42570 ms. Remains : 141/419 places, 204/2158 transitions.
[2024-05-27 07:28:11] [INFO ] Flatten gal took : 4 ms
[2024-05-27 07:28:11] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:28:11] [INFO ] Input system was already deterministic with 204 transitions.
[2024-05-27 07:28:11] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:28:11] [INFO ] Flatten gal took : 4 ms
[2024-05-27 07:28:11] [INFO ] Time to serialize gal into /tmp/CTLFireability13264052566484922782.gal : 1 ms
[2024-05-27 07:28:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4382239598808458566.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/CTLFireability13264052566484922782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4382239598808458566.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,217078,0.466455,21900,2,4724,5,46149,6,0,768,29971,0


Converting to forward existential form...Done !
original formula: AF(EX(((s1>=1)&&(l3936>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((s1>=1)&&(l3936>=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, t71, t72, t73, t74, t79,...662
(forward)formula 0,0,4.44745,145640,1,0,534,473699,430,252,5315,467814,539
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 2158/2158 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 373 transition count 762
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 373 transition count 762
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 109 place count 373 transition count 745
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 176 place count 306 transition count 678
Iterating global reduction 1 with 67 rules applied. Total rules applied 243 place count 306 transition count 678
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 317 place count 306 transition count 604
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 425 place count 198 transition count 496
Iterating global reduction 2 with 108 rules applied. Total rules applied 533 place count 198 transition count 496
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 2 with 156 rules applied. Total rules applied 689 place count 198 transition count 340
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 690 place count 197 transition count 327
Iterating global reduction 3 with 1 rules applied. Total rules applied 691 place count 197 transition count 327
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 692 place count 196 transition count 326
Iterating global reduction 3 with 1 rules applied. Total rules applied 693 place count 196 transition count 326
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 697 place count 192 transition count 322
Iterating global reduction 3 with 4 rules applied. Total rules applied 701 place count 192 transition count 322
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 725 place count 192 transition count 298
Applied a total of 725 rules in 25 ms. Remains 192 /419 variables (removed 227) and now considering 298/2158 (removed 1860) transitions.
// Phase 1: matrix 298 rows 192 cols
[2024-05-27 07:28:16] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 07:28:16] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-27 07:28:16] [INFO ] Invariant cache hit.
[2024-05-27 07:28:16] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-05-27 07:28:16] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2024-05-27 07:28:16] [INFO ] Invariant cache hit.
[2024-05-27 07:28:16] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
At refinement iteration 4 (OVERLAPS) 298/490 variables, 192/195 constraints. Problems are: Problem set: 24 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 119/314 constraints. Problems are: Problem set: 24 solved, 273 unsolved
[2024-05-27 07:28:23] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 1 ms to minimize.
[2024-05-27 07:28:23] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2024-05-27 07:28:23] [INFO ] Deduced a trap composed of 105 places in 68 ms of which 1 ms to minimize.
[2024-05-27 07:28:23] [INFO ] Deduced a trap composed of 104 places in 65 ms of which 1 ms to minimize.
[2024-05-27 07:28:23] [INFO ] Deduced a trap composed of 105 places in 66 ms of which 1 ms to minimize.
[2024-05-27 07:28:23] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2024-05-27 07:28:23] [INFO ] Deduced a trap composed of 93 places in 68 ms of which 1 ms to minimize.
[2024-05-27 07:28:24] [INFO ] Deduced a trap composed of 94 places in 53 ms of which 1 ms to minimize.
[2024-05-27 07:28:24] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 2 ms to minimize.
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 9/323 constraints. Problems are: Problem set: 34 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/323 constraints. Problems are: Problem set: 34 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/490 variables, 0/323 constraints. Problems are: Problem set: 34 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 323 constraints, problems are : Problem set: 34 solved, 263 unsolved in 15254 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 34 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 34 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 21/180 variables, 2/2 constraints. Problems are: Problem set: 34 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 6/8 constraints. Problems are: Problem set: 34 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/8 constraints. Problems are: Problem set: 34 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 12/192 variables, 1/9 constraints. Problems are: Problem set: 34 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 3/12 constraints. Problems are: Problem set: 34 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 34 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 298/490 variables, 192/204 constraints. Problems are: Problem set: 34 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 119/323 constraints. Problems are: Problem set: 34 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 263/586 constraints. Problems are: Problem set: 34 solved, 263 unsolved
[2024-05-27 07:28:40] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 1 ms to minimize.
[2024-05-27 07:28:40] [INFO ] Deduced a trap composed of 100 places in 57 ms of which 1 ms to minimize.
[2024-05-27 07:28:41] [INFO ] Deduced a trap composed of 89 places in 54 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:28:42] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 2 ms to minimize.
[2024-05-27 07:28:43] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 1 ms to minimize.
[2024-05-27 07:28:43] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
[2024-05-27 07:28:46] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 1 ms to minimize.
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
[2024-05-27 07:28:46] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
[2024-05-27 07:28:46] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-05-27 07:28:47] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2024-05-27 07:28:47] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 11/597 constraints. Problems are: Problem set: 46 solved, 251 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 0/597 constraints. Problems are: Problem set: 46 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 597 constraints, problems are : Problem set: 46 solved, 251 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 263/297 constraints, Known Traps: 20/20 constraints]
After SMT, in 45803ms problems are : Problem set: 46 solved, 251 unsolved
Search for dead transitions found 46 dead transitions in 45808ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 192/419 places, 252/2158 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 150 transition count 234
Applied a total of 60 rules in 4 ms. Remains 150 /192 variables (removed 42) and now considering 234/252 (removed 18) transitions.
// Phase 1: matrix 234 rows 150 cols
[2024-05-27 07:29:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:29:02] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 07:29:02] [INFO ] Invariant cache hit.
[2024-05-27 07:29:02] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 07:29:02] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/419 places, 234/2158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46866 ms. Remains : 150/419 places, 234/2158 transitions.
[2024-05-27 07:29:02] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:29:02] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:29:02] [INFO ] Input system was already deterministic with 234 transitions.
[2024-05-27 07:29:02] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:29:02] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:29:02] [INFO ] Time to serialize gal into /tmp/CTLFireability18239057584621501667.gal : 1 ms
[2024-05-27 07:29:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17302721657998928963.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/CTLFireability18239057584621501667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17302721657998928963.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,157216,1.2698,48204,2,6409,5,94140,6,0,834,77033,0


Converting to forward existential form...Done !
original formula: AF((EX(((s1>=1)&&(l3933>=1))) * AG((AF(EX(((s1>=1)&&(l3935>=1)))) * ((s1<1)||(l3937<1))))))
=> equivalent forward existential formula: [FwdG(Init,!((EX(((s1>=1)&&(l3933>=1))) * !(E(TRUE U !((!(EG(!(EX(((s1>=1)&&(l3935>=1)))))) * ((s1<1)||(l3937<1)...172
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t11, t12, t21, t22, t23, t24, t25, t30, t31, t32, t33, t34, t35, t36, t37, t38, ...811
Using saturation style SCC detection
(forward)formula 0,0,10.8565,323712,1,0,531,1.28822e+06,501,244,6150,862484,612
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-27 07:29:14] [INFO ] Flatten gal took : 41 ms
[2024-05-27 07:29:14] [INFO ] Flatten gal took : 42 ms
Total runtime 995712 ms.

BK_STOP 1716794954163

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

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