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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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 17K 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 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 177K 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-12-CTLFireability-2024-00
FORMULA_NAME CO4-PT-12-CTLFireability-2024-01
FORMULA_NAME CO4-PT-12-CTLFireability-2024-02
FORMULA_NAME CO4-PT-12-CTLFireability-2024-03
FORMULA_NAME CO4-PT-12-CTLFireability-2024-04
FORMULA_NAME CO4-PT-12-CTLFireability-2024-05
FORMULA_NAME CO4-PT-12-CTLFireability-2024-06
FORMULA_NAME CO4-PT-12-CTLFireability-2024-07
FORMULA_NAME CO4-PT-12-CTLFireability-2024-08
FORMULA_NAME CO4-PT-12-CTLFireability-2024-09
FORMULA_NAME CO4-PT-12-CTLFireability-2024-10
FORMULA_NAME CO4-PT-12-CTLFireability-2024-11
FORMULA_NAME CO4-PT-12-CTLFireability-2024-12
FORMULA_NAME CO4-PT-12-CTLFireability-2024-13
FORMULA_NAME CO4-PT-12-CTLFireability-2024-14
FORMULA_NAME CO4-PT-12-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717351955222

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:12:36] [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:12:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:12:36] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-06-02 18:12:36] [INFO ] Transformed 649 places.
[2024-06-02 18:12:36] [INFO ] Transformed 782 transitions.
[2024-06-02 18:12:36] [INFO ] Found NUPN structural information;
[2024-06-02 18:12:36] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 172 places in 10 ms
Reduce places removed 172 places and 219 transitions.
FORMULA CO4-PT-12-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 563/563 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 559
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 88 place count 393 transition count 490
Iterating global reduction 1 with 68 rules applied. Total rules applied 156 place count 393 transition count 490
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 201 place count 348 transition count 445
Iterating global reduction 1 with 45 rules applied. Total rules applied 246 place count 348 transition count 445
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 250 place count 348 transition count 441
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 267 place count 331 transition count 424
Iterating global reduction 2 with 17 rules applied. Total rules applied 284 place count 331 transition count 424
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 297 place count 318 transition count 411
Iterating global reduction 2 with 13 rules applied. Total rules applied 310 place count 318 transition count 411
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 312 place count 318 transition count 409
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 318 place count 312 transition count 403
Iterating global reduction 3 with 6 rules applied. Total rules applied 324 place count 312 transition count 403
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 326 place count 310 transition count 401
Iterating global reduction 3 with 2 rules applied. Total rules applied 328 place count 310 transition count 401
Applied a total of 328 rules in 120 ms. Remains 310 /477 variables (removed 167) and now considering 401/563 (removed 162) transitions.
// Phase 1: matrix 401 rows 310 cols
[2024-06-02 18:12:36] [INFO ] Computed 6 invariants in 24 ms
[2024-06-02 18:12:37] [INFO ] Implicit Places using invariants in 249 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 278 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 309/477 places, 401/563 transitions.
Applied a total of 0 rules in 6 ms. Remains 309 /309 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 420 ms. Remains : 309/477 places, 401/563 transitions.
Support contains 80 out of 309 places after structural reductions.
[2024-06-02 18:12:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:12:37] [INFO ] Flatten gal took : 54 ms
[2024-06-02 18:12:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-12-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:12:37] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:12:37] [INFO ] Input system was already deterministic with 401 transitions.
Support contains 67 out of 309 places (down from 80) after GAL structural reductions.
RANDOM walk for 40000 steps (105 resets) in 1751 ms. (22 steps per ms) remains 41/50 properties
BEST_FIRST walk for 4002 steps (28 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (29 resets) in 38 ms. (102 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (27 resets) in 40 ms. (97 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (26 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (26 resets) in 55 ms. (71 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (22 resets) in 23 ms. (166 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (29 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (25 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (27 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 28 ms. (138 steps per ms) remains 37/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (27 resets) in 15 ms. (250 steps per ms) remains 32/37 properties
BEST_FIRST walk for 4001 steps (27 resets) in 33 ms. (117 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (24 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (25 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (29 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (30 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (31 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (29 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (27 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (30 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (25 resets) in 14 ms. (266 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (30 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (25 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (30 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (29 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (27 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (29 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
// Phase 1: matrix 401 rows 309 cols
[2024-06-02 18:12:38] [INFO ] Computed 5 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 29/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 4/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 162/239 variables, 77/82 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 233/472 variables, 103/185 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 159/631 variables, 82/267 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 59/690 variables, 34/301 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/690 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 13 (OVERLAPS) 14/704 variables, 9/310 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/704 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 5/709 variables, 3/313 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/709 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 17 (OVERLAPS) 1/710 variables, 1/314 constraints. Problems are: Problem set: 2 solved, 28 unsolved
[2024-06-02 18:12:40] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 27 ms to minimize.
[2024-06-02 18:12:40] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
Problem AtomicPropp5 is UNSAT
At refinement iteration 18 (INCLUDED_ONLY) 0/710 variables, 2/316 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/710 variables, 0/316 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 20 (OVERLAPS) 0/710 variables, 0/316 constraints. Problems are: Problem set: 3 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 710/710 variables, and 316 constraints, problems are : Problem set: 3 solved, 27 unsolved in 3420 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 32/70 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 27 unsolved
[2024-06-02 18:12:41] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:12:41] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:12:42] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 4/74 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 156/230 variables, 74/83 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 5/88 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/88 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 223/453 variables, 98/186 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 22/208 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 1/209 constraints. Problems are: Problem set: 3 solved, 27 unsolved
[2024-06-02 18:12:42] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 1/210 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 0/210 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 160/613 variables, 81/291 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/613 variables, 0/291 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 64/677 variables, 37/328 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/677 variables, 0/328 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 19 (OVERLAPS) 24/701 variables, 13/341 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/701 variables, 0/341 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 21 (OVERLAPS) 8/709 variables, 5/346 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/709 variables, 0/346 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 23 (OVERLAPS) 1/710 variables, 1/347 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/710 variables, 0/347 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 25 (OVERLAPS) 0/710 variables, 0/347 constraints. Problems are: Problem set: 3 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 710/710 variables, and 347 constraints, problems are : Problem set: 3 solved, 27 unsolved in 4796 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 27/30 constraints, Known Traps: 6/6 constraints]
After SMT, in 8292ms problems are : Problem set: 3 solved, 27 unsolved
Parikh walk visited 22 properties in 7237 ms.
Support contains 7 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 401/401 transitions.
Graph (trivial) has 303 edges and 309 vertex of which 3 / 309 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 590 edges and 307 vertex of which 292 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 146 rules applied. Total rules applied 148 place count 292 transition count 240
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 132 rules applied. Total rules applied 280 place count 163 transition count 237
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 4 rules applied. Total rules applied 284 place count 162 transition count 234
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 289 place count 160 transition count 231
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 292 place count 157 transition count 231
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 292 place count 157 transition count 216
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 322 place count 142 transition count 216
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 334 place count 130 transition count 203
Iterating global reduction 5 with 12 rules applied. Total rules applied 346 place count 130 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 347 place count 130 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 347 place count 130 transition count 201
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 349 place count 129 transition count 201
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 356 place count 122 transition count 181
Iterating global reduction 6 with 7 rules applied. Total rules applied 363 place count 122 transition count 181
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 365 place count 122 transition count 179
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 366 place count 121 transition count 178
Iterating global reduction 7 with 1 rules applied. Total rules applied 367 place count 121 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 368 place count 121 transition count 177
Performed 49 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 466 place count 72 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 469 place count 72 transition count 111
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 472 place count 69 transition count 105
Iterating global reduction 9 with 3 rules applied. Total rules applied 475 place count 69 transition count 105
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 476 place count 68 transition count 104
Iterating global reduction 9 with 1 rules applied. Total rules applied 477 place count 68 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 478 place count 68 transition count 103
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 28 rules applied. Total rules applied 506 place count 54 transition count 106
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 514 place count 54 transition count 98
Discarding 10 places :
Symmetric choice reduction at 11 with 10 rule applications. Total rules 524 place count 44 transition count 78
Iterating global reduction 11 with 10 rules applied. Total rules applied 534 place count 44 transition count 78
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 541 place count 44 transition count 71
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 542 place count 43 transition count 68
Iterating global reduction 12 with 1 rules applied. Total rules applied 543 place count 43 transition count 68
Free-agglomeration rule applied 7 times.
Iterating global reduction 12 with 7 rules applied. Total rules applied 550 place count 43 transition count 61
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 559 place count 36 transition count 59
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 561 place count 36 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 562 place count 36 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 563 place count 35 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 564 place count 34 transition count 57
Applied a total of 564 rules in 67 ms. Remains 34 /309 variables (removed 275) and now considering 57/401 (removed 344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 34/309 places, 57/401 transitions.
RANDOM walk for 25417 steps (2119 resets) in 223 ms. (113 steps per ms) remains 0/5 properties
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2024-06-02 18:12:54] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:12:54] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:12:54] [INFO ] Input system was already deterministic with 401 transitions.
Computed a total of 33 stabilizing places and 57 stable transitions
Graph (complete) has 593 edges and 309 vertex of which 304 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 309/309 places, 401/401 transitions.
Graph (trivial) has 297 edges and 309 vertex of which 3 / 309 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 591 edges and 307 vertex of which 302 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 301 transition count 273
Reduce places removed 119 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 122 rules applied. Total rules applied 243 place count 182 transition count 270
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 249 place count 181 transition count 265
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 254 place count 176 transition count 265
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 254 place count 176 transition count 247
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 290 place count 158 transition count 247
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 306 place count 142 transition count 229
Iterating global reduction 4 with 16 rules applied. Total rules applied 322 place count 142 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 323 place count 142 transition count 228
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 323 place count 142 transition count 225
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 329 place count 139 transition count 225
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 337 place count 131 transition count 205
Iterating global reduction 5 with 8 rules applied. Total rules applied 345 place count 131 transition count 205
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 387 place count 110 transition count 184
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 5 with 7 rules applied. Total rules applied 394 place count 110 transition count 177
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 397 place count 108 transition count 176
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 400 place count 105 transition count 170
Iterating global reduction 7 with 3 rules applied. Total rules applied 403 place count 105 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 417 place count 105 transition count 156
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 7 with 7 rules applied. Total rules applied 424 place count 105 transition count 149
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 431 place count 98 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 431 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 9 with 4 rules applied. Total rules applied 435 place count 96 transition count 147
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 9 with 2 rules applied. Total rules applied 437 place count 95 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 438 place count 94 transition count 145
Applied a total of 438 rules in 54 ms. Remains 94 /309 variables (removed 215) and now considering 145/401 (removed 256) transitions.
// Phase 1: matrix 145 rows 94 cols
[2024-06-02 18:12:54] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:12:54] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:12:54] [INFO ] Invariant cache hit.
[2024-06-02 18:12:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:12:54] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-06-02 18:12:54] [INFO ] Redundant transitions in 4 ms returned []
Running 142 sub problems to find dead transitions.
[2024-06-02 18:12:54] [INFO ] Invariant cache hit.
[2024-06-02 18:12:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-02 18:12:54] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:12:55] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD130 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 144/238 variables, 94/101 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 2/103 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 1/239 variables, 1/104 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/239 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 104 constraints, problems are : Problem set: 2 solved, 140 unsolved in 3816 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 144/238 variables, 94/101 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 2/103 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 140/243 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 1/239 variables, 1/244 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/244 constraints. Problems are: Problem set: 2 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 0/239 variables, 0/244 constraints. Problems are: Problem set: 2 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 244 constraints, problems are : Problem set: 2 solved, 140 unsolved in 3906 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 140/142 constraints, Known Traps: 2/2 constraints]
After SMT, in 7777ms problems are : Problem set: 2 solved, 140 unsolved
Search for dead transitions found 2 dead transitions in 7780ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 94/309 places, 143/401 transitions.
Applied a total of 0 rules in 8 ms. Remains 94 /94 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-06-02 18:13:02] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 7994 ms. Remains : 94/309 places, 143/401 transitions.
[2024-06-02 18:13:02] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:13:02] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:13:02] [INFO ] Input system was already deterministic with 143 transitions.
[2024-06-02 18:13:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:13:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:13:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8543577712761557612.gal : 4 ms
[2024-06-02 18:13:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8562524233285960080.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/CTLFireability8543577712761557612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8562524233285960080.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,282271,0.05583,4988,2,873,5,5789,6,0,508,5905,0


Converting to forward existential form...Done !
original formula: A(((EG(AF(!(((p231==1)&&(p439==1))))) + AG(((AF((p635==1)) + (((p428==1)&&(p449==1))&&(p602==1))) + ((((p428==1)&&(p449==1))&&(p507==1))|...217
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U EG(!(((p448==1)&&(p542==1))))))))) * !(E(!(E(TRUE U EG(!(((p448==1)&&(p542==1)))))) U ...402
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t10, t14, t16, t29, t43, t49, t73, t85, t133, t134, t135, t136, t137, t138, t...266
(forward)formula 0,1,2.43899,90868,1,0,607,494284,319,270,3448,555030,758
FORMULA CO4-PT-12-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 401/401 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 279 transition count 370
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 279 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 279 transition count 368
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 84 place count 257 transition count 328
Iterating global reduction 1 with 22 rules applied. Total rules applied 106 place count 257 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 107 place count 257 transition count 327
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 120 place count 244 transition count 314
Iterating global reduction 2 with 13 rules applied. Total rules applied 133 place count 244 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 137 place count 244 transition count 310
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 140 place count 241 transition count 307
Iterating global reduction 3 with 3 rules applied. Total rules applied 143 place count 241 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 144 place count 241 transition count 306
Applied a total of 144 rules in 27 ms. Remains 241 /309 variables (removed 68) and now considering 306/401 (removed 95) transitions.
// Phase 1: matrix 306 rows 241 cols
[2024-06-02 18:13:04] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:13:04] [INFO ] Implicit Places using invariants in 57 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/309 places, 306/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 240/309 places, 306/401 transitions.
[2024-06-02 18:13:04] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:13:04] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:13:04] [INFO ] Input system was already deterministic with 306 transitions.
[2024-06-02 18:13:04] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:13:04] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:13:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14710447390655294669.gal : 3 ms
[2024-06-02 18:13:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8621285664561046301.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/CTLFireability14710447390655294669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8621285664561046301.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41208e+07,0.196992,11156,2,3394,5,28950,6,0,1262,33920,0


Converting to forward existential form...Done !
original formula: (AG(((p404==0)&&(p165==1))) + EF(AX(((p192==1)&&(p498==0)))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U !(EX(!(((p192==1)&&(p498==0)))))))),TRUE) * !(((p404==0)&&(p165==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55,...390
(forward)formula 0,1,5.2527,153448,1,0,453,663598,636,279,7297,676359,655
FORMULA CO4-PT-12-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 309/309 places, 401/401 transitions.
Graph (trivial) has 308 edges and 309 vertex of which 3 / 309 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 591 edges and 307 vertex of which 302 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 128 place count 301 transition count 266
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 129 rules applied. Total rules applied 257 place count 175 transition count 263
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 261 place count 174 transition count 260
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 264 place count 171 transition count 260
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 264 place count 171 transition count 245
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 294 place count 156 transition count 245
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 309 place count 141 transition count 228
Iterating global reduction 4 with 15 rules applied. Total rules applied 324 place count 141 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 325 place count 141 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 325 place count 141 transition count 225
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 329 place count 139 transition count 225
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 338 place count 130 transition count 198
Iterating global reduction 5 with 9 rules applied. Total rules applied 347 place count 130 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 349 place count 130 transition count 196
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 397 place count 106 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 with 6 rules applied. Total rules applied 403 place count 106 transition count 166
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 406 place count 104 transition count 165
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 409 place count 101 transition count 162
Iterating global reduction 8 with 3 rules applied. Total rules applied 412 place count 101 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 426 place count 101 transition count 148
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 8 with 7 rules applied. Total rules applied 433 place count 101 transition count 141
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 440 place count 94 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 440 place count 94 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 442 place count 93 transition count 140
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 10 with 2 rules applied. Total rules applied 444 place count 92 transition count 139
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 446 place count 90 transition count 137
Applied a total of 446 rules in 47 ms. Remains 90 /309 variables (removed 219) and now considering 137/401 (removed 264) transitions.
// Phase 1: matrix 137 rows 90 cols
[2024-06-02 18:13:10] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:13:10] [INFO ] Implicit Places using invariants in 46 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 89/309 places, 137/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 97 ms. Remains : 89/309 places, 137/401 transitions.
[2024-06-02 18:13:10] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:13:10] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:13:10] [INFO ] Input system was already deterministic with 137 transitions.
[2024-06-02 18:13:10] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:13:10] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:13:10] [INFO ] Time to serialize gal into /tmp/CTLFireability6302580120517111167.gal : 1 ms
[2024-06-02 18:13:10] [INFO ] Time to serialize properties into /tmp/CTLFireability12788970389562681778.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/CTLFireability6302580120517111167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12788970389562681778.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,194257,0.023148,4120,2,331,5,2740,6,0,483,2293,0


Converting to forward existential form...Done !
original formula: EF(((E(EF((p516==1)) U (p567==1)) * EF((p542==1))) * (p299==0)))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * (p299==0)) * E(E(TRUE U (p516==1)) U (p567==1))),TRUE) * (p542==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t18, t31, t48, t54, t74, t131, Intersection with reachable at each step enabled. (d...201
(forward)formula 0,1,0.35867,18000,1,0,335,82263,301,214,3039,72949,434
FORMULA CO4-PT-12-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 309/309 places, 401/401 transitions.
Graph (trivial) has 304 edges and 309 vertex of which 3 / 309 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 591 edges and 307 vertex of which 302 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 125 place count 301 transition count 269
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 126 rules applied. Total rules applied 251 place count 178 transition count 266
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 256 place count 177 transition count 262
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 260 place count 173 transition count 262
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 260 place count 173 transition count 244
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 296 place count 155 transition count 244
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 313 place count 138 transition count 225
Iterating global reduction 4 with 17 rules applied. Total rules applied 330 place count 138 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 331 place count 138 transition count 224
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 331 place count 138 transition count 222
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 335 place count 136 transition count 222
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 345 place count 126 transition count 194
Iterating global reduction 5 with 10 rules applied. Total rules applied 355 place count 126 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 357 place count 126 transition count 192
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 399 place count 105 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 6 with 7 rules applied. Total rules applied 406 place count 105 transition count 164
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 409 place count 103 transition count 163
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 412 place count 100 transition count 160
Iterating global reduction 8 with 3 rules applied. Total rules applied 415 place count 100 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 429 place count 100 transition count 146
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 8 with 7 rules applied. Total rules applied 436 place count 100 transition count 139
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 443 place count 93 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 443 place count 93 transition count 137
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 447 place count 91 transition count 137
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 10 with 2 rules applied. Total rules applied 449 place count 90 transition count 136
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 450 place count 90 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 451 place count 89 transition count 135
Applied a total of 451 rules in 30 ms. Remains 89 /309 variables (removed 220) and now considering 135/401 (removed 266) transitions.
// Phase 1: matrix 135 rows 89 cols
[2024-06-02 18:13:10] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:13:10] [INFO ] Implicit Places using invariants in 36 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 88/309 places, 135/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 69 ms. Remains : 88/309 places, 135/401 transitions.
[2024-06-02 18:13:10] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:13:10] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:13:10] [INFO ] Input system was already deterministic with 135 transitions.
[2024-06-02 18:13:10] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:13:10] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:13:10] [INFO ] Time to serialize gal into /tmp/CTLFireability5568368337993901311.gal : 1 ms
[2024-06-02 18:13:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6668638378404952411.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/CTLFireability5568368337993901311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6668638378404952411.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,268329,0.028259,4448,2,541,5,3794,6,0,477,3361,0


Converting to forward existential form...Done !
original formula: AF(AG(AF((((E((p303==1) U ((p188==1)&&(p439==1))) + (p442!=1)) + ((p540!=1)||(p644!=1))) + (p153!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!((((E((p303==1) U ((p188==1)&&(p439==1))) + (p442!=1)) + ((p540!=1)||(p644!=1)))...185
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t10, t11, t25, t38, t39, t44, t80, t100, t101, t102, t103, t104, t105, t106, t107...311
Using saturation style SCC detection
(forward)formula 0,1,0.252252,14216,1,0,261,50744,307,133,3127,44502,328
FORMULA CO4-PT-12-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 401/401 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 285 transition count 376
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 285 transition count 376
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 285 transition count 374
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 267 transition count 338
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 267 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 267 transition count 337
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 98 place count 256 transition count 326
Iterating global reduction 2 with 11 rules applied. Total rules applied 109 place count 256 transition count 326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 112 place count 256 transition count 323
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 254 transition count 321
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 254 transition count 321
Applied a total of 116 rules in 17 ms. Remains 254 /309 variables (removed 55) and now considering 321/401 (removed 80) transitions.
// Phase 1: matrix 321 rows 254 cols
[2024-06-02 18:13:10] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:13:11] [INFO ] Implicit Places using invariants in 70 ms returned [183]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 253/309 places, 321/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 253 /253 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 253/309 places, 321/401 transitions.
[2024-06-02 18:13:11] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:13:11] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:13:11] [INFO ] Input system was already deterministic with 321 transitions.
[2024-06-02 18:13:11] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:13:11] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:13:11] [INFO ] Time to serialize gal into /tmp/CTLFireability6804509321690005284.gal : 1 ms
[2024-06-02 18:13:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3480910112927810147.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/CTLFireability6804509321690005284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3480910112927810147.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,3.08528e+07,0.254102,14140,2,3843,5,37738,6,0,1329,52185,0


Converting to forward existential form...Done !
original formula: ((AG(AX((!(A((p495==1) U (p195==1))) + (p186!=1)))) * EG(E((p218!=1) U !(((!((p351==1)&&(p439==1)))&&((p426==1)||(p597==1))))))) * AX((((...209
=> equivalent forward existential formula: (([(((EY(FwdU(Init,TRUE)) * !((p186!=1))) * !(EG(!((p195==1))))) * !(E(!((p195==1)) U (!((p495==1)) * !((p195==1...395
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t19, t24, t33, t34, t43, t45, t46, t47, t48, t53, t54,...400
(forward)formula 0,0,8.13871,246764,1,0,471,1.1991e+06,667,293,7685,1.20237e+06,684
FORMULA CO4-PT-12-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 309/309 places, 401/401 transitions.
Graph (trivial) has 317 edges and 309 vertex of which 3 / 309 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 591 edges and 307 vertex of which 302 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 132 place count 301 transition count 262
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 133 rules applied. Total rules applied 265 place count 171 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 266 place count 170 transition count 259
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 266 place count 170 transition count 243
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 298 place count 154 transition count 243
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 315 place count 137 transition count 224
Iterating global reduction 3 with 17 rules applied. Total rules applied 332 place count 137 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 333 place count 137 transition count 223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 333 place count 137 transition count 220
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 339 place count 134 transition count 220
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 350 place count 123 transition count 191
Iterating global reduction 4 with 11 rules applied. Total rules applied 361 place count 123 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 363 place count 123 transition count 189
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 409 place count 100 transition count 166
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 5 with 7 rules applied. Total rules applied 416 place count 100 transition count 159
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 419 place count 98 transition count 158
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 422 place count 95 transition count 155
Iterating global reduction 7 with 3 rules applied. Total rules applied 425 place count 95 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 439 place count 95 transition count 141
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 7 with 7 rules applied. Total rules applied 446 place count 95 transition count 134
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 453 place count 88 transition count 134
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 453 place count 88 transition count 132
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 457 place count 86 transition count 132
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 459 place count 85 transition count 131
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 461 place count 83 transition count 129
Applied a total of 461 rules in 24 ms. Remains 83 /309 variables (removed 226) and now considering 129/401 (removed 272) transitions.
// Phase 1: matrix 129 rows 83 cols
[2024-06-02 18:13:19] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:13:19] [INFO ] Implicit Places using invariants in 105 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 82/309 places, 129/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 132 ms. Remains : 82/309 places, 129/401 transitions.
[2024-06-02 18:13:19] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:13:19] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:13:19] [INFO ] Input system was already deterministic with 129 transitions.
[2024-06-02 18:13:19] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:13:19] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:13:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16860296765797405371.gal : 17 ms
[2024-06-02 18:13:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11645868655526149327.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16860296765797405371.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11645868655526149327.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (4794 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (646 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Finished probabilistic random walk after 2294 steps, run visited all 1 properties in 31 ms. (steps per millisecond=74 )
Probabilistic random walk after 2294 steps, saw 795 distinct states, run finished after 34 ms. (steps per millisecond=67 ) properties seen :1
FORMULA CO4-PT-12-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality11645868655526149327.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 12
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 401/401 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 279 transition count 370
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 279 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 279 transition count 368
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 86 place count 255 transition count 326
Iterating global reduction 1 with 24 rules applied. Total rules applied 110 place count 255 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 111 place count 255 transition count 325
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 126 place count 240 transition count 310
Iterating global reduction 2 with 15 rules applied. Total rules applied 141 place count 240 transition count 310
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 145 place count 240 transition count 306
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 237 transition count 303
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 237 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 237 transition count 302
Applied a total of 152 rules in 14 ms. Remains 237 /309 variables (removed 72) and now considering 302/401 (removed 99) transitions.
// Phase 1: matrix 302 rows 237 cols
[2024-06-02 18:13:19] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:13:19] [INFO ] Implicit Places using invariants in 70 ms returned [173]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/309 places, 302/401 transitions.
Applied a total of 0 rules in 1 ms. Remains 236 /236 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 236/309 places, 302/401 transitions.
[2024-06-02 18:13:19] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:13:19] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:13:19] [INFO ] Input system was already deterministic with 302 transitions.
[2024-06-02 18:13:19] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:13:19] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:13:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9546651433195190252.gal : 13 ms
[2024-06-02 18:13:19] [INFO ] Time to serialize properties into /tmp/CTLFireability10875431665570989319.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/CTLFireability9546651433195190252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10875431665570989319.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.35256e+07,0.17407,10604,2,3250,5,27817,6,0,1242,32671,0


Converting to forward existential form...Done !
original formula: A(!(((EF(((p393==1)&&(p498==1))) + (p298==1)) * EG(AF((p214==1))))) U !(AF(AX((p491==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EG(!(!(EX(!((p491==1)))))))))))) * !(E(!(!(!(EG(!(!(EX(!((p491==1))))))))) U (!(!(((E(TRUE ...274
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55,...390
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 18:13:49] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:13:49] [INFO ] Applying decomposition
[2024-06-02 18:13:49] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12049028717175203309.txt' '-o' '/tmp/graph12049028717175203309.bin' '-w' '/tmp/graph12049028717175203309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12049028717175203309.bin' '-l' '-1' '-v' '-w' '/tmp/graph12049028717175203309.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:13:49] [INFO ] Decomposing Gal with order
[2024-06-02 18:13:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:13:49] [INFO ] Removed a total of 101 redundant transitions.
[2024-06-02 18:13:50] [INFO ] Flatten gal took : 46 ms
[2024-06-02 18:13:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 13 ms.
[2024-06-02 18:13:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4369993652665047627.gal : 5 ms
[2024-06-02 18:13:50] [INFO ] Time to serialize properties into /tmp/CTLFireability7995915283370669452.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/CTLFireability4369993652665047627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7995915283370669452.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.35256e+07,0.089385,6652,397,64,5256,483,679,8512,81,1709,0


Converting to forward existential form...Done !
original formula: A(!(((EF(((i8.i2.u57.p393==1)&&(i12.u73.p498==1))) + (i4.i1.u35.p298==1)) * EG(AF((i6.i0.u22.p214==1))))) U !(AF(AX((i12.u70.p491==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EG(!(!(EX(!((i12.u70.p491==1)))))))))))) * !(E(!(!(!(EG(!(!(EX(!((i12.u70.p491==1))))))))) ...336
Reverse transition relation is NOT exact ! Due to transitions t0, t19, t43, t84, t128, t206, t208, t218, t247, t254, t257, t275, t278, i2.i0.t185, i2.i0.u1...656
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,12.2761,428788,1,0,838909,1104,4300,1.44296e+06,402,4354,712045
FORMULA CO4-PT-12-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 401/401 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 278 transition count 369
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 278 transition count 369
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 278 transition count 367
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 88 place count 254 transition count 325
Iterating global reduction 1 with 24 rules applied. Total rules applied 112 place count 254 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 113 place count 254 transition count 324
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 128 place count 239 transition count 309
Iterating global reduction 2 with 15 rules applied. Total rules applied 143 place count 239 transition count 309
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 147 place count 239 transition count 305
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 236 transition count 302
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 236 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 236 transition count 301
Applied a total of 154 rules in 22 ms. Remains 236 /309 variables (removed 73) and now considering 301/401 (removed 100) transitions.
// Phase 1: matrix 301 rows 236 cols
[2024-06-02 18:14:02] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:14:02] [INFO ] Implicit Places using invariants in 76 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/309 places, 301/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 235 /235 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 235/309 places, 301/401 transitions.
[2024-06-02 18:14:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:14:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:14:02] [INFO ] Input system was already deterministic with 301 transitions.
[2024-06-02 18:14:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:14:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:14:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9616012342753771064.gal : 1 ms
[2024-06-02 18:14:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6279744831601130492.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/CTLFireability9616012342753771064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6279744831601130492.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,2.33769e+07,0.178621,10888,2,3361,5,28027,6,0,1237,33224,0


Converting to forward existential form...Done !
original formula: (AX((p356==1)) + EF(EX(((p292==1)&&(p439==1)))))
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U EX(((p292==1)&&(p439==1))))))) * !((p356==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55,...390
(forward)formula 0,1,7.02826,208820,1,0,442,999557,625,273,7136,1.03236e+06,645
FORMULA CO4-PT-12-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 309/309 places, 401/401 transitions.
Graph (complete) has 593 edges and 309 vertex of which 304 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 303 transition count 263
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 134 rules applied. Total rules applied 266 place count 172 transition count 260
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 268 place count 171 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 269 place count 170 transition count 259
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 269 place count 170 transition count 243
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 301 place count 154 transition count 243
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 319 place count 136 transition count 223
Iterating global reduction 4 with 18 rules applied. Total rules applied 337 place count 136 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 338 place count 136 transition count 222
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 338 place count 136 transition count 219
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 344 place count 133 transition count 219
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 355 place count 122 transition count 190
Iterating global reduction 5 with 11 rules applied. Total rules applied 366 place count 122 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 368 place count 122 transition count 188
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 414 place count 99 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 6 with 7 rules applied. Total rules applied 421 place count 99 transition count 158
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 424 place count 97 transition count 157
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 427 place count 94 transition count 154
Iterating global reduction 8 with 3 rules applied. Total rules applied 430 place count 94 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 444 place count 94 transition count 140
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 8 with 7 rules applied. Total rules applied 451 place count 94 transition count 133
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 458 place count 87 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 458 place count 87 transition count 131
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 462 place count 85 transition count 131
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 10 with 2 rules applied. Total rules applied 464 place count 84 transition count 130
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 466 place count 82 transition count 128
Applied a total of 466 rules in 33 ms. Remains 82 /309 variables (removed 227) and now considering 128/401 (removed 273) transitions.
// Phase 1: matrix 128 rows 82 cols
[2024-06-02 18:14:09] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:14:09] [INFO ] Implicit Places using invariants in 45 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 81/309 places, 128/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 81 ms. Remains : 81/309 places, 128/401 transitions.
[2024-06-02 18:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:14:09] [INFO ] Input system was already deterministic with 128 transitions.
[2024-06-02 18:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:14:09] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:14:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1199320910934002541.gal : 1 ms
[2024-06-02 18:14:09] [INFO ] Time to serialize properties into /tmp/CTLFireability8716664774828315519.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/CTLFireability1199320910934002541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8716664774828315519.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,103682,0.027659,4092,2,339,5,2556,6,0,445,2041,0


Converting to forward existential form...Done !
original formula: EF(EG((p3==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p3==0))] != FALSE
Hit Full ! (commute/partial/dont) 126/0/2
(forward)formula 0,1,0.077959,6524,1,0,8,15743,19,3,2097,5677,8
FORMULA CO4-PT-12-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 309/309 places, 401/401 transitions.
Graph (trivial) has 310 edges and 309 vertex of which 3 / 309 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 591 edges and 307 vertex of which 302 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 128 place count 301 transition count 266
Reduce places removed 126 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 128 rules applied. Total rules applied 256 place count 175 transition count 264
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 259 place count 174 transition count 262
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 262 place count 172 transition count 261
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 262 place count 172 transition count 244
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 296 place count 155 transition count 244
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 311 place count 140 transition count 227
Iterating global reduction 4 with 15 rules applied. Total rules applied 326 place count 140 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 327 place count 140 transition count 226
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 327 place count 140 transition count 223
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 333 place count 137 transition count 223
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 342 place count 128 transition count 201
Iterating global reduction 5 with 9 rules applied. Total rules applied 351 place count 128 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 353 place count 128 transition count 199
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 399 place count 105 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 6 with 7 rules applied. Total rules applied 406 place count 105 transition count 169
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 409 place count 103 transition count 168
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 412 place count 100 transition count 162
Iterating global reduction 8 with 3 rules applied. Total rules applied 415 place count 100 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 426 place count 100 transition count 151
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 5 rules applied. Total rules applied 431 place count 100 transition count 146
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 6 rules applied. Total rules applied 437 place count 95 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 438 place count 94 transition count 145
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 11 with 2 rules applied. Total rules applied 440 place count 93 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 441 place count 93 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 443 place count 91 transition count 141
Applied a total of 443 rules in 32 ms. Remains 91 /309 variables (removed 218) and now considering 141/401 (removed 260) transitions.
// Phase 1: matrix 141 rows 91 cols
[2024-06-02 18:14:09] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:14:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 18:14:09] [INFO ] Invariant cache hit.
[2024-06-02 18:14:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:14:09] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-06-02 18:14:09] [INFO ] Redundant transitions in 3 ms returned []
Running 126 sub problems to find dead transitions.
[2024-06-02 18:14:09] [INFO ] Invariant cache hit.
[2024-06-02 18:14:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 140/231 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-02 18:14:10] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 1/232 variables, 1/98 constraints. Problems are: Problem set: 1 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 98 constraints, problems are : Problem set: 1 solved, 125 unsolved in 2721 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 140/231 variables, 91/97 constraints. Problems are: Problem set: 1 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 125/222 constraints. Problems are: Problem set: 1 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 1/232 variables, 1/223 constraints. Problems are: Problem set: 1 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/232 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 223 constraints, problems are : Problem set: 1 solved, 125 unsolved in 2910 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 125/126 constraints, Known Traps: 1/1 constraints]
After SMT, in 5655ms problems are : Problem set: 1 solved, 125 unsolved
Search for dead transitions found 1 dead transitions in 5656ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 91/309 places, 140/401 transitions.
Applied a total of 0 rules in 7 ms. Remains 91 /91 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-06-02 18:14:15] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 5819 ms. Remains : 91/309 places, 140/401 transitions.
[2024-06-02 18:14:15] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:14:15] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:14:15] [INFO ] Input system was already deterministic with 140 transitions.
[2024-06-02 18:14:15] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:14:15] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:14:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15772148113574768961.gal : 1 ms
[2024-06-02 18:14:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1376082637019770108.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/CTLFireability15772148113574768961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1376082637019770108.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,328537,0.026089,4188,2,416,5,2986,6,0,494,2471,0


Converting to forward existential form...Done !
original formula: A(AF((p498==1)) U !(AF((A(AG((p569==1)) U EG((p618==1))) * !(AF((p446==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EG(!((!((E(!(EG((p618==1))) U (!(!(E(TRUE U !((p569==1))))) * !(EG((p618==1))))) + EG(!(EG(...537
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t7, t10, t13, t15, t16, t17, t18, t30, t43, t49, t67, t127, t128, t129, t131, t13...258
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
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.78509,103240,1,0,1479,590098,332,868,3250,710457,1882
FORMULA CO4-PT-12-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 309/309 places, 401/401 transitions.
Graph (trivial) has 318 edges and 309 vertex of which 3 / 309 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 591 edges and 307 vertex of which 302 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 301 transition count 260
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 135 rules applied. Total rules applied 269 place count 169 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 168 transition count 257
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 270 place count 168 transition count 241
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 302 place count 152 transition count 241
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 318 place count 136 transition count 223
Iterating global reduction 3 with 16 rules applied. Total rules applied 334 place count 136 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 335 place count 136 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 335 place count 136 transition count 220
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 339 place count 134 transition count 220
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 349 place count 124 transition count 192
Iterating global reduction 4 with 10 rules applied. Total rules applied 359 place count 124 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 361 place count 124 transition count 190
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 409 place count 100 transition count 166
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 5 with 7 rules applied. Total rules applied 416 place count 100 transition count 159
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 419 place count 98 transition count 158
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 422 place count 95 transition count 155
Iterating global reduction 7 with 3 rules applied. Total rules applied 425 place count 95 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 439 place count 95 transition count 141
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 7 with 7 rules applied. Total rules applied 446 place count 95 transition count 134
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 453 place count 88 transition count 134
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 453 place count 88 transition count 132
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 457 place count 86 transition count 132
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 459 place count 85 transition count 131
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 461 place count 83 transition count 129
Applied a total of 461 rules in 22 ms. Remains 83 /309 variables (removed 226) and now considering 129/401 (removed 272) transitions.
// Phase 1: matrix 129 rows 83 cols
[2024-06-02 18:14:18] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:14:18] [INFO ] Implicit Places using invariants in 41 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 82/309 places, 129/401 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 65 ms. Remains : 82/309 places, 129/401 transitions.
[2024-06-02 18:14:18] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:14:18] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:14:18] [INFO ] Input system was already deterministic with 129 transitions.
[2024-06-02 18:14:18] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:14:18] [INFO ] Flatten gal took : 35 ms
[2024-06-02 18:14:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11312163449366538463.gal : 1 ms
[2024-06-02 18:14:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4797843049273622381.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11312163449366538463.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4797843049273622381.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4797843049273622381.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 30
RANDOM walk for 40000 steps (4819 resets) in 269 ms. (148 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 42
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :42 after 168
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :168 after 397
Reachability property CO4-PT-12-CTLFireability-2024-12 is true.
FORMULA CO4-PT-12-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,427,0.018308,4288,2,272,11,1625,6,0,447,986,0
Total reachable state count : 427

Verifying 1 reachability properties.
Reachability property CO4-PT-12-CTLFireability-2024-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CO4-PT-12-CTLFireability-2024-12,1,0.01879,4660,2,83,11,1625,7,0,450,986,0
BEST_FIRST walk for 40004 steps (664 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1776 steps, run visited all 1 properties in 9 ms. (steps per millisecond=197 )
Probabilistic random walk after 1776 steps, saw 700 distinct states, run finished after 9 ms. (steps per millisecond=197 ) properties seen :1
Starting structural reductions in SI_CTL mode, iteration 0 : 309/309 places, 401/401 transitions.
Graph (trivial) has 317 edges and 309 vertex of which 3 / 309 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 591 edges and 307 vertex of which 302 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 301 transition count 260
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 135 rules applied. Total rules applied 269 place count 169 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 168 transition count 257
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 270 place count 168 transition count 241
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 302 place count 152 transition count 241
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 318 place count 136 transition count 224
Iterating global reduction 3 with 16 rules applied. Total rules applied 334 place count 136 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 335 place count 136 transition count 223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 335 place count 136 transition count 220
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 341 place count 133 transition count 220
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 352 place count 122 transition count 191
Iterating global reduction 4 with 11 rules applied. Total rules applied 363 place count 122 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 365 place count 122 transition count 189
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 411 place count 99 transition count 166
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 5 with 7 rules applied. Total rules applied 418 place count 99 transition count 159
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 421 place count 97 transition count 158
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 424 place count 94 transition count 155
Iterating global reduction 7 with 3 rules applied. Total rules applied 427 place count 94 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 442 place count 94 transition count 140
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 7 with 7 rules applied. Total rules applied 449 place count 94 transition count 133
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 456 place count 87 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 456 place count 87 transition count 131
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 460 place count 85 transition count 131
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 462 place count 84 transition count 130
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 464 place count 82 transition count 128
Applied a total of 464 rules in 18 ms. Remains 82 /309 variables (removed 227) and now considering 128/401 (removed 273) transitions.
// Phase 1: matrix 128 rows 82 cols
[2024-06-02 18:14:18] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:14:18] [INFO ] Implicit Places using invariants in 47 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 81/309 places, 128/401 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 67 ms. Remains : 81/309 places, 128/401 transitions.
[2024-06-02 18:14:18] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:14:18] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:14:18] [INFO ] Input system was already deterministic with 128 transitions.
[2024-06-02 18:14:18] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:14:18] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:14:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10061327955546866211.gal : 1 ms
[2024-06-02 18:14:18] [INFO ] Time to serialize properties into /tmp/CTLFireability14973621298005286427.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/CTLFireability10061327955546866211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14973621298005286427.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,155521,0.024695,4084,2,295,5,2507,6,0,443,1951,0


Converting to forward existential form...Done !
original formula: EG(AF((p640==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p640==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t23, t36, t42, t61, t122, t125, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,0.544223,22624,1,0,419,111238,282,217,2634,112797,615
FORMULA CO4-PT-12-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 401/401 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 279 transition count 370
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 279 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 279 transition count 368
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 84 place count 257 transition count 335
Iterating global reduction 1 with 22 rules applied. Total rules applied 106 place count 257 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 107 place count 257 transition count 334
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 120 place count 244 transition count 319
Iterating global reduction 2 with 13 rules applied. Total rules applied 133 place count 244 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 135 place count 244 transition count 317
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 138 place count 241 transition count 313
Iterating global reduction 3 with 3 rules applied. Total rules applied 141 place count 241 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 241 transition count 312
Applied a total of 142 rules in 15 ms. Remains 241 /309 variables (removed 68) and now considering 312/401 (removed 89) transitions.
// Phase 1: matrix 312 rows 241 cols
[2024-06-02 18:14:19] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:14:19] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 18:14:19] [INFO ] Invariant cache hit.
[2024-06-02 18:14:19] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2024-06-02 18:14:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 18:14:22] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-02 18:14:22] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:14:23] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
Problem TDEAD255 is UNSAT
[2024-06-02 18:14:23] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
[2024-06-02 18:14:23] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
Problem TDEAD265 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 5/10 constraints. Problems are: Problem set: 5 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/553 variables, 241/251 constraints. Problems are: Problem set: 5 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/251 constraints. Problems are: Problem set: 5 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/251 constraints. Problems are: Problem set: 5 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 251 constraints, problems are : Problem set: 5 solved, 306 unsolved in 12613 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 5 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 5/10 constraints. Problems are: Problem set: 5 solved, 306 unsolved
[2024-06-02 18:14:34] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/11 constraints. Problems are: Problem set: 5 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 312/553 variables, 241/252 constraints. Problems are: Problem set: 5 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 306/558 constraints. Problems are: Problem set: 5 solved, 306 unsolved
[2024-06-02 18:14:38] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 1/559 constraints. Problems are: Problem set: 5 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/559 constraints. Problems are: Problem set: 5 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/553 variables, 0/559 constraints. Problems are: Problem set: 5 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 559 constraints, problems are : Problem set: 5 solved, 306 unsolved in 25731 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 306/311 constraints, Known Traps: 7/7 constraints]
After SMT, in 38393ms problems are : Problem set: 5 solved, 306 unsolved
Search for dead transitions found 5 dead transitions in 38397ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 241/309 places, 307/401 transitions.
Applied a total of 0 rules in 7 ms. Remains 241 /241 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38642 ms. Remains : 241/309 places, 307/401 transitions.
[2024-06-02 18:14:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:14:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:14:58] [INFO ] Input system was already deterministic with 307 transitions.
[2024-06-02 18:14:58] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:14:58] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:14:58] [INFO ] Time to serialize gal into /tmp/CTLFireability2210066181846807485.gal : 1 ms
[2024-06-02 18:14:58] [INFO ] Time to serialize properties into /tmp/CTLFireability10371587938588703893.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/CTLFireability2210066181846807485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10371587938588703893.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.47827e+07,0.210868,11480,2,3532,5,29917,6,0,1267,36034,0


Converting to forward existential form...Done !
original formula: AG(((EG((p372==0)) * ((AX((p2==1)) + EG((p398==1))) + ((p353==0)||(((p1==0)&&(p428==1))&&((p447==1)&&(p602==1)))))) * (EF(EX(TRUE)) + (p5...164
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(EG((p372==0))))] = FALSE * [(EY(((FwdU(Init,TRUE) * !(((p353==0)||(((p1==0)&&(p428==1))&...299
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t51,...395
(forward)formula 0,0,8.34695,219876,1,0,665,1.03815e+06,647,358,7609,1.17627e+06,913
FORMULA CO4-PT-12-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-02 18:15:06] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:15:06] [INFO ] Flatten gal took : 10 ms
Total runtime 150103 ms.

BK_STOP 1717352106586

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

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