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.r378-smll-171683810700058.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 SieveSingleMsgMbox-PT-d1m06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810700058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K 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 SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716896409903

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 11:40:11] [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-28 11:40:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:40:12] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-05-28 11:40:12] [INFO ] Transformed 1295 places.
[2024-05-28 11:40:12] [INFO ] Transformed 749 transitions.
[2024-05-28 11:40:12] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Deduced a syphon composed of 1036 places in 15 ms
Reduce places removed 1036 places and 0 transitions.
Support contains 63 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 289 place count 210 transition count 461
Iterating global reduction 1 with 32 rules applied. Total rules applied 321 place count 210 transition count 461
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 331 place count 210 transition count 451
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 345 place count 196 transition count 437
Iterating global reduction 2 with 14 rules applied. Total rules applied 359 place count 196 transition count 437
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 369 place count 186 transition count 426
Iterating global reduction 2 with 10 rules applied. Total rules applied 379 place count 186 transition count 426
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 413 place count 186 transition count 392
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 414 place count 185 transition count 391
Iterating global reduction 3 with 1 rules applied. Total rules applied 415 place count 185 transition count 391
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 416 place count 184 transition count 390
Iterating global reduction 3 with 1 rules applied. Total rules applied 417 place count 184 transition count 390
Applied a total of 417 rules in 133 ms. Remains 184 /259 variables (removed 75) and now considering 390/749 (removed 359) transitions.
// Phase 1: matrix 390 rows 184 cols
[2024-05-28 11:40:12] [INFO ] Computed 5 invariants in 47 ms
[2024-05-28 11:40:13] [INFO ] Implicit Places using invariants in 617 ms returned []
[2024-05-28 11:40:13] [INFO ] Invariant cache hit.
[2024-05-28 11:40:13] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-28 11:40:14] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 1986 ms to find 0 implicit places.
Running 389 sub problems to find dead transitions.
[2024-05-28 11:40:14] [INFO ] Invariant cache hit.
[2024-05-28 11:40:14] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-28 11:40:22] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 35 ms to minimize.
[2024-05-28 11:40:22] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-28 11:40:25] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-28 11:40:30] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-28 11:40:30] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-28 11:40:36] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/184 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-28 11:40:42] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 12 ms to minimize.
[2024-05-28 11:40:43] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 3 ms to minimize.
[2024-05-28 11:40:44] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 5 ms to minimize.
[2024-05-28 11:40:44] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 4 ms to minimize.
[2024-05-28 11:40:44] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 3 ms to minimize.
[2024-05-28 11:40:44] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 4 ms to minimize.
[2024-05-28 11:40:44] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/574 variables, and 18 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/184 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 1/184 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-28 11:40:53] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 3 ms to minimize.
[2024-05-28 11:40:53] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 3 ms to minimize.
[2024-05-28 11:40:53] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-28 11:40:56] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (OVERLAPS) 390/574 variables, 184/206 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 265/471 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 389/860 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 860 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 184/184 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 17/17 constraints]
After SMT, in 61793ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 61834ms
Starting structural reductions in LTL mode, iteration 1 : 184/259 places, 390/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64018 ms. Remains : 184/259 places, 390/749 transitions.
Support contains 63 out of 184 places after structural reductions.
[2024-05-28 11:41:16] [INFO ] Flatten gal took : 158 ms
[2024-05-28 11:41:17] [INFO ] Flatten gal took : 61 ms
[2024-05-28 11:41:17] [INFO ] Input system was already deterministic with 390 transitions.
Support contains 61 out of 184 places (down from 63) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 57 to 53
RANDOM walk for 40000 steps (8958 resets) in 4405 ms. (9 steps per ms) remains 48/53 properties
BEST_FIRST walk for 4002 steps (196 resets) in 79 ms. (50 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (176 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (195 resets) in 47 ms. (83 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (192 resets) in 56 ms. (70 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (175 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (186 resets) in 55 ms. (71 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (188 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (196 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (180 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (202 resets) in 28 ms. (138 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (199 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (183 resets) in 28 ms. (138 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (178 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (185 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (180 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (191 resets) in 46 ms. (85 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (172 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (170 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (182 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (175 resets) in 54 ms. (72 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (200 resets) in 49 ms. (80 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (415 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (306 resets) in 52 ms. (75 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4004 steps (192 resets) in 45 ms. (87 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (393 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (184 resets) in 36 ms. (108 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (171 resets) in 54 ms. (72 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (174 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (188 resets) in 73 ms. (54 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (193 resets) in 34 ms. (114 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (205 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (400 resets) in 59 ms. (66 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (159 resets) in 35 ms. (111 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (193 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (385 resets) in 81 ms. (48 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (184 resets) in 38 ms. (102 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (197 resets) in 44 ms. (88 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (185 resets) in 47 ms. (83 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (189 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (184 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (172 resets) in 49 ms. (80 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (167 resets) in 48 ms. (81 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (389 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (167 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (189 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (181 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (166 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
[2024-05-28 11:41:19] [INFO ] Invariant cache hit.
[2024-05-28 11:41:19] [INFO ] State equation strengthened by 265 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem AtomicPropp43 is UNSAT
At refinement iteration 1 (OVERLAPS) 74/129 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 46 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 3 (OVERLAPS) 39/168 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 384/552 variables, 168/173 constraints. Problems are: Problem set: 3 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 259/432 constraints. Problems are: Problem set: 3 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 0/432 constraints. Problems are: Problem set: 3 solved, 44 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp55 is UNSAT
At refinement iteration 8 (OVERLAPS) 22/574 variables, 16/448 constraints. Problems are: Problem set: 8 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 6/454 constraints. Problems are: Problem set: 8 solved, 39 unsolved
[2024-05-28 11:41:23] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-05-28 11:41:24] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 4 ms to minimize.
[2024-05-28 11:41:24] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 3 ms to minimize.
[2024-05-28 11:41:24] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 3 ms to minimize.
[2024-05-28 11:41:24] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 5/459 constraints. Problems are: Problem set: 8 solved, 39 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/574 variables, and 459 constraints, problems are : Problem set: 8 solved, 39 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 184/184 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 8 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 79/128 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 40/168 variables, 3/5 constraints. Problems are: Problem set: 8 solved, 39 unsolved
[2024-05-28 11:41:25] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 2 ms to minimize.
[2024-05-28 11:41:25] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2024-05-28 11:41:25] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 3/8 constraints. Problems are: Problem set: 8 solved, 39 unsolved
[2024-05-28 11:41:26] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 384/552 variables, 168/177 constraints. Problems are: Problem set: 8 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 259/436 constraints. Problems are: Problem set: 8 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 3/439 constraints. Problems are: Problem set: 8 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 0/439 constraints. Problems are: Problem set: 8 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 22/574 variables, 16/455 constraints. Problems are: Problem set: 8 solved, 39 unsolved
SMT process timed out in 10397ms, After SMT, problems are : Problem set: 8 solved, 39 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 390/390 transitions.
Graph (complete) has 673 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 183 transition count 388
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 180 transition count 385
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 180 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 180 transition count 384
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 179 transition count 383
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 179 transition count 383
Applied a total of 12 rules in 103 ms. Remains 179 /184 variables (removed 5) and now considering 383/390 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 179/184 places, 383/390 transitions.
RANDOM walk for 40000 steps (8955 resets) in 1453 ms. (27 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (186 resets) in 43 ms. (91 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (197 resets) in 45 ms. (87 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (175 resets) in 38 ms. (102 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (192 resets) in 69 ms. (57 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (186 resets) in 53 ms. (74 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (183 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (191 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (178 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (192 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (186 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (196 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (199 resets) in 28 ms. (137 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (208 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (167 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (198 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (193 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (203 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (179 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (435 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (317 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (194 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (417 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (185 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (182 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (173 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (183 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (189 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (405 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (187 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (198 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (436 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (200 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (186 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (188 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (198 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (403 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (183 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (172 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (193 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
Interrupted probabilistic random walk after 325226 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :37 out of 39
Probabilistic random walk after 325226 steps, saw 127913 distinct states, run finished after 3009 ms. (steps per millisecond=108 ) properties seen :37
// Phase 1: matrix 383 rows 179 cols
[2024-05-28 11:41:34] [INFO ] Computed 4 invariants in 5 ms
[2024-05-28 11:41:34] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/115 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 11:41:34] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 202/317 variables, 115/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 79/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 245/562 variables, 64/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 181/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/562 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 444 constraints, problems are : Problem set: 0 solved, 2 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/115 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 202/317 variables, 115/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 79/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 245/562 variables, 64/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 181/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/562 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 446 constraints, problems are : Problem set: 0 solved, 2 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1518ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 406 ms.
Support contains 3 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 383/383 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 150 transition count 192
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 150 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 150 transition count 190
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 87 place count 123 transition count 160
Iterating global reduction 1 with 27 rules applied. Total rules applied 114 place count 123 transition count 160
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 130 place count 123 transition count 144
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 146 place count 107 transition count 126
Iterating global reduction 2 with 16 rules applied. Total rules applied 162 place count 107 transition count 126
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 171 place count 107 transition count 117
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 177 place count 101 transition count 110
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 101 transition count 110
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 188 place count 96 transition count 105
Iterating global reduction 3 with 5 rules applied. Total rules applied 193 place count 96 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 197 place count 92 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 201 place count 92 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 203 place count 92 transition count 99
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 205 place count 90 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 90 transition count 97
Applied a total of 207 rules in 71 ms. Remains 90 /179 variables (removed 89) and now considering 97/383 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 90/179 places, 97/383 transitions.
RANDOM walk for 40000 steps (8901 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1973 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1919 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Probably explored full state space saw : 52215 states, properties seen :1
Probabilistic random walk after 130240 steps, saw 52215 distinct states, run finished after 908 ms. (steps per millisecond=143 ) properties seen :1
Explored full state space saw : 52215 states, properties seen :0
Exhaustive walk after 130240 steps, saw 52215 distinct states, run finished after 153 ms. (steps per millisecond=851 ) properties seen :0
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-05-28 11:41:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 11:41:37] [INFO ] Flatten gal took : 32 ms
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 11:41:37] [INFO ] Flatten gal took : 31 ms
[2024-05-28 11:41:37] [INFO ] Input system was already deterministic with 390 transitions.
Support contains 49 out of 184 places (down from 53) after GAL structural reductions.
Computed a total of 45 stabilizing places and 80 stable transitions
Graph (complete) has 743 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 157 transition count 231
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 157 transition count 231
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 157 transition count 222
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 86 place count 134 transition count 196
Iterating global reduction 1 with 23 rules applied. Total rules applied 109 place count 134 transition count 196
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 118 place count 134 transition count 187
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 132 place count 120 transition count 170
Iterating global reduction 2 with 14 rules applied. Total rules applied 146 place count 120 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 151 place count 120 transition count 165
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 155 place count 116 transition count 159
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 116 transition count 159
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 113 transition count 156
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 113 transition count 156
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 110 transition count 152
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 110 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 109 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 109 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 108 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 108 transition count 150
Applied a total of 175 rules in 63 ms. Remains 108 /184 variables (removed 76) and now considering 150/390 (removed 240) transitions.
// Phase 1: matrix 150 rows 108 cols
[2024-05-28 11:41:37] [INFO ] Computed 5 invariants in 4 ms
[2024-05-28 11:41:37] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-28 11:41:37] [INFO ] Invariant cache hit.
[2024-05-28 11:41:37] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-28 11:41:37] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-28 11:41:37] [INFO ] Redundant transitions in 5 ms returned []
Running 149 sub problems to find dead transitions.
[2024-05-28 11:41:37] [INFO ] Invariant cache hit.
[2024-05-28 11:41:37] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 11:41:39] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-28 11:41:39] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 1/108 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 11:41:41] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-05-28 11:41:41] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-28 11:41:41] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:41:41] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-28 11:41:42] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 3 ms to minimize.
[2024-05-28 11:41:42] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 6 ms to minimize.
[2024-05-28 11:41:42] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-28 11:41:42] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 150/258 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 79/202 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-28 11:41:44] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 2 ms to minimize.
[2024-05-28 11:41:45] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 204 constraints, problems are : Problem set: 0 solved, 149 unsolved in 12829 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 1/108 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 150/258 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 79/204 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 149/353 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 353 constraints, problems are : Problem set: 0 solved, 149 unsolved in 17418 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 12/12 constraints]
After SMT, in 30460ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 30462ms
Starting structural reductions in SI_CTL mode, iteration 1 : 108/184 places, 150/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31015 ms. Remains : 108/184 places, 150/390 transitions.
[2024-05-28 11:42:08] [INFO ] Flatten gal took : 11 ms
[2024-05-28 11:42:08] [INFO ] Flatten gal took : 11 ms
[2024-05-28 11:42:08] [INFO ] Input system was already deterministic with 150 transitions.
[2024-05-28 11:42:08] [INFO ] Flatten gal took : 10 ms
[2024-05-28 11:42:08] [INFO ] Flatten gal took : 9 ms
[2024-05-28 11:42:08] [INFO ] Time to serialize gal into /tmp/CTLFireability4958827452293690971.gal : 4 ms
[2024-05-28 11:42:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10851218012756442188.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4958827452293690971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10851218012756442188.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,170338,1.36977,30960,2,3856,5,102741,6,0,582,42291,0


Converting to forward existential form...Done !
original formula: EF(((AG((((s1<1)||(l1201<1))&&(((s1>=1)&&(l35>=1))||((s1>=1)&&(l66>=1))))) * (s1>=1)) * ((l1195>=1)&&(((s1<1)||(l164<1))||((l1189>=1)||(l...167
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((l1195>=1)&&(((s1<1)||(l164<1))||((l1189>=1)||(l199>=1))))) * (s1>=1)) * !(E(TRUE U !((((...231
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t13, t16, t17, t21, t25, t30, t31, t32, t36, t38, t40, t51, t52, t53, t54, t59, t62,...498
(forward)formula 0,0,2.77354,43236,1,0,260,165482,322,117,3936,85212,310
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 156 transition count 237
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 156 transition count 237
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 67 place count 156 transition count 226
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 91 place count 132 transition count 202
Iterating global reduction 1 with 24 rules applied. Total rules applied 115 place count 132 transition count 202
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 127 place count 132 transition count 190
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 141 place count 118 transition count 174
Iterating global reduction 2 with 14 rules applied. Total rules applied 155 place count 118 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 163 place count 118 transition count 166
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 167 place count 114 transition count 161
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 114 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 174 place count 111 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 177 place count 111 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 180 place count 108 transition count 154
Iterating global reduction 3 with 3 rules applied. Total rules applied 183 place count 108 transition count 154
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 188 place count 108 transition count 149
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 191 place count 105 transition count 146
Iterating global reduction 4 with 3 rules applied. Total rules applied 194 place count 105 transition count 146
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 196 place count 103 transition count 144
Iterating global reduction 4 with 2 rules applied. Total rules applied 198 place count 103 transition count 144
Applied a total of 198 rules in 32 ms. Remains 103 /184 variables (removed 81) and now considering 144/390 (removed 246) transitions.
// Phase 1: matrix 144 rows 103 cols
[2024-05-28 11:42:11] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 11:42:11] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-28 11:42:11] [INFO ] Invariant cache hit.
[2024-05-28 11:42:11] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 11:42:11] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-28 11:42:11] [INFO ] Invariant cache hit.
[2024-05-28 11:42:11] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-28 11:42:14] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-28 11:42:14] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-28 11:42:14] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 11:42:14] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 3 ms to minimize.
[2024-05-28 11:42:14] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-28 11:42:14] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-28 11:42:14] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-28 11:42:15] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 144/247 variables, 103/116 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 75/191 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/247 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 191 constraints, problems are : Problem set: 0 solved, 143 unsolved in 10438 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-28 11:42:23] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-28 11:42:24] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:42:25] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-28 11:42:25] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 3 ms to minimize.
[2024-05-28 11:42:25] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 144/247 variables, 103/121 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 75/196 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 143/339 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-28 11:42:29] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 14 (OVERLAPS) 0/247 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 340 constraints, problems are : Problem set: 0 solved, 143 unsolved in 21348 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 14/14 constraints]
After SMT, in 32009ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 32012ms
Starting structural reductions in LTL mode, iteration 1 : 103/184 places, 144/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32496 ms. Remains : 103/184 places, 144/390 transitions.
[2024-05-28 11:42:43] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:42:43] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:42:43] [INFO ] Input system was already deterministic with 144 transitions.
[2024-05-28 11:42:43] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:42:43] [INFO ] Flatten gal took : 16 ms
[2024-05-28 11:42:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13188208548407744429.gal : 17 ms
[2024-05-28 11:42:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17076514933812087510.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/CTLFireability13188208548407744429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17076514933812087510.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,89661,1.26911,38268,2,3938,5,124432,6,0,556,46159,0


Converting to forward existential form...Done !
original formula: (EG(((A((!(((s1>=1)&&(l124>=1))) + EX(((s1>=1)&&(l1200>=1)))) U E(((s1>=1)&&(l1196>=1)) U ((s1>=1)&&(l1189>=1)))) * (s1>=1)) * (l959>=1))...185
=> equivalent forward existential formula: ([FwdG(Init,((!((E(!(E(((s1>=1)&&(l1196>=1)) U ((s1>=1)&&(l1189>=1)))) U (!((!(((s1>=1)&&(l124>=1))) + EX(((s1>=...380
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t18, t22, t25, t26, t28, t29, t45, t46, t47, t52, t57, t60, t63, t74, t75, t76, t77,...521
Using saturation style SCC detection
(forward)formula 0,1,6.11558,137796,1,0,584,701652,326,336,3835,406210,682
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 159 transition count 273
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 159 transition count 273
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 67 place count 159 transition count 256
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 87 place count 139 transition count 233
Iterating global reduction 1 with 20 rules applied. Total rules applied 107 place count 139 transition count 233
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 116 place count 139 transition count 224
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 126 place count 129 transition count 213
Iterating global reduction 2 with 10 rules applied. Total rules applied 136 place count 129 transition count 213
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 141 place count 129 transition count 208
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 126 transition count 204
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 126 transition count 204
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 123 transition count 201
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 123 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 155 place count 121 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 121 transition count 198
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 120 transition count 197
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 120 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 119 transition count 196
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 119 transition count 196
Applied a total of 161 rules in 34 ms. Remains 119 /184 variables (removed 65) and now considering 196/390 (removed 194) transitions.
// Phase 1: matrix 196 rows 119 cols
[2024-05-28 11:42:50] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 11:42:50] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-28 11:42:50] [INFO ] Invariant cache hit.
[2024-05-28 11:42:50] [INFO ] State equation strengthened by 114 read => feed constraints.
[2024-05-28 11:42:50] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-28 11:42:50] [INFO ] Invariant cache hit.
[2024-05-28 11:42:50] [INFO ] State equation strengthened by 114 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-28 11:42:53] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:42:53] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:42:53] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 1/119 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-28 11:42:56] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:42:56] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 3 ms to minimize.
[2024-05-28 11:42:56] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-28 11:42:56] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-28 11:42:56] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-05-28 11:42:56] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-05-28 11:42:56] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-28 11:42:56] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 196/315 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 114/249 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-28 11:43:00] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:43:02] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-28 11:43:02] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
[2024-05-28 11:43:02] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (OVERLAPS) 0/315 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 253 constraints, problems are : Problem set: 0 solved, 195 unsolved in 19671 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 119/119 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 1/119 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 196/315 variables, 119/139 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 114/253 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (OVERLAPS) 0/315 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 448 constraints, problems are : Problem set: 0 solved, 195 unsolved in 26580 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 119/119 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 15/15 constraints]
After SMT, in 46622ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 46626ms
Starting structural reductions in LTL mode, iteration 1 : 119/184 places, 196/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47397 ms. Remains : 119/184 places, 196/390 transitions.
[2024-05-28 11:43:37] [INFO ] Flatten gal took : 9 ms
[2024-05-28 11:43:37] [INFO ] Flatten gal took : 10 ms
[2024-05-28 11:43:37] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-28 11:43:37] [INFO ] Flatten gal took : 9 ms
[2024-05-28 11:43:37] [INFO ] Flatten gal took : 9 ms
[2024-05-28 11:43:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14598937550275635302.gal : 4 ms
[2024-05-28 11:43:37] [INFO ] Time to serialize properties into /tmp/CTLFireability9890287104814987278.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/CTLFireability14598937550275635302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9890287104814987278.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,140753,3.31526,79724,2,4654,5,292886,6,0,672,78055,0


Converting to forward existential form...Done !
original formula: ((EF(EX(EF(((s1<1)||(l1198<1))))) * AF(!(A(!(((s1>=1)&&(l1187>=1))) U EF(((s1>=1)&&(l166>=1))))))) * (AX(A(A(!(((s1>=1)&&(l1201>=1))) U (...375
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EX(E(TRUE U ((s1<1)||(l1198<1)))))))] = FALSE * [FwdG(Init,!(!(!((E(!(E(TRUE U ((s1>=1)&&(...999
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t20, t24, t27, t28, t29, t30, t31, t32, t49, t50, t51, t52, t59, t62, t66, t67, t72,...517
Using saturation style SCC detection
(forward)formula 0,0,18.5814,377832,1,0,1389,1.92598e+06,440,696,4818,963141,1646
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 161 transition count 282
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 161 transition count 282
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 65 place count 161 transition count 263
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 83 place count 143 transition count 242
Iterating global reduction 1 with 18 rules applied. Total rules applied 101 place count 143 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 105 place count 143 transition count 238
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 117 place count 131 transition count 225
Iterating global reduction 2 with 12 rules applied. Total rules applied 129 place count 131 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 135 place count 131 transition count 219
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 138 place count 128 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 141 place count 128 transition count 214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 125 transition count 211
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 125 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 124 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 124 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 123 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 123 transition count 208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 122 transition count 207
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 122 transition count 207
Applied a total of 153 rules in 33 ms. Remains 122 /184 variables (removed 62) and now considering 207/390 (removed 183) transitions.
// Phase 1: matrix 207 rows 122 cols
[2024-05-28 11:43:56] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 11:43:56] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-28 11:43:56] [INFO ] Invariant cache hit.
[2024-05-28 11:43:56] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-28 11:43:56] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-05-28 11:43:56] [INFO ] Invariant cache hit.
[2024-05-28 11:43:56] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-28 11:43:59] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 1/122 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-28 11:44:01] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:44:02] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
[2024-05-28 11:44:02] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:44:02] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2024-05-28 11:44:02] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-28 11:44:03] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:44:03] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
[2024-05-28 11:44:03] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 2 ms to minimize.
[2024-05-28 11:44:03] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:44:03] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:44:03] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
[2024-05-28 11:44:03] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 207/329 variables, 122/140 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 123/263 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-28 11:44:11] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/329 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 13 (OVERLAPS) 0/329 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 264 constraints, problems are : Problem set: 0 solved, 206 unsolved in 25901 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 122/122 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 1/122 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-28 11:44:25] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-28 11:44:25] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 207/329 variables, 122/143 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 123/266 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 206/472 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 12 (OVERLAPS) 0/329 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 472 constraints, problems are : Problem set: 0 solved, 206 unsolved in 29230 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 122/122 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 16/16 constraints]
After SMT, in 55530ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 55535ms
Starting structural reductions in LTL mode, iteration 1 : 122/184 places, 207/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56182 ms. Remains : 122/184 places, 207/390 transitions.
[2024-05-28 11:44:52] [INFO ] Flatten gal took : 10 ms
[2024-05-28 11:44:52] [INFO ] Flatten gal took : 9 ms
[2024-05-28 11:44:52] [INFO ] Input system was already deterministic with 207 transitions.
[2024-05-28 11:44:52] [INFO ] Flatten gal took : 9 ms
[2024-05-28 11:44:52] [INFO ] Flatten gal took : 9 ms
[2024-05-28 11:44:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7355942249161605589.gal : 3 ms
[2024-05-28 11:44:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13533831499174793875.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/CTLFireability7355942249161605589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13533831499174793875.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,154315,4.40863,98068,2,4579,5,373276,6,0,695,95842,0


Converting to forward existential form...Done !
original formula: AF(((AF(EG(((s1<1)||(l1201<1)))) + (AX(AF(((s1>=1)&&(l1192>=1)))) * ((((A(!(((s1<1)||(l1198<1))) U ((s1>=1)&&(l1189>=1))) + (s1<1)) + ((l...398
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(EG(((s1<1)||(l1201<1)))))) + (!(EX(!(!(EG(!(((s1>=1)&&(l1192>=1)))))))) * ((((!((E(!(((s1>...532
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t16, t27, t28, t29, t30, t31, t32, t36, t49, t50, t51, t52, t59, t61, t68, t72, t78,...722
Using saturation style SCC detection
(forward)formula 0,1,9.45826,161540,1,0,839,814630,466,394,4878,427731,1210
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-04 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 : 184/184 places, 390/390 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 152 transition count 203
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 152 transition count 203
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 69 place count 152 transition count 198
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 97 place count 124 transition count 167
Iterating global reduction 1 with 28 rules applied. Total rules applied 125 place count 124 transition count 167
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 138 place count 124 transition count 154
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 155 place count 107 transition count 135
Iterating global reduction 2 with 17 rules applied. Total rules applied 172 place count 107 transition count 135
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 181 place count 107 transition count 126
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 187 place count 101 transition count 119
Iterating global reduction 3 with 6 rules applied. Total rules applied 193 place count 101 transition count 119
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 198 place count 96 transition count 114
Iterating global reduction 3 with 5 rules applied. Total rules applied 203 place count 96 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 207 place count 92 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 213 place count 92 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 215 place count 90 transition count 105
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 90 transition count 105
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 218 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 89 transition count 104
Applied a total of 219 rules in 16 ms. Remains 89 /184 variables (removed 95) and now considering 104/390 (removed 286) transitions.
// Phase 1: matrix 104 rows 89 cols
[2024-05-28 11:45:02] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 11:45:02] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 11:45:02] [INFO ] Invariant cache hit.
[2024-05-28 11:45:02] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 11:45:02] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-28 11:45:02] [INFO ] Invariant cache hit.
[2024-05-28 11:45:02] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-28 11:45:03] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
[2024-05-28 11:45:03] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:45:04] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 2 ms to minimize.
[2024-05-28 11:45:04] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 104/193 variables, 89/98 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 46/144 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 144 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6659 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 1/89 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-28 11:45:10] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-28 11:45:10] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 104/193 variables, 89/100 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 46/146 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 103/249 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-28 11:45:12] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 250 constraints, problems are : Problem set: 0 solved, 103 unsolved in 12466 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 7/7 constraints]
After SMT, in 19260ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 19262ms
Starting structural reductions in LTL mode, iteration 1 : 89/184 places, 104/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19641 ms. Remains : 89/184 places, 104/390 transitions.
[2024-05-28 11:45:21] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:45:21] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:45:21] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-28 11:45:21] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:45:21] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:45:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17182963754290383662.gal : 1 ms
[2024-05-28 11:45:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7520617079382743454.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/CTLFireability17182963754290383662.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7520617079382743454.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,67993,0.404625,15032,2,2782,5,45205,6,0,460,24225,0


Converting to forward existential form...Done !
original formula: !(A(E(AG(EX(!(((s1<1)||(l1195<1))))) U !(AF(((s1>=1)&&(l214>=1))))) U !(((s1<1)||(l1195<1)))))
=> equivalent forward existential formula: ([((FwdU(Init,!(!(((s1<1)||(l1195<1))))) * !(!(((s1<1)||(l1195<1))))) * !(E(!(E(TRUE U !(EX(!(((s1<1)||(l1195<1)...261
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t21, t28, t29, t40, t41, t42, t47, t50, t63, t71, t78, t79, t80, t81, t82, t83, t84,...307
Hit Full ! (commute/partial/dont) 2/0/102
(forward)formula 0,1,4.26636,101020,1,0,423,472225,247,177,3221,328531,510
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 152 transition count 203
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 152 transition count 203
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 69 place count 152 transition count 198
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 97 place count 124 transition count 167
Iterating global reduction 1 with 28 rules applied. Total rules applied 125 place count 124 transition count 167
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 138 place count 124 transition count 154
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 155 place count 107 transition count 135
Iterating global reduction 2 with 17 rules applied. Total rules applied 172 place count 107 transition count 135
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 181 place count 107 transition count 126
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 187 place count 101 transition count 119
Iterating global reduction 3 with 6 rules applied. Total rules applied 193 place count 101 transition count 119
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 198 place count 96 transition count 114
Iterating global reduction 3 with 5 rules applied. Total rules applied 203 place count 96 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 207 place count 92 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 213 place count 92 transition count 107
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 216 place count 89 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 219 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 221 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 224 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 225 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 226 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 85 transition count 99
Applied a total of 227 rules in 12 ms. Remains 85 /184 variables (removed 99) and now considering 99/390 (removed 291) transitions.
// Phase 1: matrix 99 rows 85 cols
[2024-05-28 11:45:26] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 11:45:26] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-28 11:45:26] [INFO ] Invariant cache hit.
[2024-05-28 11:45:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 11:45:26] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-28 11:45:26] [INFO ] Invariant cache hit.
[2024-05-28 11:45:26] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 11:45:27] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 11:45:28] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-28 11:45:28] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:45:29] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:45:29] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 99/184 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-28 11:45:31] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:45:31] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/184 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 141 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7464 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 99/184 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 44/141 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 98/239 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/184 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 239 constraints, problems are : Problem set: 0 solved, 98 unsolved in 8337 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 7/7 constraints]
After SMT, in 15932ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 15935ms
Starting structural reductions in LTL mode, iteration 1 : 85/184 places, 99/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16407 ms. Remains : 85/184 places, 99/390 transitions.
[2024-05-28 11:45:42] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:45:42] [INFO ] Flatten gal took : 17 ms
[2024-05-28 11:45:42] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-28 11:45:42] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:45:42] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:45:42] [INFO ] Time to serialize gal into /tmp/CTLFireability5200282419816519688.gal : 2 ms
[2024-05-28 11:45:42] [INFO ] Time to serialize properties into /tmp/CTLFireability2850088059256790340.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/CTLFireability5200282419816519688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2850088059256790340.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,66549,0.587621,16572,2,2555,5,52837,6,0,439,25065,0


Converting to forward existential form...Done !
original formula: AF(EX(((EF(EG(((s1>=1)&&(l1196>=1)))) * (p38>=1)) * (l0>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((E(TRUE U EG(((s1>=1)&&(l1196>=1)))) * (p38>=1)) * (l0>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t37, t38, t47, t48, t59, t60, t61, t62, t63, t64, t65, t66, t67, t74, t75, t76, t77, t78, t79...310
(forward)formula 0,0,1.88971,43364,1,0,240,153008,227,94,3017,92509,295
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 157 transition count 228
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 157 transition count 228
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 157 transition count 219
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 84 place count 136 transition count 195
Iterating global reduction 1 with 21 rules applied. Total rules applied 105 place count 136 transition count 195
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 110 place count 136 transition count 190
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 126 place count 120 transition count 171
Iterating global reduction 2 with 16 rules applied. Total rules applied 142 place count 120 transition count 171
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 149 place count 120 transition count 164
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 154 place count 115 transition count 156
Iterating global reduction 3 with 5 rules applied. Total rules applied 159 place count 115 transition count 156
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 163 place count 111 transition count 152
Iterating global reduction 3 with 4 rules applied. Total rules applied 167 place count 111 transition count 152
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 171 place count 107 transition count 147
Iterating global reduction 3 with 4 rules applied. Total rules applied 175 place count 107 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 179 place count 107 transition count 143
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 182 place count 104 transition count 140
Iterating global reduction 4 with 3 rules applied. Total rules applied 185 place count 104 transition count 140
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 187 place count 102 transition count 138
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 102 transition count 138
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 190 place count 101 transition count 136
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 101 transition count 136
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 100 transition count 135
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 100 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 194 place count 99 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 99 transition count 134
Applied a total of 195 rules in 21 ms. Remains 99 /184 variables (removed 85) and now considering 134/390 (removed 256) transitions.
// Phase 1: matrix 134 rows 99 cols
[2024-05-28 11:45:44] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 11:45:44] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 11:45:44] [INFO ] Invariant cache hit.
[2024-05-28 11:45:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-28 11:45:44] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2024-05-28 11:45:44] [INFO ] Invariant cache hit.
[2024-05-28 11:45:44] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-28 11:45:46] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-28 11:45:46] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:45:47] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-28 11:45:48] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 1/99 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-28 11:45:49] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-28 11:45:50] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-28 11:45:50] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 134/233 variables, 99/111 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 68/179 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 0/233 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 179 constraints, problems are : Problem set: 0 solved, 133 unsolved in 11652 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 1/99 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 134/233 variables, 99/111 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 68/179 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 133/312 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/233 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 312 constraints, problems are : Problem set: 0 solved, 133 unsolved in 11838 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 7/7 constraints]
After SMT, in 23665ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 23669ms
Starting structural reductions in LTL mode, iteration 1 : 99/184 places, 134/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24105 ms. Remains : 99/184 places, 134/390 transitions.
[2024-05-28 11:46:08] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:46:08] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:46:08] [INFO ] Input system was already deterministic with 134 transitions.
[2024-05-28 11:46:08] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:46:08] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:46:08] [INFO ] Time to serialize gal into /tmp/CTLFireability4434320512107575891.gal : 1 ms
[2024-05-28 11:46:08] [INFO ] Time to serialize properties into /tmp/CTLFireability16533880859754201720.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/CTLFireability4434320512107575891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16533880859754201720.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,160481,2.26427,48768,2,3350,5,204987,6,0,530,66643,0


Converting to forward existential form...Done !
original formula: E((A(!(((s1>=1)&&(l917>=1))) U !((!((((s1>=1)&&(l1198>=1))||((s1>=1)&&(l1186>=1)))) + ((AG(((s1>=1)&&(l1186>=1))) * (s1>=1)) * (l1186>=1)...313
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,(!((E(!(!((!((((s1>=1)&&(l1198>=1))||((s1>=1)&&(l1186>=1)))) + ((!(E(TRUE U !(((s1>=1)&&(l118...1310
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t28, t29, t42, t43, t44, t45, t53, t55, t57, t61, t62, t72, t80, t88, t96, t106, t1...349
Using saturation style SCC detection
(forward)formula 0,0,8.27568,156200,1,0,898,850768,321,506,3710,488577,1012
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 152 transition count 196
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 152 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 152 transition count 193
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 95 place count 124 transition count 162
Iterating global reduction 1 with 28 rules applied. Total rules applied 123 place count 124 transition count 162
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 139 place count 124 transition count 146
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 156 place count 107 transition count 127
Iterating global reduction 2 with 17 rules applied. Total rules applied 173 place count 107 transition count 127
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 182 place count 107 transition count 118
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 189 place count 100 transition count 110
Iterating global reduction 3 with 7 rules applied. Total rules applied 196 place count 100 transition count 110
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 202 place count 94 transition count 104
Iterating global reduction 3 with 6 rules applied. Total rules applied 208 place count 94 transition count 104
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 213 place count 89 transition count 98
Iterating global reduction 3 with 5 rules applied. Total rules applied 218 place count 89 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 220 place count 89 transition count 96
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 223 place count 86 transition count 93
Iterating global reduction 4 with 3 rules applied. Total rules applied 226 place count 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 227 place count 85 transition count 92
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 85 transition count 92
Applied a total of 228 rules in 42 ms. Remains 85 /184 variables (removed 99) and now considering 92/390 (removed 298) transitions.
// Phase 1: matrix 92 rows 85 cols
[2024-05-28 11:46:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 11:46:17] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-28 11:46:17] [INFO ] Invariant cache hit.
[2024-05-28 11:46:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-28 11:46:17] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-28 11:46:17] [INFO ] Redundant transitions in 3 ms returned []
Running 91 sub problems to find dead transitions.
[2024-05-28 11:46:17] [INFO ] Invariant cache hit.
[2024-05-28 11:46:17] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-28 11:46:19] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-28 11:46:19] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-28 11:46:19] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-28 11:46:19] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:46:19] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-28 11:46:19] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-05-28 11:46:19] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/177 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 37/134 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-28 11:46:21] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/177 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/177 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 135 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6903 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 92/177 variables, 85/98 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 37/135 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 91/226 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/177 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 226 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6929 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 8/8 constraints]
After SMT, in 13959ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 13961ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/184 places, 92/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14444 ms. Remains : 85/184 places, 92/390 transitions.
[2024-05-28 11:46:31] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:46:31] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:46:31] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-28 11:46:31] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:46:31] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:46:31] [INFO ] Time to serialize gal into /tmp/CTLFireability7322918229990405120.gal : 1 ms
[2024-05-28 11:46:31] [INFO ] Time to serialize properties into /tmp/CTLFireability6844982521150126666.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/CTLFireability7322918229990405120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6844982521150126666.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,52227,0.196528,9928,2,2618,5,22814,6,0,432,15761,0


Converting to forward existential form...Done !
original formula: EG(AF(AG(((s1>=1)&&(l163>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !(((s1>=1)&&(l163>=1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t18, t22, t26, t27, t32, t33, t60, t67, t68, t69, t70, t71, t72, t73, t74, t75, t78, t80,...294
(forward)formula 0,0,2.06633,51044,1,0,354,252572,213,157,2931,159168,385
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 154 transition count 218
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 154 transition count 218
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 67 place count 154 transition count 211
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 92 place count 129 transition count 183
Iterating global reduction 1 with 25 rules applied. Total rules applied 117 place count 129 transition count 183
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 130 place count 129 transition count 170
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 144 place count 115 transition count 154
Iterating global reduction 2 with 14 rules applied. Total rules applied 158 place count 115 transition count 154
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 165 place count 115 transition count 147
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 170 place count 110 transition count 141
Iterating global reduction 3 with 5 rules applied. Total rules applied 175 place count 110 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 179 place count 106 transition count 137
Iterating global reduction 3 with 4 rules applied. Total rules applied 183 place count 106 transition count 137
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 103 transition count 133
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 103 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 190 place count 102 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 102 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 192 place count 101 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 193 place count 101 transition count 131
Applied a total of 193 rules in 9 ms. Remains 101 /184 variables (removed 83) and now considering 131/390 (removed 259) transitions.
// Phase 1: matrix 131 rows 101 cols
[2024-05-28 11:46:33] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 11:46:33] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-28 11:46:33] [INFO ] Invariant cache hit.
[2024-05-28 11:46:33] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-28 11:46:34] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-28 11:46:34] [INFO ] Invariant cache hit.
[2024-05-28 11:46:34] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 11:46:36] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-28 11:46:36] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-28 11:46:36] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-28 11:46:36] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:46:36] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-28 11:46:37] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/232 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 63/175 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 11:46:39] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:46:40] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:46:40] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 130 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/232 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 178 constraints, problems are : Problem set: 0 solved, 130 unsolved in 11404 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-28 11:46:47] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:46:47] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 131/232 variables, 101/117 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 63/180 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 130/310 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 0/232 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 310 constraints, problems are : Problem set: 0 solved, 130 unsolved in 14213 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 11/11 constraints]
After SMT, in 25817ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 25819ms
Starting structural reductions in LTL mode, iteration 1 : 101/184 places, 131/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26361 ms. Remains : 101/184 places, 131/390 transitions.
[2024-05-28 11:46:59] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:46:59] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:46:59] [INFO ] Input system was already deterministic with 131 transitions.
[2024-05-28 11:46:59] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:46:59] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:46:59] [INFO ] Time to serialize gal into /tmp/CTLFireability4878138669762773405.gal : 5 ms
[2024-05-28 11:46:59] [INFO ] Time to serialize properties into /tmp/CTLFireability15194668129866474909.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/CTLFireability4878138669762773405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15194668129866474909.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,92645,0.670191,22500,2,3299,5,67441,6,0,535,31945,0


Converting to forward existential form...Done !
original formula: EG(((AF(((s1>=1)&&(l150>=1))) * E(!(AX(FALSE)) U (AX(((p65>=1)&&(l317>=1))) + ((s1>=1)&&(l1189>=1))))) * (((s1<1)||(l1191<1))||((s1>=1)&&...168
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!(((s1>=1)&&(l150>=1))))) * E(!(!(EX(!(FALSE)))) U (!(EX(!(((p65>=1)&&(l317>=1))))) + ((s1>=1)...229
Reverse transition relation is NOT exact ! Due to transitions t1, t18, t22, t26, t27, t32, t33, t44, t45, t46, t47, t55, t58, t63, t65, t76, t77, t78, t79,...392
(forward)formula 0,0,3.71422,88624,1,0,469,436774,296,202,3592,275241,572
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 155 transition count 229
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 155 transition count 229
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 67 place count 155 transition count 220
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 92 place count 130 transition count 192
Iterating global reduction 1 with 25 rules applied. Total rules applied 117 place count 130 transition count 192
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 130 place count 130 transition count 179
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 144 place count 116 transition count 163
Iterating global reduction 2 with 14 rules applied. Total rules applied 158 place count 116 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 164 place count 116 transition count 157
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 168 place count 112 transition count 152
Iterating global reduction 3 with 4 rules applied. Total rules applied 172 place count 112 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 175 place count 109 transition count 149
Iterating global reduction 3 with 3 rules applied. Total rules applied 178 place count 109 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 181 place count 106 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 184 place count 106 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 105 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 105 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 104 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 104 transition count 143
Applied a total of 188 rules in 9 ms. Remains 104 /184 variables (removed 80) and now considering 143/390 (removed 247) transitions.
// Phase 1: matrix 143 rows 104 cols
[2024-05-28 11:47:03] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 11:47:03] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-28 11:47:03] [INFO ] Invariant cache hit.
[2024-05-28 11:47:03] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-28 11:47:04] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-28 11:47:04] [INFO ] Invariant cache hit.
[2024-05-28 11:47:04] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-28 11:47:05] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-28 11:47:05] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-28 11:47:06] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 1/104 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-28 11:47:08] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-28 11:47:08] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-28 11:47:08] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-28 11:47:08] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:47:08] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 143/247 variables, 104/117 constraints. Problems are: Problem set: 0 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 74/191 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-28 11:47:12] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/247 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (OVERLAPS) 0/247 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 192 constraints, problems are : Problem set: 0 solved, 142 unsolved in 13944 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 1/104 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-28 11:47:19] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 143/247 variables, 104/119 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 74/193 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 142/335 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (OVERLAPS) 0/247 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 335 constraints, problems are : Problem set: 0 solved, 142 unsolved in 16463 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 10/10 constraints]
After SMT, in 30543ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 30546ms
Starting structural reductions in LTL mode, iteration 1 : 104/184 places, 143/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30971 ms. Remains : 104/184 places, 143/390 transitions.
[2024-05-28 11:47:34] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:47:34] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:47:34] [INFO ] Input system was already deterministic with 143 transitions.
[2024-05-28 11:47:34] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:47:34] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:47:34] [INFO ] Time to serialize gal into /tmp/CTLFireability11214300591401844707.gal : 2 ms
[2024-05-28 11:47:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13349091209479562274.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/CTLFireability11214300591401844707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13349091209479562274.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,99593,1.95023,40940,2,3338,5,143177,6,0,559,50923,0


Converting to forward existential form...Done !
original formula: AX(((EX(((!(E(((s1>=1)&&(l1194>=1)) U ((s1>=1)&&(l163>=1)))) + (s1<1)) + (l1201<1))) * (s1>=1)) * (l1191>=1)))
=> equivalent forward existential formula: (([(EY(Init) * !(EX(((!(E(((s1>=1)&&(l1194>=1)) U ((s1>=1)&&(l163>=1)))) + (s1<1)) + (l1201<1)))))] = FALSE * [(...227
(forward)formula 0,0,1.95526,40940,1,0,9,143177,9,2,747,50923,2
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 154 transition count 225
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 154 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 69 place count 154 transition count 216
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 95 place count 128 transition count 187
Iterating global reduction 1 with 26 rules applied. Total rules applied 121 place count 128 transition count 187
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 132 place count 128 transition count 176
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 147 place count 113 transition count 159
Iterating global reduction 2 with 15 rules applied. Total rules applied 162 place count 113 transition count 159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 170 place count 113 transition count 151
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 175 place count 108 transition count 145
Iterating global reduction 3 with 5 rules applied. Total rules applied 180 place count 108 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 184 place count 104 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 188 place count 104 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 192 place count 100 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 100 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 200 place count 100 transition count 132
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 203 place count 97 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 206 place count 97 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 208 place count 95 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 210 place count 95 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 211 place count 94 transition count 125
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 94 transition count 125
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 213 place count 93 transition count 124
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 93 transition count 124
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 215 place count 92 transition count 123
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 92 transition count 123
Applied a total of 216 rules in 44 ms. Remains 92 /184 variables (removed 92) and now considering 123/390 (removed 267) transitions.
// Phase 1: matrix 123 rows 92 cols
[2024-05-28 11:47:36] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 11:47:36] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-28 11:47:36] [INFO ] Invariant cache hit.
[2024-05-28 11:47:36] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-28 11:47:37] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2024-05-28 11:47:37] [INFO ] Redundant transitions in 3 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-28 11:47:37] [INFO ] Invariant cache hit.
[2024-05-28 11:47:37] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 11:47:38] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 1/92 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 11:47:39] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-28 11:47:39] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:47:39] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
[2024-05-28 11:47:39] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 123/215 variables, 92/102 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 62/164 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 164 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6988 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 11:47:44] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 11:47:45] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 1/92 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 123/215 variables, 92/104 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 62/166 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 122/288 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 0/215 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 288 constraints, problems are : Problem set: 0 solved, 122 unsolved in 12013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 7/7 constraints]
After SMT, in 19108ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 19110ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/184 places, 123/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19587 ms. Remains : 92/184 places, 123/390 transitions.
[2024-05-28 11:47:56] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:47:56] [INFO ] Flatten gal took : 6 ms
[2024-05-28 11:47:56] [INFO ] Input system was already deterministic with 123 transitions.
[2024-05-28 11:47:56] [INFO ] Flatten gal took : 3 ms
[2024-05-28 11:47:56] [INFO ] Flatten gal took : 3 ms
[2024-05-28 11:47:56] [INFO ] Time to serialize gal into /tmp/CTLFireability13561707961916108785.gal : 2 ms
[2024-05-28 11:47:56] [INFO ] Time to serialize properties into /tmp/CTLFireability4527155841344698348.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/CTLFireability13561707961916108785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4527155841344698348.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,92373,1.65733,40244,2,3094,5,153546,6,0,491,53014,0


Converting to forward existential form...Done !
original formula: EG(AF((E(((s1>=1)&&(l1194>=1)) U !(((s1<1)||(l1195<1)))) + AF(((s1>=1)&&(l1190>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((E(((s1>=1)&&(l1194>=1)) U !(((s1<1)||(l1195<1)))) + !(EG(!(((s1>=1)&&(l1190>=1))))))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t45, t47, t50, t54, t56, t65, t73, t81, t89, t96, t97, t98, t99, t100, t101, t...319
Using saturation style SCC detection
(forward)formula 0,0,5.5295,100412,1,0,596,526826,285,294,3374,282011,730
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 153 transition count 214
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 153 transition count 214
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 69 place count 153 transition count 207
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 95 place count 127 transition count 178
Iterating global reduction 1 with 26 rules applied. Total rules applied 121 place count 127 transition count 178
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 133 place count 127 transition count 166
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 148 place count 112 transition count 149
Iterating global reduction 2 with 15 rules applied. Total rules applied 163 place count 112 transition count 149
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 170 place count 112 transition count 142
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 175 place count 107 transition count 136
Iterating global reduction 3 with 5 rules applied. Total rules applied 180 place count 107 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 184 place count 103 transition count 132
Iterating global reduction 3 with 4 rules applied. Total rules applied 188 place count 103 transition count 132
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 191 place count 100 transition count 128
Iterating global reduction 3 with 3 rules applied. Total rules applied 194 place count 100 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 195 place count 99 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 99 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 197 place count 98 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 98 transition count 126
Applied a total of 198 rules in 10 ms. Remains 98 /184 variables (removed 86) and now considering 126/390 (removed 264) transitions.
// Phase 1: matrix 126 rows 98 cols
[2024-05-28 11:48:01] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 11:48:01] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 11:48:01] [INFO ] Invariant cache hit.
[2024-05-28 11:48:02] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 11:48:02] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-28 11:48:02] [INFO ] Invariant cache hit.
[2024-05-28 11:48:02] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-28 11:48:03] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-28 11:48:03] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:48:03] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-28 11:48:05] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-05-28 11:48:05] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-28 11:48:05] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-28 11:48:05] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 3 ms to minimize.
[2024-05-28 11:48:05] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-28 11:48:06] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-05-28 11:48:06] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:48:06] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 126/224 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 61/175 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-28 11:48:09] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-28 11:48:10] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:48:11] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 14 (OVERLAPS) 0/224 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 178 constraints, problems are : Problem set: 0 solved, 125 unsolved in 13175 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 126/224 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 61/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 125/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/224 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 303 constraints, problems are : Problem set: 0 solved, 125 unsolved in 12796 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 14/14 constraints]
After SMT, in 26076ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 26077ms
Starting structural reductions in LTL mode, iteration 1 : 98/184 places, 126/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26468 ms. Remains : 98/184 places, 126/390 transitions.
[2024-05-28 11:48:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:48:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:48:28] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-28 11:48:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:48:28] [INFO ] Flatten gal took : 3 ms
[2024-05-28 11:48:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12847757756739938693.gal : 2 ms
[2024-05-28 11:48:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3079122571134051787.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/CTLFireability12847757756739938693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3079122571134051787.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,86359,0.738022,22444,2,3213,5,73235,6,0,518,32839,0


Converting to forward existential form...Done !
original formula: A(((!(EF(!(((p11>=1)&&(l0>=1))))) * EX(AG(((s1>=1)&&(l1193>=1))))) * ((s1>=1)&&(l1195>=1))) U !(EG(AF(((s1>=1)&&(l1193>=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EG(!(((s1>=1)&&(l1193>=1))))))))))) * !(E(!(!(EG(!(EG(!(((s1>=1)&&(l1193>=1)))))))) U (!...322
Reverse transition relation is NOT exact ! Due to transitions t1, t18, t22, t29, t31, t42, t43, t44, t45, t50, t53, t59, t62, t72, t73, t74, t75, t76, t77,...379
Using saturation style SCC detection
(forward)formula 0,1,3.32989,83684,1,0,473,404268,286,204,3549,247134,575
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 152 transition count 193
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 152 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 152 transition count 191
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 95 place count 123 transition count 159
Iterating global reduction 1 with 29 rules applied. Total rules applied 124 place count 123 transition count 159
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 138 place count 123 transition count 145
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 156 place count 105 transition count 125
Iterating global reduction 2 with 18 rules applied. Total rules applied 174 place count 105 transition count 125
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 184 place count 105 transition count 115
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 191 place count 98 transition count 107
Iterating global reduction 3 with 7 rules applied. Total rules applied 198 place count 98 transition count 107
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 204 place count 92 transition count 101
Iterating global reduction 3 with 6 rules applied. Total rules applied 210 place count 92 transition count 101
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 215 place count 87 transition count 95
Iterating global reduction 3 with 5 rules applied. Total rules applied 220 place count 87 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 222 place count 87 transition count 93
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 226 place count 83 transition count 89
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 83 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 232 place count 81 transition count 87
Iterating global reduction 4 with 2 rules applied. Total rules applied 234 place count 81 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 235 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 236 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 237 place count 79 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 238 place count 79 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 239 place count 78 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 78 transition count 83
Applied a total of 240 rules in 32 ms. Remains 78 /184 variables (removed 106) and now considering 83/390 (removed 307) transitions.
// Phase 1: matrix 83 rows 78 cols
[2024-05-28 11:48:31] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 11:48:31] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-28 11:48:31] [INFO ] Invariant cache hit.
[2024-05-28 11:48:31] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-28 11:48:32] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2024-05-28 11:48:32] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-28 11:48:32] [INFO ] Invariant cache hit.
[2024-05-28 11:48:32] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-28 11:48:32] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-05-28 11:48:33] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:48:33] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 1/78 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-28 11:48:33] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-28 11:48:34] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-28 11:48:34] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:48:34] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/161 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 33/123 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 123 constraints, problems are : Problem set: 0 solved, 82 unsolved in 4573 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 1/78 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/161 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 33/123 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 82/205 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/161 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 205 constraints, problems are : Problem set: 0 solved, 82 unsolved in 5753 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints]
After SMT, in 10413ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 10415ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/184 places, 83/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10894 ms. Remains : 78/184 places, 83/390 transitions.
[2024-05-28 11:48:42] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:48:42] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:48:42] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-28 11:48:42] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:48:42] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:48:42] [INFO ] Time to serialize gal into /tmp/CTLFireability12107561157835567991.gal : 2 ms
[2024-05-28 11:48:42] [INFO ] Time to serialize properties into /tmp/CTLFireability196158236358124209.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/CTLFireability12107561157835567991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability196158236358124209.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,52819,0.463605,12756,2,2110,5,36281,6,0,395,18694,0


Converting to forward existential form...Done !
original formula: AF(AG(((s1<1)||(l948<1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((s1<1)||(l948<1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t54, t61, t62, t63, t64, t65, t66, t67, t68, t71, t72, t75, t76, t78, t79, t80, t81, t82, In...250
(forward)formula 0,0,2.34183,48712,1,0,528,220553,194,300,2648,171376,476
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 153 transition count 214
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 153 transition count 214
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 69 place count 153 transition count 207
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 96 place count 126 transition count 177
Iterating global reduction 1 with 27 rules applied. Total rules applied 123 place count 126 transition count 177
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 135 place count 126 transition count 165
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 151 place count 110 transition count 147
Iterating global reduction 2 with 16 rules applied. Total rules applied 167 place count 110 transition count 147
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 175 place count 110 transition count 139
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 180 place count 105 transition count 133
Iterating global reduction 3 with 5 rules applied. Total rules applied 185 place count 105 transition count 133
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 189 place count 101 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 193 place count 101 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 195 place count 99 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 99 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 198 place count 98 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 98 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 97 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 97 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 96 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 204 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 205 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 94 transition count 121
Applied a total of 207 rules in 21 ms. Remains 94 /184 variables (removed 90) and now considering 121/390 (removed 269) transitions.
// Phase 1: matrix 121 rows 94 cols
[2024-05-28 11:48:44] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 11:48:45] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 11:48:45] [INFO ] Invariant cache hit.
[2024-05-28 11:48:45] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 11:48:45] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2024-05-28 11:48:45] [INFO ] Redundant transitions in 6 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-28 11:48:45] [INFO ] Invariant cache hit.
[2024-05-28 11:48:45] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 11:48:47] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:48:47] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
[2024-05-28 11:48:47] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-28 11:48:47] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 11:48:48] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:48:48] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/215 variables, 94/105 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 60/165 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 11:48:49] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/215 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 166 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7724 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 11:48:54] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2024-05-28 11:48:54] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 1/94 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 121/215 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 60/168 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 120/288 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 0/215 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 288 constraints, problems are : Problem set: 0 solved, 120 unsolved in 12591 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 9/9 constraints]
After SMT, in 20479ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 20481ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/184 places, 121/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20964 ms. Remains : 94/184 places, 121/390 transitions.
[2024-05-28 11:49:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:49:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 11:49:05] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-28 11:49:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:49:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:49:05] [INFO ] Time to serialize gal into /tmp/CTLFireability774856422848268647.gal : 2 ms
[2024-05-28 11:49:05] [INFO ] Time to serialize properties into /tmp/CTLFireability457408481987690062.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/CTLFireability774856422848268647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability457408481987690062.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,83791,1.02803,23536,2,2928,5,84121,6,0,497,36617,0


Converting to forward existential form...Done !
original formula: E(!((A(((s1>=1)&&(l1201>=1)) U EG(((s1>=1)&&(l1194>=1)))) + !(AG(!(((s1>=1)&&(l33>=1))))))) U (AG(AF(EG(((s1>=1)&&(l970>=1))))) + ((s1>=1...170
=> equivalent forward existential formula: ([(FwdU(Init,!((!((E(!(EG(((s1>=1)&&(l1194>=1)))) U (!(((s1>=1)&&(l1201>=1))) * !(EG(((s1>=1)&&(l1194>=1)))))) +...532
Reverse transition relation is NOT exact ! Due to transitions t1, t34, t35, t36, t37, t40, t41, t42, t43, t49, t50, t57, t59, t70, t79, t80, t81, t82, t83,...365
(forward)formula 0,0,3.82787,85900,1,0,479,415010,283,214,3339,252329,574
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 390/390 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 153 transition count 214
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 153 transition count 214
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 69 place count 153 transition count 207
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 96 place count 126 transition count 177
Iterating global reduction 1 with 27 rules applied. Total rules applied 123 place count 126 transition count 177
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 135 place count 126 transition count 165
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 151 place count 110 transition count 147
Iterating global reduction 2 with 16 rules applied. Total rules applied 167 place count 110 transition count 147
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 175 place count 110 transition count 139
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 180 place count 105 transition count 133
Iterating global reduction 3 with 5 rules applied. Total rules applied 185 place count 105 transition count 133
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 189 place count 101 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 193 place count 101 transition count 129
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 197 place count 97 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 201 place count 97 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 204 place count 97 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 207 place count 94 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 210 place count 94 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 212 place count 92 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 214 place count 92 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 215 place count 91 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 91 transition count 114
Applied a total of 216 rules in 14 ms. Remains 91 /184 variables (removed 93) and now considering 114/390 (removed 276) transitions.
// Phase 1: matrix 114 rows 91 cols
[2024-05-28 11:49:09] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 11:49:09] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-28 11:49:09] [INFO ] Invariant cache hit.
[2024-05-28 11:49:10] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 11:49:10] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-28 11:49:10] [INFO ] Invariant cache hit.
[2024-05-28 11:49:10] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 11:49:11] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-05-28 11:49:11] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 11:49:11] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:49:11] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 1/91 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 11:49:12] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:49:12] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:49:12] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 11:49:13] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 114/205 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 11:49:15] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/205 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 11:49:17] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:49:17] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-28 11:49:18] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/205 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (OVERLAPS) 0/205 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 163 constraints, problems are : Problem set: 0 solved, 113 unsolved in 11166 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 114/205 variables, 91/108 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 55/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 113/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-28 11:49:24] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 277 constraints, problems are : Problem set: 0 solved, 113 unsolved in 12482 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 13/13 constraints]
After SMT, in 23799ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 23801ms
Starting structural reductions in LTL mode, iteration 1 : 91/184 places, 114/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24193 ms. Remains : 91/184 places, 114/390 transitions.
[2024-05-28 11:49:34] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:49:34] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:49:34] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-28 11:49:34] [INFO ] Flatten gal took : 3 ms
[2024-05-28 11:49:34] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:49:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6411681824599136487.gal : 2 ms
[2024-05-28 11:49:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9570881599338633724.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/CTLFireability6411681824599136487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9570881599338633724.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,82809,0.764274,23140,2,2981,5,80972,6,0,478,36443,0


Converting to forward existential form...Done !
original formula: AF((AX(EX(((s1>=1)&&(l1194>=1)))) + (EF(((s1>=1)&&(l1198>=1))) * ((s1<1)||(l149<1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EX(((s1>=1)&&(l1194>=1)))))) + (E(TRUE U ((s1>=1)&&(l1198>=1))) * ((s1<1)||(l149<1))))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t19, t37, t38, t39, t45, t46, t50, t53, t54, t64, t72, t80, t87, t88, t89, t90, t91,...327
(forward)formula 0,1,2.30526,52144,1,0,288,222864,257,129,3263,139710,357
FORMULA SieveSingleMsgMbox-PT-d1m06-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-28 11:49:36] [INFO ] Flatten gal took : 11 ms
[2024-05-28 11:49:36] [INFO ] Flatten gal took : 11 ms
Total runtime 564484 ms.

BK_STOP 1716896976530

--------------------
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="SieveSingleMsgMbox-PT-d1m06"
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 SieveSingleMsgMbox-PT-d1m06, 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 r378-smll-171683810700058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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