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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 6.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 255K 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-15-CTLFireability-2024-00
FORMULA_NAME CO4-PT-15-CTLFireability-2024-01
FORMULA_NAME CO4-PT-15-CTLFireability-2024-02
FORMULA_NAME CO4-PT-15-CTLFireability-2024-03
FORMULA_NAME CO4-PT-15-CTLFireability-2024-04
FORMULA_NAME CO4-PT-15-CTLFireability-2024-05
FORMULA_NAME CO4-PT-15-CTLFireability-2024-06
FORMULA_NAME CO4-PT-15-CTLFireability-2024-07
FORMULA_NAME CO4-PT-15-CTLFireability-2024-08
FORMULA_NAME CO4-PT-15-CTLFireability-2024-09
FORMULA_NAME CO4-PT-15-CTLFireability-2024-10
FORMULA_NAME CO4-PT-15-CTLFireability-2024-11
FORMULA_NAME CO4-PT-15-CTLFireability-2024-12
FORMULA_NAME CO4-PT-15-CTLFireability-2024-13
FORMULA_NAME CO4-PT-15-CTLFireability-2024-14
FORMULA_NAME CO4-PT-15-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717352357157

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:19:18] [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:19:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:19:18] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-02 18:19:18] [INFO ] Transformed 833 places.
[2024-06-02 18:19:18] [INFO ] Transformed 1106 transitions.
[2024-06-02 18:19:18] [INFO ] Found NUPN structural information;
[2024-06-02 18:19:18] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 124 places in 11 ms
Reduce places removed 124 places and 197 transitions.
FORMULA CO4-PT-15-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 909/909 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 689 transition count 906
Discarding 145 places :
Symmetric choice reduction at 1 with 145 rule applications. Total rules 168 place count 544 transition count 760
Iterating global reduction 1 with 145 rules applied. Total rules applied 313 place count 544 transition count 760
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 317 place count 544 transition count 756
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 394 place count 467 transition count 669
Iterating global reduction 2 with 77 rules applied. Total rules applied 471 place count 467 transition count 669
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 486 place count 452 transition count 647
Iterating global reduction 2 with 15 rules applied. Total rules applied 501 place count 452 transition count 647
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 503 place count 452 transition count 645
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 509 place count 446 transition count 639
Iterating global reduction 3 with 6 rules applied. Total rules applied 515 place count 446 transition count 639
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 518 place count 443 transition count 636
Iterating global reduction 3 with 3 rules applied. Total rules applied 521 place count 443 transition count 636
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 524 place count 443 transition count 633
Applied a total of 524 rules in 158 ms. Remains 443 /709 variables (removed 266) and now considering 633/909 (removed 276) transitions.
// Phase 1: matrix 633 rows 443 cols
[2024-06-02 18:19:18] [INFO ] Computed 7 invariants in 17 ms
[2024-06-02 18:19:19] [INFO ] Implicit Places using invariants in 337 ms returned [5, 377]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 370 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 441/709 places, 633/909 transitions.
Applied a total of 0 rules in 14 ms. Remains 441 /441 variables (removed 0) and now considering 633/633 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 559 ms. Remains : 441/709 places, 633/909 transitions.
Support contains 63 out of 441 places after structural reductions.
[2024-06-02 18:19:19] [INFO ] Flatten gal took : 76 ms
[2024-06-02 18:19:19] [INFO ] Flatten gal took : 52 ms
[2024-06-02 18:19:19] [INFO ] Input system was already deterministic with 633 transitions.
Support contains 59 out of 441 places (down from 63) after GAL structural reductions.
RANDOM walk for 40000 steps (771 resets) in 1671 ms. (23 steps per ms) remains 24/44 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (14 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (14 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (14 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (14 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (15 resets) in 23 ms. (166 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4002 steps (15 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
// Phase 1: matrix 633 rows 441 cols
[2024-06-02 18:19:20] [INFO ] Computed 5 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 22/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 5/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 199/259 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 448/707 variables, 166/231 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/707 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 308/1015 variables, 172/403 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1015 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 52/1067 variables, 39/442 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1067 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp36 is UNSAT
At refinement iteration 13 (OVERLAPS) 7/1074 variables, 4/446 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/446 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 0/1074 variables, 0/446 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 446 constraints, problems are : Problem set: 1 solved, 20 unsolved in 1834 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 441/441 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/53 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 5/58 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 196/254 variables, 58/63 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 4/67 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 449/703 variables, 166/233 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 16/249 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/703 variables, 0/249 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 310/1013 variables, 173/422 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1013 variables, 0/422 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 54/1067 variables, 40/462 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1067 variables, 0/462 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 15 (OVERLAPS) 7/1074 variables, 4/466 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1074 variables, 0/466 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 0/1074 variables, 0/466 constraints. Problems are: Problem set: 2 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 466 constraints, problems are : Problem set: 2 solved, 19 unsolved in 2921 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 441/441 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 4816ms problems are : Problem set: 2 solved, 19 unsolved
Parikh walk visited 18 properties in 5089 ms.
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 633/633 transitions.
Graph (trivial) has 477 edges and 441 vertex of which 2 / 441 are part of one of the 1 SCC in 10 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 907 edges and 440 vertex of which 415 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.3 ms
Discarding 25 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 183 rules applied. Total rules applied 185 place count 415 transition count 424
Reduce places removed 166 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 167 rules applied. Total rules applied 352 place count 249 transition count 423
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 352 place count 249 transition count 384
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 430 place count 210 transition count 384
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 436 place count 204 transition count 376
Iterating global reduction 2 with 6 rules applied. Total rules applied 442 place count 204 transition count 376
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 2 with 7 rules applied. Total rules applied 449 place count 204 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 450 place count 203 transition count 369
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 454 place count 199 transition count 363
Iterating global reduction 4 with 4 rules applied. Total rules applied 458 place count 199 transition count 363
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 460 place count 199 transition count 361
Performed 73 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 606 place count 126 transition count 270
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 5 with 15 rules applied. Total rules applied 621 place count 126 transition count 255
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 623 place count 125 transition count 254
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 626 place count 122 transition count 248
Iterating global reduction 7 with 3 rules applied. Total rules applied 629 place count 122 transition count 248
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 635 place count 119 transition count 245
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 636 place count 119 transition count 244
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 637 place count 118 transition count 242
Iterating global reduction 8 with 1 rules applied. Total rules applied 638 place count 118 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 639 place count 118 transition count 241
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 9 with 76 rules applied. Total rules applied 715 place count 80 transition count 281
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 9 with 57 rules applied. Total rules applied 772 place count 80 transition count 224
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 799 place count 53 transition count 143
Iterating global reduction 10 with 27 rules applied. Total rules applied 826 place count 53 transition count 143
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 844 place count 53 transition count 125
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 851 place count 46 transition count 93
Iterating global reduction 11 with 7 rules applied. Total rules applied 858 place count 46 transition count 93
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 863 place count 46 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 865 place count 45 transition count 105
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 868 place count 45 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 13 with 11 rules applied. Total rules applied 879 place count 45 transition count 91
Free-agglomeration rule applied 9 times.
Iterating global reduction 13 with 9 rules applied. Total rules applied 888 place count 45 transition count 82
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 898 place count 36 transition count 81
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 901 place count 36 transition count 81
Graph (complete) has 135 edges and 36 vertex of which 35 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 902 place count 35 transition count 81
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 905 place count 35 transition count 78
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 906 place count 34 transition count 77
Iterating global reduction 16 with 1 rules applied. Total rules applied 907 place count 34 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 908 place count 33 transition count 76
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 20 edges and 31 vertex of which 5 / 31 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 3 rules applied. Total rules applied 911 place count 28 transition count 76
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 918 place count 28 transition count 69
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 920 place count 26 transition count 62
Iterating global reduction 18 with 2 rules applied. Total rules applied 922 place count 26 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 923 place count 26 transition count 61
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 931 place count 21 transition count 58
Graph (trivial) has 16 edges and 21 vertex of which 6 / 21 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 933 place count 15 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 29 transitions.
Graph (complete) has 28 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Graph (trivial) has 11 edges and 14 vertex of which 6 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 19 with 31 rules applied. Total rules applied 964 place count 9 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 20 with 16 rules applied. Total rules applied 980 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 982 place count 9 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 982 place count 9 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 984 place count 8 transition count 10
Applied a total of 984 rules in 133 ms. Remains 8 /441 variables (removed 433) and now considering 10/633 (removed 623) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 8/441 places, 10/633 transitions.
RANDOM walk for 20019 steps (5 resets) in 81 ms. (244 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-15-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:19:30] [INFO ] Flatten gal took : 31 ms
[2024-06-02 18:19:30] [INFO ] Flatten gal took : 28 ms
[2024-06-02 18:19:30] [INFO ] Input system was already deterministic with 633 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 909 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 441/441 places, 633/633 transitions.
Graph (trivial) has 471 edges and 441 vertex of which 2 / 441 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 908 edges and 440 vertex of which 434 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 167 rules applied. Total rules applied 169 place count 433 transition count 456
Reduce places removed 164 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 166 rules applied. Total rules applied 335 place count 269 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 336 place count 268 transition count 454
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 336 place count 268 transition count 414
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 416 place count 228 transition count 414
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 422 place count 222 transition count 405
Iterating global reduction 3 with 6 rules applied. Total rules applied 428 place count 222 transition count 405
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 3 with 7 rules applied. Total rules applied 435 place count 222 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 436 place count 221 transition count 398
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 438 place count 219 transition count 394
Iterating global reduction 5 with 2 rules applied. Total rules applied 440 place count 219 transition count 394
Performed 31 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 502 place count 188 transition count 361
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 11 rules applied. Total rules applied 513 place count 188 transition count 350
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 8 rules applied. Total rules applied 521 place count 185 transition count 345
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 525 place count 183 transition count 343
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 528 place count 180 transition count 337
Iterating global reduction 8 with 3 rules applied. Total rules applied 531 place count 180 transition count 337
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 537 place count 177 transition count 334
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 8 with 3 rules applied. Total rules applied 540 place count 177 transition count 331
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 543 place count 176 transition count 329
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 545 place count 175 transition count 328
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 546 place count 174 transition count 326
Iterating global reduction 11 with 1 rules applied. Total rules applied 547 place count 174 transition count 326
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 548 place count 173 transition count 324
Iterating global reduction 11 with 1 rules applied. Total rules applied 549 place count 173 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 550 place count 173 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 552 place count 172 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 12 with 13 rules applied. Total rules applied 565 place count 172 transition count 309
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 12 with 7 rules applied. Total rules applied 572 place count 172 transition count 302
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 579 place count 165 transition count 302
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 14 with 2 rules applied. Total rules applied 581 place count 164 transition count 301
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 582 place count 164 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 583 place count 164 transition count 300
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 14 with 1 rules applied. Total rules applied 584 place count 164 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 585 place count 163 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 586 place count 162 transition count 298
Applied a total of 586 rules in 140 ms. Remains 162 /441 variables (removed 279) and now considering 298/633 (removed 335) transitions.
[2024-06-02 18:19:30] [INFO ] Flow matrix only has 272 transitions (discarded 26 similar events)
// Phase 1: matrix 272 rows 162 cols
[2024-06-02 18:19:30] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:19:30] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:19:30] [INFO ] Flow matrix only has 272 transitions (discarded 26 similar events)
[2024-06-02 18:19:30] [INFO ] Invariant cache hit.
[2024-06-02 18:19:30] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 18:19:30] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-06-02 18:19:30] [INFO ] Redundant transitions in 14 ms returned []
Running 286 sub problems to find dead transitions.
[2024-06-02 18:19:30] [INFO ] Flow matrix only has 272 transitions (discarded 26 similar events)
[2024-06-02 18:19:30] [INFO ] Invariant cache hit.
[2024-06-02 18:19:30] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 2/162 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 271/433 variables, 162/167 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 32/199 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/434 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/434 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 200 constraints, problems are : Problem set: 0 solved, 286 unsolved in 12296 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 162/162 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 2/162 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 271/433 variables, 162/167 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 32/199 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 286/485 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/434 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/434 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 486 constraints, problems are : Problem set: 0 solved, 286 unsolved in 13416 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 162/162 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
After SMT, in 25866ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 25873ms
Starting structural reductions in SI_CTL mode, iteration 1 : 162/441 places, 298/633 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26236 ms. Remains : 162/441 places, 298/633 transitions.
[2024-06-02 18:19:56] [INFO ] Flatten gal took : 33 ms
[2024-06-02 18:19:56] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:19:56] [INFO ] Input system was already deterministic with 298 transitions.
[2024-06-02 18:19:56] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:19:56] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:19:57] [INFO ] Time to serialize gal into /tmp/CTLFireability1010145377836450296.gal : 16 ms
[2024-06-02 18:19:57] [INFO ] Time to serialize properties into /tmp/CTLFireability3070500365137062568.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/CTLFireability1010145377836450296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3070500365137062568.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47961e+08,0.15851,8448,2,1945,5,22478,6,0,936,15913,0


Converting to forward existential form...Done !
original formula: AF(((p118==1) + AF((((A((p323==1) U (p269==1)) * (p596==1)) * ((p670==1)&&(p808==1))) * (p830==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((p118==1) + !(EG(!((((!((E(!((p269==1)) U (!((p323==1)) * !((p269==1)))) + EG(!((p269==1))))) * (p...217
Reverse transition relation is NOT exact ! Due to transitions t2, t7, t8, t47, t57, t83, t90, t98, t146, t168, t171, t178, t184, t212, t215, t220, t227, t2...271
Detected timeout of ITS tools.
[2024-06-02 18:20:27] [INFO ] Flatten gal took : 30 ms
[2024-06-02 18:20:27] [INFO ] Applying decomposition
[2024-06-02 18:20:27] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16849764416219904229.txt' '-o' '/tmp/graph16849764416219904229.bin' '-w' '/tmp/graph16849764416219904229.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16849764416219904229.bin' '-l' '-1' '-v' '-w' '/tmp/graph16849764416219904229.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:20:27] [INFO ] Decomposing Gal with order
[2024-06-02 18:20:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:20:27] [INFO ] Removed a total of 194 redundant transitions.
[2024-06-02 18:20:27] [INFO ] Flatten gal took : 151 ms
[2024-06-02 18:20:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 10 ms.
[2024-06-02 18:20:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11449006144131145114.gal : 21 ms
[2024-06-02 18:20:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2237736974913805051.ctl : 5 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/CTLFireability11449006144131145114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2237736974913805051.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47961e+08,0.087379,5340,144,102,1979,807,530,2748,150,1756,0


Converting to forward existential form...Done !
original formula: AF(((i1.i1.u4.p118==1) + AF((((A((i3.i1.u25.p323==1) U (i1.i3.u21.p269==1)) * (i7.i1.u47.p596==1)) * ((i8.u55.p670==1)&&(i8.u55.p808==1))...182
=> equivalent forward existential formula: [FwdG(Init,!(((i1.i1.u4.p118==1) + !(EG(!((((!((E(!((i1.i3.u21.p269==1)) U (!((i3.i1.u25.p323==1)) * !((i1.i3.u2...300
Reverse transition relation is NOT exact ! Due to transitions t212, t215, t219, t220, t233, t234, i0.u1.t98, i1.i1.u4.t90, i2.i1.u10.t83, i2.i1.u11.t146, i...377
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local SCC at level 2
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using 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 a local SCC at level 2
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,4.65464,162940,1,0,247032,32834,3218,812989,901,334852,214765
FORMULA CO4-PT-15-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 441/441 places, 633/633 transitions.
Graph (trivial) has 478 edges and 441 vertex of which 2 / 441 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 908 edges and 440 vertex of which 434 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 433 transition count 451
Reduce places removed 169 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 171 rules applied. Total rules applied 345 place count 264 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 346 place count 263 transition count 449
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 346 place count 263 transition count 411
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 422 place count 225 transition count 411
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 427 place count 220 transition count 403
Iterating global reduction 3 with 5 rules applied. Total rules applied 432 place count 220 transition count 403
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 437 place count 220 transition count 398
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 439 place count 218 transition count 394
Iterating global reduction 4 with 2 rules applied. Total rules applied 441 place count 218 transition count 394
Performed 33 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 507 place count 185 transition count 359
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 12 rules applied. Total rules applied 519 place count 185 transition count 347
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 8 rules applied. Total rules applied 527 place count 182 transition count 342
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 531 place count 180 transition count 340
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 534 place count 177 transition count 334
Iterating global reduction 7 with 3 rules applied. Total rules applied 537 place count 177 transition count 334
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 545 place count 173 transition count 330
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 7 with 3 rules applied. Total rules applied 548 place count 173 transition count 327
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 551 place count 172 transition count 325
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 553 place count 171 transition count 324
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 554 place count 170 transition count 322
Iterating global reduction 10 with 1 rules applied. Total rules applied 555 place count 170 transition count 322
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 556 place count 169 transition count 320
Iterating global reduction 10 with 1 rules applied. Total rules applied 557 place count 169 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 558 place count 169 transition count 319
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 11 with 2 rules applied. Total rules applied 560 place count 168 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 573 place count 168 transition count 305
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 11 with 7 rules applied. Total rules applied 580 place count 168 transition count 298
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 587 place count 161 transition count 298
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 13 with 2 rules applied. Total rules applied 589 place count 160 transition count 297
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 591 place count 158 transition count 295
Applied a total of 591 rules in 155 ms. Remains 158 /441 variables (removed 283) and now considering 295/633 (removed 338) transitions.
[2024-06-02 18:20:32] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
// Phase 1: matrix 269 rows 158 cols
[2024-06-02 18:20:32] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:20:32] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 18:20:32] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2024-06-02 18:20:32] [INFO ] Invariant cache hit.
[2024-06-02 18:20:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:20:32] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-06-02 18:20:32] [INFO ] Redundant transitions in 3 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 18:20:32] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2024-06-02 18:20:32] [INFO ] Invariant cache hit.
[2024-06-02 18:20:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 268/426 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 1/427 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 0/427 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 164 constraints, problems are : Problem set: 0 solved, 276 unsolved in 7738 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 268/426 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 276/439 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 1/427 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/427 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 440 constraints, problems are : Problem set: 0 solved, 276 unsolved in 12218 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 20048ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 20051ms
Starting structural reductions in SI_CTL mode, iteration 1 : 158/441 places, 295/633 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20500 ms. Remains : 158/441 places, 295/633 transitions.
[2024-06-02 18:20:52] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:20:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:20:52] [INFO ] Input system was already deterministic with 295 transitions.
[2024-06-02 18:20:52] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:20:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:20:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8503372661806898823.gal : 2 ms
[2024-06-02 18:20:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16901824021974312437.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/CTLFireability8503372661806898823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16901824021974312437.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,6.53184e+07,0.19263,10828,2,1879,5,30354,6,0,917,28345,0


Converting to forward existential form...Done !
original formula: EF(EG(E((p515==1) U ((p300==1)&&(p547==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),E((p515==1) U ((p300==1)&&(p547==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t51, t61, t85, t92, t99, t131, Intersection with reachable at each step enabled. (de...200
(forward)formula 0,1,1.92957,71336,1,0,399,348794,615,210,5665,231616,606
FORMULA CO4-PT-15-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 633/633 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 417 transition count 606
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 417 transition count 606
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 417 transition count 600
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 67 place count 404 transition count 586
Iterating global reduction 1 with 13 rules applied. Total rules applied 80 place count 404 transition count 586
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 404 transition count 584
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 401 transition count 581
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 401 transition count 581
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 401 transition count 579
Applied a total of 90 rules in 33 ms. Remains 401 /441 variables (removed 40) and now considering 579/633 (removed 54) transitions.
// Phase 1: matrix 579 rows 401 cols
[2024-06-02 18:20:54] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:20:54] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 18:20:55] [INFO ] Invariant cache hit.
[2024-06-02 18:20:55] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 578 sub problems to find dead transitions.
[2024-06-02 18:20:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (OVERLAPS) 579/980 variables, 401/406 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-06-02 18:21:11] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 19 ms to minimize.
[2024-06-02 18:21:11] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/980 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 408 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (OVERLAPS) 579/980 variables, 401/408 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/980 variables, 578/986 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/980 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 986 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 2/2 constraints]
After SMT, in 60239ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Starting structural reductions in LTL mode, iteration 1 : 401/441 places, 579/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60597 ms. Remains : 401/441 places, 579/633 transitions.
[2024-06-02 18:21:55] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:21:55] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:21:55] [INFO ] Input system was already deterministic with 579 transitions.
[2024-06-02 18:21:55] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:21:55] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:21:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13464809285913940932.gal : 3 ms
[2024-06-02 18:21:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4221060930140126994.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/CTLFireability13464809285913940932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4221060930140126994.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17417e+11,4.08148,118216,2,15315,5,380872,6,0,2176,526057,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 18:22:25] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:22:25] [INFO ] Applying decomposition
[2024-06-02 18:22:25] [INFO ] Flatten gal took : 15 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/graph1819029823977502500.txt' '-o' '/tmp/graph1819029823977502500.bin' '-w' '/tmp/graph1819029823977502500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1819029823977502500.bin' '-l' '-1' '-v' '-w' '/tmp/graph1819029823977502500.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:22:25] [INFO ] Decomposing Gal with order
[2024-06-02 18:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:22:25] [INFO ] Removed a total of 386 redundant transitions.
[2024-06-02 18:22:25] [INFO ] Flatten gal took : 31 ms
[2024-06-02 18:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 8 ms.
[2024-06-02 18:22:25] [INFO ] Time to serialize gal into /tmp/CTLFireability5203864935154485982.gal : 5 ms
[2024-06-02 18:22:25] [INFO ] Time to serialize properties into /tmp/CTLFireability4377056004524885414.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/CTLFireability5203864935154485982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4377056004524885414.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17417e+11,1.20907,52232,1917,62,81622,849,1008,347481,74,4683,0


Converting to forward existential form...Done !
original formula: AX(AF(EX(EG((i10.u93.p522==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX(EG((i10.u93.p522==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t74, t132, t142, t200, t217, t240, t252, t264, t279, t307, t389, t415, t435, t469, t...911
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 633/633 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 419 transition count 608
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 419 transition count 608
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 419 transition count 602
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 61 place count 408 transition count 590
Iterating global reduction 1 with 11 rules applied. Total rules applied 72 place count 408 transition count 590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 408 transition count 589
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 405 transition count 586
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 405 transition count 586
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 405 transition count 584
Applied a total of 81 rules in 25 ms. Remains 405 /441 variables (removed 36) and now considering 584/633 (removed 49) transitions.
// Phase 1: matrix 584 rows 405 cols
[2024-06-02 18:22:55] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 18:22:56] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:22:56] [INFO ] Invariant cache hit.
[2024-06-02 18:22:56] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 583 sub problems to find dead transitions.
[2024-06-02 18:22:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/405 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-06-02 18:23:06] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (OVERLAPS) 584/989 variables, 405/411 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-06-02 18:23:13] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-06-02 18:23:14] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 989/989 variables, and 413 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 405/405 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/405 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (OVERLAPS) 584/989 variables, 405/413 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 583/996 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 989/989 variables, and 996 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 405/405 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 3/3 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Starting structural reductions in LTL mode, iteration 1 : 405/441 places, 584/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60708 ms. Remains : 405/441 places, 584/633 transitions.
[2024-06-02 18:23:56] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:23:56] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:23:56] [INFO ] Input system was already deterministic with 584 transitions.
[2024-06-02 18:23:56] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:23:56] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:23:56] [INFO ] Time to serialize gal into /tmp/CTLFireability2984732054978196379.gal : 3 ms
[2024-06-02 18:23:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13290764608881567820.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/CTLFireability2984732054978196379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13290764608881567820.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35988e+11,4.40106,112772,2,14028,5,338965,6,0,2196,512913,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 18:24:26] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:24:26] [INFO ] Applying decomposition
[2024-06-02 18:24:26] [INFO ] Flatten gal took : 13 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/graph8499667109437338568.txt' '-o' '/tmp/graph8499667109437338568.bin' '-w' '/tmp/graph8499667109437338568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8499667109437338568.bin' '-l' '-1' '-v' '-w' '/tmp/graph8499667109437338568.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:24:26] [INFO ] Decomposing Gal with order
[2024-06-02 18:24:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:24:26] [INFO ] Removed a total of 382 redundant transitions.
[2024-06-02 18:24:26] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:24:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2024-06-02 18:24:26] [INFO ] Time to serialize gal into /tmp/CTLFireability8717615776458789355.gal : 5 ms
[2024-06-02 18:24:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3430996618375669441.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/CTLFireability8717615776458789355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3430996618375669441.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35988e+11,0.333779,17056,936,58,22347,670,959,63512,79,2631,0


Converting to forward existential form...Done !
original formula: EG(((AX(!(A((i16.u134.p747==1) U (i6.u52.p326==1)))) + AF((i7.i1.i4.u115.p613==0))) + (!(A((i5.u36.p252==1) U (i6.u50.p319==1))) + AG((i7...179
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!(!(!((E(!((i6.u52.p326==1)) U (!((i16.u134.p747==1)) * !((i6.u52.p326==1)))) + EG(!((i6.u52.p...368
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t75, t133, t143, t159, t182, t212, t240, t279, t311, t419, t422, t439, t473, t5...905
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 633/633 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 417 transition count 607
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 417 transition count 607
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 417 transition count 601
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 66 place count 405 transition count 588
Iterating global reduction 1 with 12 rules applied. Total rules applied 78 place count 405 transition count 588
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 80 place count 405 transition count 586
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 403 transition count 584
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 403 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 403 transition count 583
Applied a total of 85 rules in 31 ms. Remains 403 /441 variables (removed 38) and now considering 583/633 (removed 50) transitions.
// Phase 1: matrix 583 rows 403 cols
[2024-06-02 18:24:57] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:24:57] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 18:24:57] [INFO ] Invariant cache hit.
[2024-06-02 18:24:57] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 582 sub problems to find dead transitions.
[2024-06-02 18:24:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-06-02 18:25:07] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 583/986 variables, 403/409 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-06-02 18:25:15] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 4 ms to minimize.
[2024-06-02 18:25:15] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/986 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 411 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 583/986 variables, 403/411 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/986 variables, 582/993 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/986 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 993 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 3/3 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Starting structural reductions in LTL mode, iteration 1 : 403/441 places, 583/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60587 ms. Remains : 403/441 places, 583/633 transitions.
[2024-06-02 18:25:57] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:25:57] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:25:57] [INFO ] Input system was already deterministic with 583 transitions.
[2024-06-02 18:25:57] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:25:57] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:25:57] [INFO ] Time to serialize gal into /tmp/CTLFireability3895704442848050351.gal : 8 ms
[2024-06-02 18:25:57] [INFO ] Time to serialize properties into /tmp/CTLFireability16539652870886026541.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/CTLFireability3895704442848050351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16539652870886026541.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.31122e+11,4.34228,124696,2,15673,5,395438,6,0,2188,558143,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 18:26:27] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:26:27] [INFO ] Applying decomposition
[2024-06-02 18:26:27] [INFO ] Flatten gal took : 12 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/graph5458321331677197784.txt' '-o' '/tmp/graph5458321331677197784.bin' '-w' '/tmp/graph5458321331677197784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5458321331677197784.bin' '-l' '-1' '-v' '-w' '/tmp/graph5458321331677197784.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:26:27] [INFO ] Decomposing Gal with order
[2024-06-02 18:26:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:26:27] [INFO ] Removed a total of 377 redundant transitions.
[2024-06-02 18:26:27] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:26:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 6 ms.
[2024-06-02 18:26:27] [INFO ] Time to serialize gal into /tmp/CTLFireability2097525007579342023.gal : 4 ms
[2024-06-02 18:26:27] [INFO ] Time to serialize properties into /tmp/CTLFireability658880031912617674.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/CTLFireability2097525007579342023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability658880031912617674.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.31122e+11,0.406484,18500,1120,84,26913,1292,1038,61269,124,3865,0


Converting to forward existential form...Done !
original formula: EX(EG((EF((i14.u129.p685==0)) + AG((i10.u107.p592==0)))))
=> equivalent forward existential formula: [FwdG(EY(Init),(E(TRUE U (i14.u129.p685==0)) + !(E(TRUE U !((i10.u107.p592==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t16, t46, t79, t137, t147, t186, t216, t234, t244, t283, t311, t419, t473, t527, t557, i2...961
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,9.47475,262964,1,0,332906,2816,8078,1.78054e+06,731,10115,620699
FORMULA CO4-PT-15-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 633/633 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 419 transition count 608
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 419 transition count 608
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 419 transition count 602
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 62 place count 407 transition count 589
Iterating global reduction 1 with 12 rules applied. Total rules applied 74 place count 407 transition count 589
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 407 transition count 587
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 404 transition count 584
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 404 transition count 584
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 404 transition count 582
Applied a total of 84 rules in 20 ms. Remains 404 /441 variables (removed 37) and now considering 582/633 (removed 51) transitions.
// Phase 1: matrix 582 rows 404 cols
[2024-06-02 18:26:37] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 18:26:37] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 18:26:37] [INFO ] Invariant cache hit.
[2024-06-02 18:26:37] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 581 sub problems to find dead transitions.
[2024-06-02 18:26:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 582/986 variables, 404/409 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-02 18:26:54] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 3 ms to minimize.
[2024-06-02 18:26:54] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/986 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 411 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-02 18:27:14] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 5 (OVERLAPS) 582/986 variables, 404/412 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/986 variables, 581/993 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-02 18:27:29] [INFO ] Deduced a trap composed of 156 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 1/994 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 994 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 4/4 constraints]
After SMT, in 60244ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60251ms
Starting structural reductions in LTL mode, iteration 1 : 404/441 places, 582/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60599 ms. Remains : 404/441 places, 582/633 transitions.
[2024-06-02 18:27:38] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:27:38] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:27:38] [INFO ] Input system was already deterministic with 582 transitions.
[2024-06-02 18:27:38] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:27:38] [INFO ] Flatten gal took : 39 ms
[2024-06-02 18:27:38] [INFO ] Time to serialize gal into /tmp/CTLFireability630076544722175865.gal : 3 ms
[2024-06-02 18:27:38] [INFO ] Time to serialize properties into /tmp/CTLFireability223855623009897687.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/CTLFireability630076544722175865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability223855623009897687.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20531e+11,4.23581,121036,2,15350,5,384561,6,0,2191,541196,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 18:28:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:28:08] [INFO ] Applying decomposition
[2024-06-02 18:28:08] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3106088792655509181.txt' '-o' '/tmp/graph3106088792655509181.bin' '-w' '/tmp/graph3106088792655509181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3106088792655509181.bin' '-l' '-1' '-v' '-w' '/tmp/graph3106088792655509181.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:28:08] [INFO ] Decomposing Gal with order
[2024-06-02 18:28:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:28:08] [INFO ] Removed a total of 399 redundant transitions.
[2024-06-02 18:28:08] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:28:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 8 ms.
[2024-06-02 18:28:08] [INFO ] Time to serialize gal into /tmp/CTLFireability2293852397920475596.gal : 5 ms
[2024-06-02 18:28:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8878900286078542280.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/CTLFireability2293852397920475596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8878900286078542280.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20531e+11,3.83892,148288,2949,73,267067,1260,1094,1.03084e+06,78,7942,0


Converting to forward existential form...Done !
original formula: A(EF((!(((i3.i0.i1.u31.p208!=1) * EG((i7.i1.i3.u82.p433==1)))) + (((i13.u119.p583==1)&&(i15.u138.p670==1))&&(i15.u151.p821==1)))) U (!(AG...390
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(E(TRUE U !((!(EG(!((((i7.i0.i0.u68.p380==1)&&(i15.u138.p670==1))&&(i15.u146.p750==1))))) +...1005
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t12, t74, t132, t142, t181, t194, t211, t237, t278, t306, t389, t415, t437, t471, t52...950
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 633/633 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 420 transition count 609
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 420 transition count 609
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 420 transition count 603
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 59 place count 409 transition count 591
Iterating global reduction 1 with 11 rules applied. Total rules applied 70 place count 409 transition count 591
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 72 place count 409 transition count 589
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 406 transition count 586
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 406 transition count 586
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 406 transition count 584
Applied a total of 80 rules in 19 ms. Remains 406 /441 variables (removed 35) and now considering 584/633 (removed 49) transitions.
// Phase 1: matrix 584 rows 406 cols
[2024-06-02 18:28:38] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:28:38] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-06-02 18:28:38] [INFO ] Invariant cache hit.
[2024-06-02 18:28:39] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 583 sub problems to find dead transitions.
[2024-06-02 18:28:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 584/990 variables, 406/411 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-06-02 18:28:56] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 2 ms to minimize.
[2024-06-02 18:28:56] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-02 18:28:57] [INFO ] Deduced a trap composed of 155 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/990 variables, 3/414 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 990/990 variables, and 414 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 406/406 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-06-02 18:29:16] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 5 (OVERLAPS) 584/990 variables, 406/415 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/990 variables, 583/998 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/990 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 990/990 variables, and 998 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 406/406 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 4/4 constraints]
After SMT, in 60193ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Starting structural reductions in LTL mode, iteration 1 : 406/441 places, 584/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60731 ms. Remains : 406/441 places, 584/633 transitions.
[2024-06-02 18:29:39] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:29:39] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:29:39] [INFO ] Input system was already deterministic with 584 transitions.
[2024-06-02 18:29:39] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:29:39] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:29:39] [INFO ] Time to serialize gal into /tmp/CTLFireability6491809446210511936.gal : 2 ms
[2024-06-02 18:29:39] [INFO ] Time to serialize properties into /tmp/CTLFireability9963765324779309773.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/CTLFireability6491809446210511936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9963765324779309773.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29141e+11,3.98304,118672,2,15606,5,386334,6,0,2201,521329,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 18:30:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:30:09] [INFO ] Applying decomposition
[2024-06-02 18:30:09] [INFO ] Flatten gal took : 10 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/graph8470448707085884828.txt' '-o' '/tmp/graph8470448707085884828.bin' '-w' '/tmp/graph8470448707085884828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8470448707085884828.bin' '-l' '-1' '-v' '-w' '/tmp/graph8470448707085884828.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:30:09] [INFO ] Decomposing Gal with order
[2024-06-02 18:30:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:30:09] [INFO ] Removed a total of 383 redundant transitions.
[2024-06-02 18:30:09] [INFO ] Flatten gal took : 22 ms
[2024-06-02 18:30:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 6 ms.
[2024-06-02 18:30:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11429486647161731080.gal : 4 ms
[2024-06-02 18:30:09] [INFO ] Time to serialize properties into /tmp/CTLFireability3615215778941088464.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/CTLFireability11429486647161731080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3615215778941088464.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29141e+11,0.293435,16120,1028,70,23609,919,1088,51651,79,3389,0


Converting to forward existential form...Done !
original formula: (AG((EX(EX((i13.u141.p771==1))) * !(A((i12.i0.i0.u117.p624==1) U !(((i6.i0.i1.u76.p461==1)||(i5.u58.p392==1))))))) + E((i13.u134.p750!=1)...184
=> equivalent forward existential formula: ([(FwdU((Init * !(E((i13.u134.p750!=1) U (i12.i0.i2.u116.p618==1)))),TRUE) * !(EX(EX((i13.u141.p771==1)))))] = F...446
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t48, t76, t99, t135, t145, t184, t215, t233, t268, t283, t311, t419, t473, t527...920
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,15.2888,476008,1,0,686311,1281,7195,3.10568e+06,388,5900,720656
FORMULA CO4-PT-15-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 633/633 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 416 transition count 605
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 416 transition count 605
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 416 transition count 599
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 69 place count 403 transition count 585
Iterating global reduction 1 with 13 rules applied. Total rules applied 82 place count 403 transition count 585
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 84 place count 403 transition count 583
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 400 transition count 580
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 400 transition count 580
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 400 transition count 578
Applied a total of 92 rules in 19 ms. Remains 400 /441 variables (removed 41) and now considering 578/633 (removed 55) transitions.
// Phase 1: matrix 578 rows 400 cols
[2024-06-02 18:30:24] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 18:30:25] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 18:30:25] [INFO ] Invariant cache hit.
[2024-06-02 18:30:25] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 577 sub problems to find dead transitions.
[2024-06-02 18:30:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (OVERLAPS) 1/400 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-06-02 18:30:35] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (OVERLAPS) 578/978 variables, 400/406 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-06-02 18:30:42] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-06-02 18:30:42] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/978 variables, and 408 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (OVERLAPS) 1/400 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (OVERLAPS) 578/978 variables, 400/408 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 577/985 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 985 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 3/3 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Starting structural reductions in LTL mode, iteration 1 : 400/441 places, 578/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60553 ms. Remains : 400/441 places, 578/633 transitions.
[2024-06-02 18:31:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:31:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:31:25] [INFO ] Input system was already deterministic with 578 transitions.
[2024-06-02 18:31:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:31:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:31:25] [INFO ] Time to serialize gal into /tmp/CTLFireability18350998420204662066.gal : 2 ms
[2024-06-02 18:31:25] [INFO ] Time to serialize properties into /tmp/CTLFireability10527583746327290855.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/CTLFireability18350998420204662066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10527583746327290855.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16769e+11,4.18431,120584,2,15342,5,385528,6,0,2171,543782,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 18:31:55] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:31:55] [INFO ] Applying decomposition
[2024-06-02 18:31:55] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15211514817986493044.txt' '-o' '/tmp/graph15211514817986493044.bin' '-w' '/tmp/graph15211514817986493044.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15211514817986493044.bin' '-l' '-1' '-v' '-w' '/tmp/graph15211514817986493044.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:31:55] [INFO ] Decomposing Gal with order
[2024-06-02 18:31:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:31:55] [INFO ] Removed a total of 387 redundant transitions.
[2024-06-02 18:31:55] [INFO ] Flatten gal took : 37 ms
[2024-06-02 18:31:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 9 ms.
[2024-06-02 18:31:55] [INFO ] Time to serialize gal into /tmp/CTLFireability1475830622605427610.gal : 4 ms
[2024-06-02 18:31:55] [INFO ] Time to serialize properties into /tmp/CTLFireability9900720700178419107.ctl : 3 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/CTLFireability1475830622605427610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9900720700178419107.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16769e+11,0.510806,23752,1198,57,38732,793,1046,93439,77,3879,0


Converting to forward existential form...Done !
original formula: EX(E(EF(AG(((i4.u54.p358==1)&&(i15.u146.p830==1)))) U (i3.i1.i2.u47.p288==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),E(TRUE U !(E(TRUE U !(((i4.u54.p358==1)&&(i15.u146.p830==1))))))) * (i3.i1.i2.u47.p288==1))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t9, t16, t46, t74, t132, t142, t194, t237, t278, t306, t434, t468, t522, t552, i0.t431, i1.t3...954
(forward)formula 0,0,1.47257,56224,1,0,95443,793,6952,220759,347,3879,370265
FORMULA CO4-PT-15-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 441/441 places, 633/633 transitions.
Graph (trivial) has 474 edges and 441 vertex of which 2 / 441 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 908 edges and 440 vertex of which 434 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 168 rules applied. Total rules applied 170 place count 433 transition count 455
Reduce places removed 165 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 170 rules applied. Total rules applied 340 place count 268 transition count 450
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 344 place count 264 transition count 450
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 344 place count 264 transition count 410
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 424 place count 224 transition count 410
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 428 place count 220 transition count 404
Iterating global reduction 3 with 4 rules applied. Total rules applied 432 place count 220 transition count 404
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 3 with 6 rules applied. Total rules applied 438 place count 220 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 439 place count 219 transition count 398
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 440 place count 218 transition count 396
Iterating global reduction 5 with 1 rules applied. Total rules applied 441 place count 218 transition count 396
Performed 33 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 507 place count 185 transition count 360
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 10 rules applied. Total rules applied 517 place count 185 transition count 350
Reduce places removed 2 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 6 with 5 rules applied. Total rules applied 522 place count 183 transition count 347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 525 place count 182 transition count 345
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 527 place count 181 transition count 344
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 530 place count 178 transition count 338
Iterating global reduction 9 with 3 rules applied. Total rules applied 533 place count 178 transition count 338
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 535 place count 177 transition count 337
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 9 with 3 rules applied. Total rules applied 538 place count 177 transition count 334
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 541 place count 176 transition count 332
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 543 place count 175 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 545 place count 174 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 12 with 14 rules applied. Total rules applied 559 place count 174 transition count 316
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 12 with 7 rules applied. Total rules applied 566 place count 174 transition count 309
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 573 place count 167 transition count 309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 573 place count 167 transition count 308
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 575 place count 166 transition count 308
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 14 with 2 rules applied. Total rules applied 577 place count 165 transition count 307
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 579 place count 163 transition count 305
Applied a total of 579 rules in 71 ms. Remains 163 /441 variables (removed 278) and now considering 305/633 (removed 328) transitions.
// Phase 1: matrix 305 rows 163 cols
[2024-06-02 18:31:57] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:31:57] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:31:57] [INFO ] Invariant cache hit.
[2024-06-02 18:31:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:31:57] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-06-02 18:31:57] [INFO ] Redundant transitions in 4 ms returned []
Running 285 sub problems to find dead transitions.
[2024-06-02 18:31:57] [INFO ] Invariant cache hit.
[2024-06-02 18:31:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 304/467 variables, 163/168 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 1/468 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 0/468 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 169 constraints, problems are : Problem set: 0 solved, 285 unsolved in 9205 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 163/163 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 304/467 variables, 163/168 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 285/453 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 1/468 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 0/468 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 454 constraints, problems are : Problem set: 0 solved, 285 unsolved in 13011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 163/163 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
After SMT, in 22296ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 22299ms
Starting structural reductions in SI_CTL mode, iteration 1 : 163/441 places, 305/633 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22558 ms. Remains : 163/441 places, 305/633 transitions.
[2024-06-02 18:32:19] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:32:19] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:32:19] [INFO ] Input system was already deterministic with 305 transitions.
[2024-06-02 18:32:19] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:32:19] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:32:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6280049726413120464.gal : 1 ms
[2024-06-02 18:32:19] [INFO ] Time to serialize properties into /tmp/CTLFireability2117058672901031456.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/CTLFireability6280049726413120464.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2117058672901031456.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,8.34624e+07,0.206176,11212,2,1969,5,32526,6,0,947,26928,0


Converting to forward existential form...Done !
original formula: AF((((p247==1)&&(p768==0))&&((p338==0)&&(p442==0))))
=> equivalent forward existential formula: [FwdG(Init,!((((p247==1)&&(p768==0))&&((p338==0)&&(p442==0)))))] = FALSE
Hit Full ! (commute/partial/dont) 277/0/28
(forward)formula 0,0,1.66218,57044,1,0,8,282966,20,4,4896,150665,8
FORMULA CO4-PT-15-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 633/633 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 418 transition count 607
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 418 transition count 607
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 418 transition count 601
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 406 transition count 588
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 406 transition count 588
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 406 transition count 586
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 403 transition count 583
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 403 transition count 583
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 403 transition count 581
Applied a total of 86 rules in 26 ms. Remains 403 /441 variables (removed 38) and now considering 581/633 (removed 52) transitions.
// Phase 1: matrix 581 rows 403 cols
[2024-06-02 18:32:21] [INFO ] Computed 5 invariants in 10 ms
[2024-06-02 18:32:21] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 18:32:21] [INFO ] Invariant cache hit.
[2024-06-02 18:32:21] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-02 18:32:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 580 unsolved
[2024-06-02 18:32:31] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 581/984 variables, 403/409 constraints. Problems are: Problem set: 0 solved, 580 unsolved
[2024-06-02 18:32:39] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2024-06-02 18:32:39] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/984 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 984/984 variables, and 411 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 581/984 variables, 403/411 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/984 variables, 580/991 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/984 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/984 variables, and 991 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 3/3 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 403/441 places, 581/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60546 ms. Remains : 403/441 places, 581/633 transitions.
[2024-06-02 18:33:22] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:33:22] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:33:22] [INFO ] Input system was already deterministic with 581 transitions.
[2024-06-02 18:33:22] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:33:22] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:33:22] [INFO ] Time to serialize gal into /tmp/CTLFireability18181933386738528963.gal : 2 ms
[2024-06-02 18:33:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1600398982574938585.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/CTLFireability18181933386738528963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1600398982574938585.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18713e+11,4.77994,114828,2,14681,5,368709,6,0,2186,509850,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 18:33:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:33:52] [INFO ] Applying decomposition
[2024-06-02 18:33:52] [INFO ] Flatten gal took : 10 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/graph3509284002285218846.txt' '-o' '/tmp/graph3509284002285218846.bin' '-w' '/tmp/graph3509284002285218846.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3509284002285218846.bin' '-l' '-1' '-v' '-w' '/tmp/graph3509284002285218846.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:33:52] [INFO ] Decomposing Gal with order
[2024-06-02 18:33:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:33:52] [INFO ] Removed a total of 373 redundant transitions.
[2024-06-02 18:33:52] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:33:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2024-06-02 18:33:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7702225332323928428.gal : 4 ms
[2024-06-02 18:33:52] [INFO ] Time to serialize properties into /tmp/CTLFireability7863985390787527798.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/CTLFireability7702225332323928428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7863985390787527798.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18713e+11,0.303341,16220,1015,59,23593,699,968,52919,84,2630,0


Converting to forward existential form...Done !
original formula: A(EF(((!(((i14.u119.p451!=1) + EX((i17.u123.p704==1)))) * !(AG((i7.u75.p474==1)))) * AG(EX((i5.u100.p581==1))))) U (((i6.i1.i0.u114.p645=...201
=> equivalent forward existential formula: [((Init * !(EG(!((((i6.i1.i0.u114.p645==1)&&(i17.u122.p670==1))&&(i17.u138.p821==1)))))) * !(E(!((((i6.i1.i0.u11...442
Reverse transition relation is NOT exact ! Due to transitions t9, t16, t46, t74, t142, t181, t189, t212, t226, t230, t240, t279, t307, t366, t435, t469, t5...900
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 633/633 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 417 transition count 606
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 417 transition count 606
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 417 transition count 601
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 66 place count 404 transition count 587
Iterating global reduction 1 with 13 rules applied. Total rules applied 79 place count 404 transition count 587
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 404 transition count 585
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 401 transition count 582
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 401 transition count 582
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 401 transition count 580
Applied a total of 89 rules in 22 ms. Remains 401 /441 variables (removed 40) and now considering 580/633 (removed 53) transitions.
// Phase 1: matrix 580 rows 401 cols
[2024-06-02 18:34:22] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 18:34:22] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 18:34:22] [INFO ] Invariant cache hit.
[2024-06-02 18:34:22] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 579 sub problems to find dead transitions.
[2024-06-02 18:34:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 18:34:32] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/981 variables, 401/407 constraints. Problems are: Problem set: 0 solved, 579 unsolved
[2024-06-02 18:34:40] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-06-02 18:34:40] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/981 variables, and 409 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/981 variables, 401/409 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 579/988 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/981 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 988 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 3/3 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 579 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Starting structural reductions in LTL mode, iteration 1 : 401/441 places, 580/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60590 ms. Remains : 401/441 places, 580/633 transitions.
[2024-06-02 18:35:22] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:35:22] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:35:23] [INFO ] Input system was already deterministic with 580 transitions.
[2024-06-02 18:35:23] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:35:23] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:35:23] [INFO ] Time to serialize gal into /tmp/CTLFireability8988445637976900546.gal : 2 ms
[2024-06-02 18:35:23] [INFO ] Time to serialize properties into /tmp/CTLFireability16810259598767187338.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/CTLFireability8988445637976900546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16810259598767187338.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17709e+11,4.41177,120984,2,15587,5,388985,6,0,2176,546673,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 18:35:53] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:35:53] [INFO ] Applying decomposition
[2024-06-02 18:35:53] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1111645703539195649.txt' '-o' '/tmp/graph1111645703539195649.bin' '-w' '/tmp/graph1111645703539195649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1111645703539195649.bin' '-l' '-1' '-v' '-w' '/tmp/graph1111645703539195649.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:35:53] [INFO ] Decomposing Gal with order
[2024-06-02 18:35:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:35:53] [INFO ] Removed a total of 386 redundant transitions.
[2024-06-02 18:35:53] [INFO ] Flatten gal took : 46 ms
[2024-06-02 18:35:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 3 ms.
[2024-06-02 18:35:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9896764200493933985.gal : 3 ms
[2024-06-02 18:35:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10157848331154411284.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/CTLFireability9896764200493933985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10157848331154411284.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17709e+11,0.612016,28728,1010,76,47301,1121,1018,138181,75,5909,0


Converting to forward existential form...Done !
original formula: EF(AG((AX(AF((i4.u24.p177==1))) * AG(((EG((i14.u80.p472==1)) + (i17.u141.p788==1)) + (i4.u25.p190==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EX(!(!(EG(!((i4.u24.p177==1))))))) * !(E(TRUE U !(((EG((i14.u80.p472==1)) + ...212
Reverse transition relation is NOT exact ! Due to transitions t9, t16, t46, t74, t106, t132, t142, t181, t211, t251, t263, t278, t306, t416, t436, t470, i0...913
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,26.8698,769532,1,0,681784,1192,6814,7.64188e+06,384,6608,565772
FORMULA CO4-PT-15-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 441/441 places, 633/633 transitions.
Graph (trivial) has 476 edges and 441 vertex of which 2 / 441 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 908 edges and 440 vertex of which 434 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 168 rules applied. Total rules applied 170 place count 433 transition count 455
Reduce places removed 165 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 169 rules applied. Total rules applied 339 place count 268 transition count 451
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 342 place count 265 transition count 451
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 342 place count 265 transition count 411
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 422 place count 225 transition count 411
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 430 place count 217 transition count 400
Iterating global reduction 3 with 8 rules applied. Total rules applied 438 place count 217 transition count 400
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 3 with 7 rules applied. Total rules applied 445 place count 217 transition count 393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 446 place count 216 transition count 393
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 448 place count 214 transition count 389
Iterating global reduction 5 with 2 rules applied. Total rules applied 450 place count 214 transition count 389
Performed 31 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 512 place count 183 transition count 357
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 10 rules applied. Total rules applied 522 place count 183 transition count 347
Reduce places removed 2 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 6 with 5 rules applied. Total rules applied 527 place count 181 transition count 344
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 529 place count 180 transition count 343
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 532 place count 177 transition count 337
Iterating global reduction 8 with 3 rules applied. Total rules applied 535 place count 177 transition count 337
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 543 place count 173 transition count 333
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 8 with 6 rules applied. Total rules applied 549 place count 173 transition count 327
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 6 rules applied. Total rules applied 555 place count 171 transition count 323
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 559 place count 169 transition count 321
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 560 place count 168 transition count 319
Iterating global reduction 11 with 1 rules applied. Total rules applied 561 place count 168 transition count 319
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 562 place count 167 transition count 317
Iterating global reduction 11 with 1 rules applied. Total rules applied 563 place count 167 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 564 place count 167 transition count 316
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 568 place count 165 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 12 with 13 rules applied. Total rules applied 581 place count 165 transition count 301
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 12 with 7 rules applied. Total rules applied 588 place count 165 transition count 294
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 595 place count 158 transition count 294
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 14 with 2 rules applied. Total rules applied 597 place count 157 transition count 293
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 599 place count 155 transition count 291
Applied a total of 599 rules in 80 ms. Remains 155 /441 variables (removed 286) and now considering 291/633 (removed 342) transitions.
[2024-06-02 18:36:20] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
// Phase 1: matrix 265 rows 155 cols
[2024-06-02 18:36:20] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:36:20] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-02 18:36:20] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2024-06-02 18:36:20] [INFO ] Invariant cache hit.
[2024-06-02 18:36:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:36:20] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-06-02 18:36:20] [INFO ] Redundant transitions in 2 ms returned []
Running 274 sub problems to find dead transitions.
[2024-06-02 18:36:20] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2024-06-02 18:36:20] [INFO ] Invariant cache hit.
[2024-06-02 18:36:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 264/418 variables, 154/159 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 1/419 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (OVERLAPS) 1/420 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 0/420 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 161 constraints, problems are : Problem set: 0 solved, 274 unsolved in 8667 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 264/418 variables, 154/159 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 194/353 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 1/419 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 80/434 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 1/420 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 10 (OVERLAPS) 0/420 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 435 constraints, problems are : Problem set: 0 solved, 274 unsolved in 14163 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
After SMT, in 22896ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 22901ms
Starting structural reductions in SI_CTL mode, iteration 1 : 155/441 places, 291/633 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23282 ms. Remains : 155/441 places, 291/633 transitions.
[2024-06-02 18:36:43] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:36:43] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:36:43] [INFO ] Input system was already deterministic with 291 transitions.
[2024-06-02 18:36:43] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:36:43] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:36:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10734316840739603040.gal : 1 ms
[2024-06-02 18:36:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3548061593015726343.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/CTLFireability10734316840739603040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3548061593015726343.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,5.39827e+07,0.125289,8184,2,1486,5,19640,6,0,901,15021,0


Converting to forward existential form...Done !
original formula: EG(((p239==0)||(p371==0)))
=> equivalent forward existential formula: [FwdG(Init,((p239==0)||(p371==0)))] != FALSE
Hit Full ! (commute/partial/dont) 264/0/27
(forward)formula 0,1,0.855516,31560,1,0,8,163571,19,4,4481,61089,8
FORMULA CO4-PT-15-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 18:36:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:36:44] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:36:44] [INFO ] Applying decomposition
[2024-06-02 18:36:44] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16914498357532120635.txt' '-o' '/tmp/graph16914498357532120635.bin' '-w' '/tmp/graph16914498357532120635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16914498357532120635.bin' '-l' '-1' '-v' '-w' '/tmp/graph16914498357532120635.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:36:44] [INFO ] Decomposing Gal with order
[2024-06-02 18:36:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:36:44] [INFO ] Removed a total of 406 redundant transitions.
[2024-06-02 18:36:44] [INFO ] Flatten gal took : 22 ms
[2024-06-02 18:36:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 4 ms.
[2024-06-02 18:36:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5934765000406090937.gal : 4 ms
[2024-06-02 18:36:44] [INFO ] Time to serialize properties into /tmp/CTLFireability260539685494676464.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/CTLFireability5934765000406090937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability260539685494676464.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 -...261
No direction supplied, using forward translation only.
Parsed 4 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.9183e+11,0.427404,22892,1102,76,34360,1167,1211,103116,104,5181,0


Converting to forward existential form...Done !
original formula: AX(AF(EX(EG((i8.i1.i1.u106.p522==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX(EG((i8.i1.i1.u106.p522==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t14, t18, t89, t137, t178, t203, t235, t306, t340, t454, t512, t568, t598, i0.t472, i0.t...1163
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,184.064,2228020,1,0,3.04804e+06,1536,2547,1.41811e+07,197,8099,1011417
FORMULA CO4-PT-15-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(((AX(!(A((i15.u156.p747==1) U (i5.u58.p326==1)))) + AF((i7.u132.p613==0))) + (!(A((i3.i1.i0.u41.p252==1) U (i5.u56.p319==1))) + AG((i6...172
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!(!(!((E(!((i5.u58.p326==1)) U (!((i15.u156.p747==1)) * !((i5.u58.p326==1)))) + EG(!((i5.u58.p...361
(forward)formula 1,1,841.408,3474420,1,0,3.60427e+06,2224,5758,3.13078e+07,351,11064,1598342
FORMULA CO4-PT-15-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(EF((!(((i2.i0.i0.u28.p208!=1) * EG((i6.u79.p433==1)))) + (((i12.u123.p583==1)&&(i15.u148.p670==1))&&(i15.u166.p821==1)))) U (!(AG((AF((...385
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(E(TRUE U !((!(EG(!((((i6.u64.p380==1)&&(i15.u148.p670==1))&&(i15.u156.p750==1))))) + (i3.i...1002
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
[2024-06-02 19:02:32] [INFO ] Applying decomposition
[2024-06-02 19:02:32] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:02:32] [INFO ] Decomposing Gal with order
[2024-06-02 19:02:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:02:32] [INFO ] Removed a total of 236 redundant transitions.
[2024-06-02 19:02:32] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:02:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 3 ms.
[2024-06-02 19:02:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5552712487203064737.gal : 2 ms
[2024-06-02 19:02:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14651158060066502351.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/CTLFireability5552712487203064737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14651158060066502351.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 2 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.9183e+11,0.789859,30616,348,1941,8595,59643,316,30076,1317,206789,0


Converting to forward existential form...Done !
original formula: A(EF((!(((i0.i0.i0.u5.p208!=1) * EG((i0.i1.i1.i0.u11.p433==1)))) + (((i0.i1.i1.i0.u11.p583==1)&&(i0.i1.i1.i1.u14.p670==1))&&(i0.i1.i1.i1....461
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(E(TRUE U !((!(EG(!((((i0.i1.i1.i0.u11.p380==1)&&(i0.i1.i1.i1.u14.p670==1))&&(i0.i1.i1.i1.i...1166
Reverse transition relation is NOT exact ! Due to transitions i0.t486, i0.t18, i0.i0.i0.t340, i0.i0.i0.u5.t378, i0.i0.i0.u5.t401, i0.i0.i0.u5.t411, i0.i0.i...1894
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
ITS-tools command line returned an error code 137
[2024-06-02 19:14:36] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:14:36] [INFO ] Input system was already deterministic with 633 transitions.
[2024-06-02 19:14:36] [INFO ] Transformed 441 places.
[2024-06-02 19:14:36] [INFO ] Transformed 633 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-06-02 19:14:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10446956616828013629.gal : 3 ms
[2024-06-02 19:14:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17531348421154024377.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/CTLFireability10446956616828013629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17531348421154024377.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 2 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.9183e+11,12.4553,253384,2,33344,5,1.03312e+06,6,0,2387,845381,0


Converting to forward existential form...Done !
original formula: A(EF((!(((p208!=1) * EG((p433==1)))) + (((p583==1)&&(p670==1))&&(p821==1)))) U (!(AG((AF((((p380==1)&&(p670==1))&&(p750==1))) + (p235!=1)...248
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(E(TRUE U !((!(EG(!((((p380==1)&&(p670==1))&&(p750==1))))) + (p235!=1)))))) * EG(((((EX((p1...685
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t11, t14, t18, t19, t29, t34, t35, t37, t40, t44, t45, t49, t50, t56,...664

BK_TIME_CONFINEMENT_REACHED

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

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