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.r550-tall-171734898400050.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 CO4-PT-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898400050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 98K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-07-CTLFireability-2024-00
FORMULA_NAME CO4-PT-07-CTLFireability-2024-01
FORMULA_NAME CO4-PT-07-CTLFireability-2024-02
FORMULA_NAME CO4-PT-07-CTLFireability-2024-03
FORMULA_NAME CO4-PT-07-CTLFireability-2024-04
FORMULA_NAME CO4-PT-07-CTLFireability-2024-05
FORMULA_NAME CO4-PT-07-CTLFireability-2024-06
FORMULA_NAME CO4-PT-07-CTLFireability-2024-07
FORMULA_NAME CO4-PT-07-CTLFireability-2024-08
FORMULA_NAME CO4-PT-07-CTLFireability-2024-09
FORMULA_NAME CO4-PT-07-CTLFireability-2024-10
FORMULA_NAME CO4-PT-07-CTLFireability-2024-11
FORMULA_NAME CO4-PT-07-CTLFireability-2024-12
FORMULA_NAME CO4-PT-07-CTLFireability-2024-13
FORMULA_NAME CO4-PT-07-CTLFireability-2024-14
FORMULA_NAME CO4-PT-07-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717351392060

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:03:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:03:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:03:13] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-06-02 18:03:13] [INFO ] Transformed 384 places.
[2024-06-02 18:03:13] [INFO ] Transformed 456 transitions.
[2024-06-02 18:03:13] [INFO ] Found NUPN structural information;
[2024-06-02 18:03:13] [INFO ] Parsed PT model containing 384 places and 456 transitions and 1022 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Deduced a syphon composed of 100 places in 8 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-07-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 336/336 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 274 transition count 335
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 56 place count 229 transition count 288
Iterating global reduction 1 with 45 rules applied. Total rules applied 101 place count 229 transition count 288
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 229 transition count 284
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 120 place count 214 transition count 269
Iterating global reduction 2 with 15 rules applied. Total rules applied 135 place count 214 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 213 transition count 268
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 213 transition count 268
Applied a total of 137 rules in 69 ms. Remains 213 /284 variables (removed 71) and now considering 268/336 (removed 68) transitions.
// Phase 1: matrix 268 rows 213 cols
[2024-06-02 18:03:13] [INFO ] Computed 4 invariants in 23 ms
[2024-06-02 18:03:13] [INFO ] Implicit Places using invariants in 236 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 263 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/284 places, 268/336 transitions.
Applied a total of 0 rules in 4 ms. Remains 212 /212 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 359 ms. Remains : 212/284 places, 268/336 transitions.
Support contains 72 out of 212 places after structural reductions.
[2024-06-02 18:03:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:03:14] [INFO ] Flatten gal took : 48 ms
FORMULA CO4-PT-07-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:03:14] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:03:14] [INFO ] Input system was already deterministic with 268 transitions.
Support contains 56 out of 212 places (down from 72) after GAL structural reductions.
RANDOM walk for 40000 steps (53 resets) in 2370 ms. (16 steps per ms) remains 30/44 properties
BEST_FIRST walk for 4002 steps (43 resets) in 24 ms. (160 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4001 steps (27 resets) in 27 ms. (142 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4000 steps (22 resets) in 84 ms. (47 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (21 resets) in 72 ms. (54 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (23 resets) in 106 ms. (37 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (23 resets) in 17 ms. (222 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4001 steps (34 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (26 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (27 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (21 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (32 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (36 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (39 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (18 resets) in 11 ms. (333 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4000 steps (11 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (33 resets) in 47 ms. (83 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (35 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (32 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (35 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (42 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (29 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (21 resets) in 23 ms. (166 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4000 steps (21 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (40 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
// Phase 1: matrix 268 rows 212 cols
[2024-06-02 18:03:15] [INFO ] Computed 3 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 16/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 3/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 112/160 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 186/346 variables, 85/136 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 107/453 variables, 61/197 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 24/477 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 3/480 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/480 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 0/480 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 215 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 16/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 3/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 112/160 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 186/346 variables, 85/141 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 16/157 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 107/453 variables, 61/218 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 24/477 variables, 16/234 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/477 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp36 is UNSAT
At refinement iteration 15 (OVERLAPS) 3/480 variables, 2/236 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 0/480 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 236 constraints, problems are : Problem set: 1 solved, 20 unsolved in 1955 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 3074ms problems are : Problem set: 1 solved, 20 unsolved
Parikh walk visited 17 properties in 7476 ms.
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 268/268 transitions.
Graph (trivial) has 198 edges and 212 vertex of which 2 / 212 are part of one of the 1 SCC in 9 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 345 edges and 211 vertex of which 197 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 197 transition count 176
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 152 place count 128 transition count 174
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 9 rules applied. Total rules applied 161 place count 127 transition count 166
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 170 place count 119 transition count 165
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 170 place count 119 transition count 152
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 196 place count 106 transition count 152
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 208 place count 94 transition count 140
Iterating global reduction 4 with 12 rules applied. Total rules applied 220 place count 94 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 224 place count 94 transition count 136
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 3 rules applied. Total rules applied 227 place count 93 transition count 134
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 230 place count 91 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 230 place count 91 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 232 place count 90 transition count 132
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 236 place count 86 transition count 127
Iterating global reduction 7 with 4 rules applied. Total rules applied 240 place count 86 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 242 place count 86 transition count 125
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 243 place count 85 transition count 124
Iterating global reduction 8 with 1 rules applied. Total rules applied 244 place count 85 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 245 place count 85 transition count 123
Performed 29 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 9 with 58 rules applied. Total rules applied 303 place count 56 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 305 place count 56 transition count 87
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 307 place count 54 transition count 85
Iterating global reduction 10 with 2 rules applied. Total rules applied 309 place count 54 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 311 place count 53 transition count 84
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 337 place count 40 transition count 86
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 344 place count 40 transition count 79
Discarding 11 places :
Symmetric choice reduction at 11 with 11 rule applications. Total rules 355 place count 29 transition count 57
Iterating global reduction 11 with 11 rules applied. Total rules applied 366 place count 29 transition count 57
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 373 place count 29 transition count 50
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 375 place count 27 transition count 44
Iterating global reduction 12 with 2 rules applied. Total rules applied 377 place count 27 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 379 place count 27 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 381 place count 27 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 382 place count 27 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 383 place count 26 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 384 place count 26 transition count 39
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 386 place count 26 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 387 place count 26 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 388 place count 25 transition count 37
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 15 with 3 rules applied. Total rules applied 391 place count 23 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 392 place count 22 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 394 place count 21 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 399 place count 21 transition count 30
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 401 place count 19 transition count 28
Iterating global reduction 17 with 2 rules applied. Total rules applied 403 place count 19 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 405 place count 19 transition count 26
Free-agglomeration rule applied 3 times.
Iterating global reduction 18 with 3 rules applied. Total rules applied 408 place count 19 transition count 23
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 411 place count 16 transition count 23
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 412 place count 16 transition count 23
Applied a total of 412 rules in 91 ms. Remains 16 /212 variables (removed 196) and now considering 23/268 (removed 245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 16/212 places, 23/268 transitions.
RANDOM walk for 10827 steps (1356 resets) in 196 ms. (54 steps per ms) remains 0/3 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA CO4-PT-07-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:03:25] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:03:25] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:03:25] [INFO ] Input system was already deterministic with 268 transitions.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 347 edges and 212 vertex of which 208 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 187 transition count 243
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 187 transition count 243
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 178 transition count 233
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 178 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 178 transition count 232
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 175 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 175 transition count 227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 173 transition count 225
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 173 transition count 225
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 171 transition count 223
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 171 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 171 transition count 221
Applied a total of 85 rules in 19 ms. Remains 171 /212 variables (removed 41) and now considering 221/268 (removed 47) transitions.
// Phase 1: matrix 221 rows 171 cols
[2024-06-02 18:03:25] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:03:26] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:03:26] [INFO ] Invariant cache hit.
[2024-06-02 18:03:26] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-02 18:03:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/392 variables, 171/174 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-02 18:03:29] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 19 ms to minimize.
[2024-06-02 18:03:29] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 176 constraints, problems are : Problem set: 0 solved, 220 unsolved in 7755 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/392 variables, 171/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 220/396 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 396 constraints, problems are : Problem set: 0 solved, 220 unsolved in 7641 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints]
After SMT, in 15454ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 15458ms
Starting structural reductions in LTL mode, iteration 1 : 171/212 places, 221/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15636 ms. Remains : 171/212 places, 221/268 transitions.
[2024-06-02 18:03:41] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:03:41] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:03:41] [INFO ] Input system was already deterministic with 221 transitions.
[2024-06-02 18:03:41] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:03:41] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:03:41] [INFO ] Time to serialize gal into /tmp/CTLFireability17860880502460367941.gal : 4 ms
[2024-06-02 18:03:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12878028570718912117.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/CTLFireability17860880502460367941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12878028570718912117.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,224259,0.110444,7676,2,814,5,14010,6,0,903,17525,0


Converting to forward existential form...Done !
original formula: E(((!(EX(A((p370==1) U (p160==1)))) * (p337==1)) * ((p197==1) + A(AX(FALSE) U (p240==1)))) U (((p221==1)&&(p370==1)) + (!(EF((p337==1))) ...169
=> equivalent forward existential formula: ([(FwdU(Init,((!(EX(!((E(!((p160==1)) U (!((p370==1)) * !((p160==1)))) + EG(!((p160==1))))))) * (p337==1)) * ((p...536
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t152, t175, t203, Inter...249
(forward)formula 0,0,6.87668,241848,1,0,852,1.63802e+06,488,481,5349,1.49366e+06,1214
FORMULA CO4-PT-07-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 186 transition count 242
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 186 transition count 242
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 175 transition count 230
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 175 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 175 transition count 229
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 172 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 172 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 170 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 170 transition count 222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 168 transition count 220
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 168 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 168 transition count 218
Applied a total of 91 rules in 15 ms. Remains 168 /212 variables (removed 44) and now considering 218/268 (removed 50) transitions.
// Phase 1: matrix 218 rows 168 cols
[2024-06-02 18:03:48] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:03:48] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 18:03:48] [INFO ] Invariant cache hit.
[2024-06-02 18:03:48] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:03:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/386 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:03:51] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:03:51] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 173 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7424 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/386 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 217/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 390 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7080 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints]
After SMT, in 14543ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 14548ms
Starting structural reductions in LTL mode, iteration 1 : 168/212 places, 218/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14708 ms. Remains : 168/212 places, 218/268 transitions.
[2024-06-02 18:04:03] [INFO ] Flatten gal took : 41 ms
[2024-06-02 18:04:03] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:04:03] [INFO ] Input system was already deterministic with 218 transitions.
[2024-06-02 18:04:03] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:04:03] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:04:03] [INFO ] Time to serialize gal into /tmp/CTLFireability5454253838221569083.gal : 3 ms
[2024-06-02 18:04:03] [INFO ] Time to serialize properties into /tmp/CTLFireability3617336600429104818.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/CTLFireability5454253838221569083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3617336600429104818.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,218967,0.131325,6960,2,769,5,12746,6,0,888,15298,0


Converting to forward existential form...Done !
original formula: AF(!(A(AX((p291==1)) U ((p230==1) + !(EX((p370==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(((p230==1) + !(EX((p370==1))))) U (!(!(EX(!((p291==1))))) * !(((p230==1) + !(EX((p370==1))...214
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t152, t175, t202, Inter...249
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.74242,64212,1,0,586,327610,467,374,5255,314733,702
FORMULA CO4-PT-07-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 189 transition count 245
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 189 transition count 245
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 180 transition count 235
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 180 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 180 transition count 234
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 177 transition count 229
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 177 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 175 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 175 transition count 227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 173 transition count 225
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 173 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 173 transition count 223
Applied a total of 81 rules in 20 ms. Remains 173 /212 variables (removed 39) and now considering 223/268 (removed 45) transitions.
// Phase 1: matrix 223 rows 173 cols
[2024-06-02 18:04:05] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:04:05] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:04:05] [INFO ] Invariant cache hit.
[2024-06-02 18:04:05] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-06-02 18:04:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 223/396 variables, 173/176 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-02 18:04:08] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:04:08] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 178 constraints, problems are : Problem set: 0 solved, 222 unsolved in 7678 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/396 variables, 173/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 222/400 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 400 constraints, problems are : Problem set: 0 solved, 222 unsolved in 7721 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints]
After SMT, in 15435ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 15440ms
Starting structural reductions in LTL mode, iteration 1 : 173/212 places, 223/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15603 ms. Remains : 173/212 places, 223/268 transitions.
[2024-06-02 18:04:20] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:04:20] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:04:20] [INFO ] Input system was already deterministic with 223 transitions.
[2024-06-02 18:04:20] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:04:20] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:04:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4300690574128478970.gal : 2 ms
[2024-06-02 18:04:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7535928546761733408.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/CTLFireability4300690574128478970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7535928546761733408.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,227787,0.103465,7228,2,798,5,13395,6,0,913,16287,0


Converting to forward existential form...Done !
original formula: (EG(((p213!=1) * (!(E(((p345==1)&&(p374==1)) U (p202==1))) + EG((p194==1))))) + EG(A(EF(((p266!=1)&&(p118!=1))) U ((p201==1) + (!(AX(((p2...196
=> equivalent forward existential formula: ([FwdG(Init,((p213!=1) * (!(E(((p345==1)&&(p374==1)) U (p202==1))) + EG((p194==1)))))] != FALSE + [FwdG(Init,!((...432
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t152, t176, t203, Inter...249
(forward)formula 0,1,2.23756,76364,1,0,667,317554,478,404,5098,464349,857
FORMULA CO4-PT-07-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 189 transition count 245
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 189 transition count 245
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 179 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 179 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 179 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 177 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 177 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 176 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 176 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 175 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 175 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 175 transition count 227
Applied a total of 76 rules in 19 ms. Remains 175 /212 variables (removed 37) and now considering 227/268 (removed 41) transitions.
// Phase 1: matrix 227 rows 175 cols
[2024-06-02 18:04:23] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:04:23] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 18:04:23] [INFO ] Invariant cache hit.
[2024-06-02 18:04:23] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-06-02 18:04:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 227/402 variables, 175/178 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-02 18:04:26] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:04:26] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 180 constraints, problems are : Problem set: 0 solved, 226 unsolved in 7824 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 227/402 variables, 175/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 226/406 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 0/402 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 406 constraints, problems are : Problem set: 0 solved, 226 unsolved in 7357 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints]
After SMT, in 15221ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 15225ms
Starting structural reductions in LTL mode, iteration 1 : 175/212 places, 227/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15405 ms. Remains : 175/212 places, 227/268 transitions.
[2024-06-02 18:04:38] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:04:38] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:04:38] [INFO ] Input system was already deterministic with 227 transitions.
[2024-06-02 18:04:38] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:04:38] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:04:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8046055805004240787.gal : 1 ms
[2024-06-02 18:04:38] [INFO ] Time to serialize properties into /tmp/CTLFireability2802789695012535257.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/CTLFireability8046055805004240787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2802789695012535257.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,274519,0.105229,7508,2,808,5,14332,6,0,925,17266,0


Converting to forward existential form...Done !
original formula: (E(EF((p334==1)) U !(((p300==1)&&(p359==1)))) * E(((EX((p379==1)) * (p367==1)) * AX((p240!=1))) U (AG((EX((p327==1)) * AX(FALSE))) * !(AX...183
=> equivalent forward existential formula: [(EY((FwdU((Init * E(E(TRUE U (p334==1)) U !(((p300==1)&&(p359==1))))),((EX((p379==1)) * (p367==1)) * !(EX(!((p2...259
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t17, t26, t32, t33, t35, t36, t40, t42, t46, t47, t50, t159, t182...269
(forward)formula 0,0,0.760184,28728,1,0,296,106781,477,187,5304,94192,470
FORMULA CO4-PT-07-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 190 transition count 246
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 190 transition count 246
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 180 transition count 235
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 180 transition count 235
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 178 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 178 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 177 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 177 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 176 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 176 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 176 transition count 229
Applied a total of 73 rules in 11 ms. Remains 176 /212 variables (removed 36) and now considering 229/268 (removed 39) transitions.
// Phase 1: matrix 229 rows 176 cols
[2024-06-02 18:04:39] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:04:39] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 18:04:39] [INFO ] Invariant cache hit.
[2024-06-02 18:04:39] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-06-02 18:04:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 229/405 variables, 176/179 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-02 18:04:42] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
[2024-06-02 18:04:42] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 181 constraints, problems are : Problem set: 0 solved, 228 unsolved in 7920 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/405 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 228/409 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 409 constraints, problems are : Problem set: 0 solved, 228 unsolved in 7722 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 2/2 constraints]
After SMT, in 15681ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 15684ms
Starting structural reductions in LTL mode, iteration 1 : 176/212 places, 229/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15835 ms. Remains : 176/212 places, 229/268 transitions.
[2024-06-02 18:04:55] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:04:55] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:04:55] [INFO ] Input system was already deterministic with 229 transitions.
[2024-06-02 18:04:55] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:04:55] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:04:55] [INFO ] Time to serialize gal into /tmp/CTLFireability1006304870120363037.gal : 1 ms
[2024-06-02 18:04:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3406369555232906305.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/CTLFireability1006304870120363037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3406369555232906305.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,313403,0.106866,7792,2,1208,5,14013,6,0,931,18051,0


Converting to forward existential form...Done !
original formula: EF(((AX(((p317==0)&&(p111==0))) * EF(AG((p349==1)))) * (A((!(((p133==1)&&(p370==1))) + EF((p296==1))) U EF(AG(((p300==1)&&(p365==1))))) +...181
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (!(EX(!(((p317==0)&&(p111==0))))) * E(TRUE U !(E(TRUE U !((p349==1))))))) * !(EG(!(E(TRUE...517
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t11, t17, t26, t31, t32, t34, t35, t39, t40, t44, t45, t48, t49, ...426
(forward)formula 0,0,6.6049,228960,1,0,617,1.57227e+06,491,329,5533,1.23752e+06,764
FORMULA CO4-PT-07-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 186 transition count 242
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 186 transition count 242
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 175 transition count 230
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 175 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 175 transition count 229
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 172 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 172 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 170 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 170 transition count 222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 168 transition count 220
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 168 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 168 transition count 218
Applied a total of 91 rules in 7 ms. Remains 168 /212 variables (removed 44) and now considering 218/268 (removed 50) transitions.
// Phase 1: matrix 218 rows 168 cols
[2024-06-02 18:05:01] [INFO ] Computed 3 invariants in 4 ms
[2024-06-02 18:05:01] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:05:01] [INFO ] Invariant cache hit.
[2024-06-02 18:05:02] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:05:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/386 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:05:04] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:05:04] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 173 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7168 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/386 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 217/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 390 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7209 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints]
After SMT, in 14408ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 14410ms
Starting structural reductions in LTL mode, iteration 1 : 168/212 places, 218/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14565 ms. Remains : 168/212 places, 218/268 transitions.
[2024-06-02 18:05:16] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:05:16] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:05:16] [INFO ] Input system was already deterministic with 218 transitions.
[2024-06-02 18:05:16] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:05:16] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:05:16] [INFO ] Time to serialize gal into /tmp/CTLFireability16963934522244172940.gal : 1 ms
[2024-06-02 18:05:16] [INFO ] Time to serialize properties into /tmp/CTLFireability4313958350299848376.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/CTLFireability16963934522244172940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4313958350299848376.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,218967,0.088737,7224,2,769,5,12746,6,0,888,15298,0


Converting to forward existential form...Done !
original formula: AF(EG(EX(AX((p334==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(!(EX(!((p334==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t152, t175, t202, Inter...249
Using saturation style SCC detection
(forward)formula 0,0,0.661801,28472,1,0,305,97140,463,188,5545,104588,480
FORMULA CO4-PT-07-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Graph (trivial) has 214 edges and 212 vertex of which 2 / 212 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 346 edges and 211 vertex of which 207 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 206 transition count 184
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 128 transition count 182
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 166 place count 127 transition count 177
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 172 place count 122 transition count 176
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 172 place count 122 transition count 163
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 198 place count 109 transition count 163
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 209 place count 98 transition count 150
Iterating global reduction 4 with 11 rules applied. Total rules applied 220 place count 98 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 221 place count 98 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 221 place count 98 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 225 place count 96 transition count 147
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 229 place count 92 transition count 143
Iterating global reduction 5 with 4 rules applied. Total rules applied 233 place count 92 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 92 transition count 142
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 258 place count 80 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 261 place count 80 transition count 127
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 263 place count 79 transition count 126
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 265 place count 77 transition count 124
Iterating global reduction 8 with 2 rules applied. Total rules applied 267 place count 77 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 269 place count 76 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 272 place count 76 transition count 120
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 274 place count 75 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 278 place count 75 transition count 115
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 279 place count 75 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 280 place count 74 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 282 place count 73 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 284 place count 71 transition count 111
Applied a total of 284 rules in 44 ms. Remains 71 /212 variables (removed 141) and now considering 111/268 (removed 157) transitions.
// Phase 1: matrix 111 rows 71 cols
[2024-06-02 18:05:17] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:05:17] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 18:05:17] [INFO ] Invariant cache hit.
[2024-06-02 18:05:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:05:17] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-06-02 18:05:17] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2024-06-02 18:05:17] [INFO ] Invariant cache hit.
[2024-06-02 18:05:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 75 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 176 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1922 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 3543ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 3545ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/212 places, 111/268 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3696 ms. Remains : 71/212 places, 111/268 transitions.
[2024-06-02 18:05:20] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:05:20] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:05:20] [INFO ] Input system was already deterministic with 111 transitions.
[2024-06-02 18:05:20] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:05:20] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:05:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14196315108265017227.gal : 0 ms
[2024-06-02 18:05:20] [INFO ] Time to serialize properties into /tmp/CTLFireability3831242581664710228.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/CTLFireability14196315108265017227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3831242581664710228.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,11665,0.024736,3932,2,200,5,1976,6,0,388,1901,0


Converting to forward existential form...Done !
original formula: EF(EG((p337==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p337==0))] != FALSE
Hit Full ! (commute/partial/dont) 90/0/21
(forward)formula 0,1,0.053291,5304,1,0,8,9096,19,3,1876,4586,8
FORMULA CO4-PT-07-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Graph (trivial) has 204 edges and 212 vertex of which 2 / 212 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 346 edges and 211 vertex of which 207 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 206 transition count 185
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 129 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 128 transition count 184
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 158 place count 128 transition count 171
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 184 place count 115 transition count 171
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 193 place count 106 transition count 161
Iterating global reduction 3 with 9 rules applied. Total rules applied 202 place count 106 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 203 place count 106 transition count 160
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 203 place count 106 transition count 158
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 207 place count 104 transition count 158
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 210 place count 101 transition count 155
Iterating global reduction 4 with 3 rules applied. Total rules applied 213 place count 101 transition count 155
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 237 place count 89 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 241 place count 89 transition count 139
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 245 place count 87 transition count 137
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 247 place count 85 transition count 135
Iterating global reduction 6 with 2 rules applied. Total rules applied 249 place count 85 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 256 place count 85 transition count 128
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 258 place count 85 transition count 126
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 261 place count 83 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 262 place count 82 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 264 place count 81 transition count 124
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 271 place count 81 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 272 place count 81 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 272 place count 81 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 274 place count 80 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 276 place count 78 transition count 120
Applied a total of 276 rules in 31 ms. Remains 78 /212 variables (removed 134) and now considering 120/268 (removed 148) transitions.
// Phase 1: matrix 120 rows 78 cols
[2024-06-02 18:05:21] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:05:21] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 18:05:21] [INFO ] Invariant cache hit.
[2024-06-02 18:05:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:05:21] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-02 18:05:21] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-02 18:05:21] [INFO ] Invariant cache hit.
[2024-06-02 18:05:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 119/197 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 1/198 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 83 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2052 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 119/197 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 110/192 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/198 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 193 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2288 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 4362ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 4364ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/212 places, 120/268 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4492 ms. Remains : 78/212 places, 120/268 transitions.
[2024-06-02 18:05:25] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:05:25] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:05:25] [INFO ] Input system was already deterministic with 120 transitions.
[2024-06-02 18:05:25] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:05:25] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:05:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1111773898658620967.gal : 1 ms
[2024-06-02 18:05:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16396041480411308391.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/CTLFireability1111773898658620967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16396041480411308391.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,18817,0.028527,4316,2,272,5,3052,6,0,425,2703,0


Converting to forward existential form...Done !
original formula: A((AG(((AG((p246==1)) + (p324==1)) + (p207==1))) + AG((p228==1))) U AF(((AF((p341==1)) + (p331==1)) + (p253==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((!(EG(!((p341==1)))) + (p331==1)) + (p253==1))))))))) * !(E(!(!(EG(!(((!(EG(!((p341==1)...371
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t36, t43, t71, Intersection with reachable at each step enabled. (destroyed/revers...186
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.369321,20316,1,0,422,101916,284,276,2838,93594,605
FORMULA CO4-PT-07-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 189 transition count 245
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 189 transition count 245
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 180 transition count 235
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 180 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 180 transition count 234
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 177 transition count 229
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 177 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 175 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 175 transition count 227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 173 transition count 225
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 173 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 173 transition count 223
Applied a total of 81 rules in 14 ms. Remains 173 /212 variables (removed 39) and now considering 223/268 (removed 45) transitions.
// Phase 1: matrix 223 rows 173 cols
[2024-06-02 18:05:25] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:05:25] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:05:25] [INFO ] Invariant cache hit.
[2024-06-02 18:05:26] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-06-02 18:05:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 223/396 variables, 173/176 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 178 constraints, problems are : Problem set: 0 solved, 222 unsolved in 7573 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/396 variables, 173/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 222/400 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 400 constraints, problems are : Problem set: 0 solved, 222 unsolved in 7951 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints]
After SMT, in 15559ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 15562ms
Starting structural reductions in LTL mode, iteration 1 : 173/212 places, 223/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15717 ms. Remains : 173/212 places, 223/268 transitions.
[2024-06-02 18:05:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:05:41] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:05:41] [INFO ] Input system was already deterministic with 223 transitions.
[2024-06-02 18:05:41] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:05:41] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:05:41] [INFO ] Time to serialize gal into /tmp/CTLFireability7611607644612902974.gal : 1 ms
[2024-06-02 18:05:41] [INFO ] Time to serialize properties into /tmp/CTLFireability7012129089882727867.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/CTLFireability7611607644612902974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7012129089882727867.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,227787,0.097069,7492,2,778,5,13700,6,0,913,16915,0


Converting to forward existential form...Done !
original formula: EX(E(!(A((p220==1) U ((p133==1)&&(p370==1)))) U (p197==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),!(!((E(!(((p133==1)&&(p370==1))) U (!((p220==1)) * !(((p133==1)&&(p370==1))))) + EG(!(((p133==1)...196
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t153, t176, t205, Inter...249
(forward)formula 0,1,4.63236,163308,1,0,765,977709,478,449,5101,1.04161e+06,1021
FORMULA CO4-PT-07-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 189 transition count 245
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 189 transition count 245
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 179 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 179 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 179 transition count 233
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 176 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 176 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 174 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 174 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 172 transition count 224
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 172 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 172 transition count 222
Applied a total of 83 rules in 8 ms. Remains 172 /212 variables (removed 40) and now considering 222/268 (removed 46) transitions.
// Phase 1: matrix 222 rows 172 cols
[2024-06-02 18:05:46] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:05:46] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 18:05:46] [INFO ] Invariant cache hit.
[2024-06-02 18:05:46] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-02 18:05:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/394 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 18:05:49] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:05:49] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 177 constraints, problems are : Problem set: 0 solved, 221 unsolved in 7873 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/394 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 221/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 398 constraints, problems are : Problem set: 0 solved, 221 unsolved in 7829 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
After SMT, in 15740ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 15743ms
Starting structural reductions in LTL mode, iteration 1 : 172/212 places, 222/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15928 ms. Remains : 172/212 places, 222/268 transitions.
[2024-06-02 18:06:02] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:06:02] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:06:02] [INFO ] Input system was already deterministic with 222 transitions.
[2024-06-02 18:06:02] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:06:02] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:06:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5766892676219100086.gal : 2 ms
[2024-06-02 18:06:02] [INFO ] Time to serialize properties into /tmp/CTLFireability11519966774842178850.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/CTLFireability5766892676219100086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11519966774842178850.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,226023,0.094927,7224,2,796,5,13037,6,0,907,15390,0


Converting to forward existential form...Done !
original formula: (EG((p238==1)) + !(E(A(EX((p105==1)) U ((p337==1)&&(p128==1))) U AF(AX(FALSE)))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG((p238==1)))),!((E(!(((p337==1)&&(p128==1))) U (!(EX((p105==1))) * !(((p337==1)&&(p128==1))))...229
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t127, t154, t178, t205, ...255
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.33253,190084,1,0,814,1.31626e+06,483,480,5359,1.0735e+06,1248
FORMULA CO4-PT-07-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 187 transition count 243
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 187 transition count 243
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 177 transition count 233
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 177 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 177 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 175 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 175 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 173 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 173 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 172 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 172 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 172 transition count 224
Applied a total of 82 rules in 16 ms. Remains 172 /212 variables (removed 40) and now considering 224/268 (removed 44) transitions.
// Phase 1: matrix 224 rows 172 cols
[2024-06-02 18:06:08] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:06:08] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 18:06:08] [INFO ] Invariant cache hit.
[2024-06-02 18:06:08] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-06-02 18:06:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 224/396 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 18:06:11] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:06:11] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 177 constraints, problems are : Problem set: 0 solved, 223 unsolved in 7696 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 224/396 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 223/400 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 400 constraints, problems are : Problem set: 0 solved, 223 unsolved in 7312 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints]
After SMT, in 15049ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 15051ms
Starting structural reductions in LTL mode, iteration 1 : 172/212 places, 224/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15216 ms. Remains : 172/212 places, 224/268 transitions.
[2024-06-02 18:06:23] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:06:23] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:06:23] [INFO ] Input system was already deterministic with 224 transitions.
[2024-06-02 18:06:23] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:06:23] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:06:23] [INFO ] Time to serialize gal into /tmp/CTLFireability728676322634695601.gal : 1 ms
[2024-06-02 18:06:23] [INFO ] Time to serialize properties into /tmp/CTLFireability10672671586946784655.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/CTLFireability728676322634695601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10672671586946784655.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,252695,0.111468,7224,2,789,5,13612,6,0,910,15580,0


Converting to forward existential form...Done !
original formula: (EF((p337==1)) * A(EG((p304==1)) U AX(FALSE)))
=> equivalent forward existential formula: [(((Init * E(TRUE U (p337==1))) * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!(EG((p304==1))) * !(!(...183
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t45, t46, t49, t158, t181, t2...259
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.49372,128392,1,0,578,834685,482,366,5676,721396,856
FORMULA CO4-PT-07-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 187 transition count 243
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 187 transition count 243
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 176 transition count 231
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 176 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 176 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 173 transition count 225
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 173 transition count 225
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 171 transition count 223
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 171 transition count 223
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 169 transition count 221
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 169 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 169 transition count 219
Applied a total of 89 rules in 8 ms. Remains 169 /212 variables (removed 43) and now considering 219/268 (removed 49) transitions.
// Phase 1: matrix 219 rows 169 cols
[2024-06-02 18:06:27] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:06:27] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 18:06:27] [INFO ] Invariant cache hit.
[2024-06-02 18:06:27] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-06-02 18:06:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/388 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-02 18:06:30] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:06:30] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 174 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7715 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/388 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 218/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/388 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 392 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7151 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
After SMT, in 14907ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 14910ms
Starting structural reductions in LTL mode, iteration 1 : 169/212 places, 219/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15087 ms. Remains : 169/212 places, 219/268 transitions.
[2024-06-02 18:06:42] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:06:42] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:06:42] [INFO ] Input system was already deterministic with 219 transitions.
[2024-06-02 18:06:42] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:06:42] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:06:42] [INFO ] Time to serialize gal into /tmp/CTLFireability5064663219445731443.gal : 1 ms
[2024-06-02 18:06:42] [INFO ] Time to serialize properties into /tmp/CTLFireability13226570087842479414.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/CTLFireability5064663219445731443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13226570087842479414.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,220731,0.110824,7484,2,780,5,13250,6,0,893,16423,0


Converting to forward existential form...Done !
original formula: (AG((p0==1)) + EF(EG((AX(((p279==1)||(p103==1))) * (p334==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U EG((!(EX(!(((p279==1)||(p103==1))))) * (p334==1)))))),TRUE) * !((p0==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t153, t176, t203, Inter...249
(forward)formula 0,0,0.608842,27892,1,0,295,92484,469,181,5299,99012,468
FORMULA CO4-PT-07-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 186 transition count 242
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 186 transition count 242
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 175 transition count 230
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 175 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 175 transition count 229
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 172 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 172 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 170 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 170 transition count 222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 168 transition count 220
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 168 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 168 transition count 218
Applied a total of 91 rules in 7 ms. Remains 168 /212 variables (removed 44) and now considering 218/268 (removed 50) transitions.
// Phase 1: matrix 218 rows 168 cols
[2024-06-02 18:06:43] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:06:43] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 18:06:43] [INFO ] Invariant cache hit.
[2024-06-02 18:06:43] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:06:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/386 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:06:46] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:06:46] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 173 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7365 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/386 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 217/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 390 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7171 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints]
After SMT, in 14583ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 14585ms
Starting structural reductions in LTL mode, iteration 1 : 168/212 places, 218/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14857 ms. Remains : 168/212 places, 218/268 transitions.
[2024-06-02 18:06:58] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:06:58] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:06:58] [INFO ] Input system was already deterministic with 218 transitions.
[2024-06-02 18:06:58] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:06:58] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:06:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11792509074836475541.gal : 1 ms
[2024-06-02 18:06:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4446197957898469309.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/CTLFireability11792509074836475541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4446197957898469309.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,218967,0.095925,7224,2,769,5,12746,6,0,888,15298,0


Converting to forward existential form...Done !
original formula: EX((p381==0))
=> equivalent forward existential formula: [(EY(Init) * (p381==0))] != FALSE
(forward)formula 0,1,0.105588,7488,1,0,8,12746,8,1,1083,15298,2
FORMULA CO4-PT-07-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-06-02 18:06:58] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:06:58] [INFO ] Flatten gal took : 6 ms
Total runtime 225084 ms.

BK_STOP 1717351618317

--------------------
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="CO4-PT-07"
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 CO4-PT-07, 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 r550-tall-171734898400050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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