About the Execution of ITS-Tools for CO4-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16189.048 | 3600000.00 | 3801700.00 | 9468.90 | ?T?F?TF????F??F? | normal |
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-171734898700154.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-20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898700154
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K 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 336K 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-20-CTLFireability-2024-00
FORMULA_NAME CO4-PT-20-CTLFireability-2024-01
FORMULA_NAME CO4-PT-20-CTLFireability-2024-02
FORMULA_NAME CO4-PT-20-CTLFireability-2024-03
FORMULA_NAME CO4-PT-20-CTLFireability-2024-04
FORMULA_NAME CO4-PT-20-CTLFireability-2024-05
FORMULA_NAME CO4-PT-20-CTLFireability-2024-06
FORMULA_NAME CO4-PT-20-CTLFireability-2024-07
FORMULA_NAME CO4-PT-20-CTLFireability-2024-08
FORMULA_NAME CO4-PT-20-CTLFireability-2024-09
FORMULA_NAME CO4-PT-20-CTLFireability-2024-10
FORMULA_NAME CO4-PT-20-CTLFireability-2024-11
FORMULA_NAME CO4-PT-20-CTLFireability-2024-12
FORMULA_NAME CO4-PT-20-CTLFireability-2024-13
FORMULA_NAME CO4-PT-20-CTLFireability-2024-14
FORMULA_NAME CO4-PT-20-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717355974242
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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 19:19:35] [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 19:19:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:19:35] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-06-02 19:19:35] [INFO ] Transformed 1178 places.
[2024-06-02 19:19:35] [INFO ] Transformed 1463 transitions.
[2024-06-02 19:19:35] [INFO ] Found NUPN structural information;
[2024-06-02 19:19:35] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 187 places in 15 ms
Reduce places removed 187 places and 251 transitions.
Support contains 77 out of 991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 969 transition count 1207
Discarding 156 places :
Symmetric choice reduction at 1 with 156 rule applications. Total rules 183 place count 813 transition count 1049
Iterating global reduction 1 with 156 rules applied. Total rules applied 339 place count 813 transition count 1049
Discarding 120 places :
Symmetric choice reduction at 1 with 120 rule applications. Total rules 459 place count 693 transition count 917
Iterating global reduction 1 with 120 rules applied. Total rules applied 579 place count 693 transition count 917
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 585 place count 693 transition count 911
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 640 place count 638 transition count 852
Iterating global reduction 2 with 55 rules applied. Total rules applied 695 place count 638 transition count 852
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 697 place count 638 transition count 850
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 729 place count 606 transition count 818
Iterating global reduction 3 with 32 rules applied. Total rules applied 761 place count 606 transition count 818
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 765 place count 606 transition count 814
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 776 place count 595 transition count 803
Iterating global reduction 4 with 11 rules applied. Total rules applied 787 place count 595 transition count 803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 788 place count 595 transition count 802
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 789 place count 594 transition count 801
Iterating global reduction 5 with 1 rules applied. Total rules applied 790 place count 594 transition count 801
Applied a total of 790 rules in 261 ms. Remains 594 /991 variables (removed 397) and now considering 801/1212 (removed 411) transitions.
// Phase 1: matrix 801 rows 594 cols
[2024-06-02 19:19:36] [INFO ] Computed 7 invariants in 26 ms
[2024-06-02 19:19:36] [INFO ] Implicit Places using invariants in 343 ms returned [6, 507]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 375 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 592/991 places, 801/1212 transitions.
Applied a total of 0 rules in 16 ms. Remains 592 /592 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 667 ms. Remains : 592/991 places, 801/1212 transitions.
Support contains 77 out of 592 places after structural reductions.
[2024-06-02 19:19:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 19:19:36] [INFO ] Flatten gal took : 83 ms
[2024-06-02 19:19:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-20-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:19:36] [INFO ] Flatten gal took : 45 ms
[2024-06-02 19:19:36] [INFO ] Input system was already deterministic with 801 transitions.
Support contains 63 out of 592 places (down from 77) after GAL structural reductions.
RANDOM walk for 40000 steps (592 resets) in 2121 ms. (18 steps per ms) remains 36/45 properties
BEST_FIRST walk for 4003 steps (11 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (13 resets) in 63 ms. (62 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 36 ms. (108 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 46 ms. (85 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 51 ms. (77 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (9 resets) in 46 ms. (85 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 46 ms. (85 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (13 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 34 ms. (114 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (13 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (13 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (13 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
// Phase 1: matrix 801 rows 592 cols
[2024-06-02 19:19:37] [INFO ] Computed 5 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 32/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 12/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 287/381 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 468/849 variables, 196/295 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/849 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 378/1227 variables, 197/492 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1227 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 128/1355 variables, 79/571 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1355 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 34/1389 variables, 23/594 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1389 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 4/1393 variables, 3/597 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1393 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (OVERLAPS) 0/1393 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1393/1393 variables, and 597 constraints, problems are : Problem set: 0 solved, 35 unsolved in 4273 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 32/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 12/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 287/381 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 468/849 variables, 196/297 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 33/330 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/849 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 378/1227 variables, 197/527 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1227 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 128/1355 variables, 79/606 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1355 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 34/1389 variables, 23/629 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1389 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (OVERLAPS) 4/1393 variables, 3/632 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1393/1393 variables, and 632 constraints, problems are : Problem set: 0 solved, 35 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 9371ms problems are : Problem set: 0 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 801/801 transitions.
Graph (trivial) has 530 edges and 592 vertex of which 3 / 592 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1131 edges and 590 vertex of which 582 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 226 rules applied. Total rules applied 228 place count 582 transition count 561
Reduce places removed 217 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 230 rules applied. Total rules applied 458 place count 365 transition count 548
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 470 place count 353 transition count 548
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 470 place count 353 transition count 505
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 556 place count 310 transition count 505
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 562 place count 304 transition count 499
Iterating global reduction 3 with 6 rules applied. Total rules applied 568 place count 304 transition count 499
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 570 place count 304 transition count 497
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 570 place count 304 transition count 496
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 572 place count 303 transition count 496
Performed 79 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 730 place count 224 transition count 401
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 745 place count 224 transition count 386
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 752 place count 217 transition count 376
Iterating global reduction 5 with 7 rules applied. Total rules applied 759 place count 217 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 760 place count 217 transition count 375
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 6 with 4 rules applied. Total rules applied 764 place count 215 transition count 373
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 765 place count 214 transition count 371
Iterating global reduction 6 with 1 rules applied. Total rules applied 766 place count 214 transition count 371
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 836 place count 179 transition count 411
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 848 place count 179 transition count 399
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 862 place count 165 transition count 343
Iterating global reduction 7 with 14 rules applied. Total rules applied 876 place count 165 transition count 343
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 881 place count 165 transition count 338
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 882 place count 164 transition count 332
Iterating global reduction 8 with 1 rules applied. Total rules applied 883 place count 164 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 895 place count 164 transition count 320
Free-agglomeration rule applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 912 place count 164 transition count 303
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 929 place count 147 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 932 place count 147 transition count 300
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 940 place count 147 transition count 300
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 941 place count 147 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 942 place count 146 transition count 299
Applied a total of 942 rules in 205 ms. Remains 146 /592 variables (removed 446) and now considering 299/801 (removed 502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 146/592 places, 299/801 transitions.
RANDOM walk for 40000 steps (1198 resets) in 785 ms. (50 steps per ms) remains 4/35 properties
BEST_FIRST walk for 40004 steps (181 resets) in 31 ms. (1250 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (117 resets) in 52 ms. (754 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (196 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-06-02 19:19:47] [INFO ] Flow matrix only has 275 transitions (discarded 24 similar events)
// Phase 1: matrix 275 rows 146 cols
[2024-06-02 19:19:47] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 19:19:47] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/115 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 239/354 variables, 115/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 55/409 variables, 22/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/421 variables, 9/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/421 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 146/146 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/115 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 239/354 variables, 115/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/409 variables, 22/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/421 variables, 9/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/421 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 157 constraints, problems are : Problem set: 0 solved, 1 unsolved in 123 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 146/146 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 288ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 6 ms.
[2024-06-02 19:19:48] [INFO ] Flatten gal took : 32 ms
[2024-06-02 19:19:48] [INFO ] Flatten gal took : 31 ms
[2024-06-02 19:19:48] [INFO ] Input system was already deterministic with 801 transitions.
Computed a total of 28 stabilizing places and 43 stable transitions
Graph (complete) has 1134 edges and 592 vertex of which 584 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 552 transition count 759
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 552 transition count 759
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 82 place count 552 transition count 757
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 110 place count 524 transition count 728
Iterating global reduction 1 with 28 rules applied. Total rules applied 138 place count 524 transition count 728
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 140 place count 524 transition count 726
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 158 place count 506 transition count 708
Iterating global reduction 2 with 18 rules applied. Total rules applied 176 place count 506 transition count 708
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 180 place count 506 transition count 704
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 188 place count 498 transition count 696
Iterating global reduction 3 with 8 rules applied. Total rules applied 196 place count 498 transition count 696
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 197 place count 498 transition count 695
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 201 place count 494 transition count 691
Iterating global reduction 4 with 4 rules applied. Total rules applied 205 place count 494 transition count 691
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 206 place count 494 transition count 690
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 207 place count 493 transition count 689
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 493 transition count 689
Applied a total of 208 rules in 70 ms. Remains 493 /592 variables (removed 99) and now considering 689/801 (removed 112) transitions.
// Phase 1: matrix 689 rows 493 cols
[2024-06-02 19:19:48] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 19:19:48] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-02 19:19:48] [INFO ] Invariant cache hit.
[2024-06-02 19:19:48] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 688 sub problems to find dead transitions.
[2024-06-02 19:19:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
[2024-06-02 19:20:02] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 9 ms to minimize.
[2024-06-02 19:20:03] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 4 (OVERLAPS) 689/1182 variables, 493/500 constraints. Problems are: Problem set: 0 solved, 688 unsolved
[2024-06-02 19:20:14] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 3 ms to minimize.
[2024-06-02 19:20:14] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 3 ms to minimize.
[2024-06-02 19:20:15] [INFO ] Deduced a trap composed of 187 places in 109 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1182/1182 variables, and 503 constraints, problems are : Problem set: 0 solved, 688 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 4 (OVERLAPS) 689/1182 variables, 493/503 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1182 variables, 688/1191 constraints. Problems are: Problem set: 0 solved, 688 unsolved
[2024-06-02 19:20:34] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1182/1182 variables, and 1192 constraints, problems are : Problem set: 0 solved, 688 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 6/6 constraints]
After SMT, in 60348ms problems are : Problem set: 0 solved, 688 unsolved
Search for dead transitions found 0 dead transitions in 60359ms
Starting structural reductions in LTL mode, iteration 1 : 493/592 places, 689/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60879 ms. Remains : 493/592 places, 689/801 transitions.
[2024-06-02 19:20:49] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:20:49] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:20:49] [INFO ] Input system was already deterministic with 689 transitions.
[2024-06-02 19:20:49] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:20:49] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:20:49] [INFO ] Time to serialize gal into /tmp/CTLFireability7365664055794346867.gal : 17 ms
[2024-06-02 19:20:49] [INFO ] Time to serialize properties into /tmp/CTLFireability6348893602521146219.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/CTLFireability7365664055794346867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6348893602521146219.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.2873e+12,15.6826,418508,2,29610,5,1.24554e+06,6,0,2655,2.08006e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:21:19] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:21:19] [INFO ] Applying decomposition
[2024-06-02 19:21:19] [INFO ] Flatten gal took : 19 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/graph3688384677198178065.txt' '-o' '/tmp/graph3688384677198178065.bin' '-w' '/tmp/graph3688384677198178065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3688384677198178065.bin' '-l' '-1' '-v' '-w' '/tmp/graph3688384677198178065.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:21:19] [INFO ] Decomposing Gal with order
[2024-06-02 19:21:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:21:19] [INFO ] Removed a total of 420 redundant transitions.
[2024-06-02 19:21:19] [INFO ] Flatten gal took : 78 ms
[2024-06-02 19:21:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 17 ms.
[2024-06-02 19:21:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17556625846916663784.gal : 23 ms
[2024-06-02 19:21:19] [INFO ] Time to serialize properties into /tmp/CTLFireability13457210975244166955.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/CTLFireability17556625846916663784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13457210975244166955.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 -...264
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.2873e+12,5.41611,188100,2182,175,229242,7943,1187,1.49455e+06,123,85978,0
Converting to forward existential form...Done !
original formula: AX(AF(EX((i16.i0.i0.u149.p880==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX((i16.i0.i0.u149.p880==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t52, t92, t93, t137, t183, t265, t306, t318, t354, t363, t484, t552, t553, t588, t5...1110
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
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 555 transition count 762
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 555 transition count 762
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 555 transition count 761
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 101 place count 529 transition count 734
Iterating global reduction 1 with 26 rules applied. Total rules applied 127 place count 529 transition count 734
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 129 place count 529 transition count 732
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 146 place count 512 transition count 715
Iterating global reduction 2 with 17 rules applied. Total rules applied 163 place count 512 transition count 715
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 166 place count 512 transition count 712
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 174 place count 504 transition count 704
Iterating global reduction 3 with 8 rules applied. Total rules applied 182 place count 504 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 183 place count 504 transition count 703
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 187 place count 500 transition count 699
Iterating global reduction 4 with 4 rules applied. Total rules applied 191 place count 500 transition count 699
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 192 place count 500 transition count 698
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 193 place count 499 transition count 697
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 499 transition count 697
Applied a total of 194 rules in 58 ms. Remains 499 /592 variables (removed 93) and now considering 697/801 (removed 104) transitions.
// Phase 1: matrix 697 rows 499 cols
[2024-06-02 19:21:49] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:21:49] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-02 19:21:49] [INFO ] Invariant cache hit.
[2024-06-02 19:21:50] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2024-06-02 19:21:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (OVERLAPS) 1/499 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 696 unsolved
[2024-06-02 19:22:04] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
[2024-06-02 19:22:04] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 697/1196 variables, 499/506 constraints. Problems are: Problem set: 0 solved, 696 unsolved
[2024-06-02 19:22:16] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 3 ms to minimize.
[2024-06-02 19:22:16] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:22:17] [INFO ] Deduced a trap composed of 187 places in 83 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1196/1196 variables, and 509 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (OVERLAPS) 1/499 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 697/1196 variables, 499/509 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1196 variables, 696/1205 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1196/1196 variables, and 1205 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 5/5 constraints]
After SMT, in 60259ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 60267ms
Starting structural reductions in LTL mode, iteration 1 : 499/592 places, 697/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60811 ms. Remains : 499/592 places, 697/801 transitions.
[2024-06-02 19:22:50] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:22:50] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:22:50] [INFO ] Input system was already deterministic with 697 transitions.
[2024-06-02 19:22:50] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:22:50] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:22:50] [INFO ] Time to serialize gal into /tmp/CTLFireability6509999258622224308.gal : 3 ms
[2024-06-02 19:22:50] [INFO ] Time to serialize properties into /tmp/CTLFireability16816148263135782880.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/CTLFireability6509999258622224308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16816148263135782880.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.4916e+12,16.6159,434196,2,30156,5,1.26708e+06,6,0,2687,2.1578e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:23:20] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:23:20] [INFO ] Applying decomposition
[2024-06-02 19:23:20] [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/graph2334709932940570648.txt' '-o' '/tmp/graph2334709932940570648.bin' '-w' '/tmp/graph2334709932940570648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2334709932940570648.bin' '-l' '-1' '-v' '-w' '/tmp/graph2334709932940570648.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:23:20] [INFO ] Decomposing Gal with order
[2024-06-02 19:23:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:23:20] [INFO ] Removed a total of 424 redundant transitions.
[2024-06-02 19:23:20] [INFO ] Flatten gal took : 32 ms
[2024-06-02 19:23:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 8 ms.
[2024-06-02 19:23:20] [INFO ] Time to serialize gal into /tmp/CTLFireability12913113532537429710.gal : 7 ms
[2024-06-02 19:23:20] [INFO ] Time to serialize properties into /tmp/CTLFireability1091531548111156162.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/CTLFireability12913113532537429710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1091531548111156162.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.4916e+12,1.95155,64936,2223,185,90214,6986,1236,383285,125,60176,0
Converting to forward existential form...Done !
original formula: (AG(!(A(EX(((i1.u19.p210==1)&&(i8.u160.p955==1))) U (AX((i18.u175.p1088==1)) * (i6.u70.p504!=1))))) + EF(!(A((i12.i0.i1.u107.p703==1) U A...181
=> equivalent forward existential formula: [((FwdU((Init * !(E(TRUE U !(!((E(!(!(EG(!((i17.u166.p1013==1))))) U (!((i12.i0.i1.u107.p703==1)) * !(!(EG(!((i1...469
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t52, t61, t89, t98, t99, t143, t189, t235, t273, t362, t371, t449, t461, t560, t561...1156
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
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 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 SI_CTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Graph (trivial) has 622 edges and 592 vertex of which 3 / 592 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1132 edges and 590 vertex of which 582 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 272 place count 581 transition count 519
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 274 rules applied. Total rules applied 546 place count 311 transition count 515
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 548 place count 309 transition count 515
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 548 place count 309 transition count 474
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 630 place count 268 transition count 474
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 645 place count 253 transition count 456
Iterating global reduction 3 with 15 rules applied. Total rules applied 660 place count 253 transition count 456
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 661 place count 253 transition count 455
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 661 place count 253 transition count 450
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 671 place count 248 transition count 450
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 675 place count 244 transition count 444
Iterating global reduction 4 with 4 rules applied. Total rules applied 679 place count 244 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 680 place count 244 transition count 443
Performed 35 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 750 place count 209 transition count 406
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 11 rules applied. Total rules applied 761 place count 209 transition count 395
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 767 place count 205 transition count 393
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 776 place count 196 transition count 380
Iterating global reduction 7 with 9 rules applied. Total rules applied 785 place count 196 transition count 380
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 788 place count 196 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 789 place count 195 transition count 377
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 791 place count 194 transition count 376
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 792 place count 193 transition count 374
Iterating global reduction 9 with 1 rules applied. Total rules applied 793 place count 193 transition count 374
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 794 place count 192 transition count 372
Iterating global reduction 9 with 1 rules applied. Total rules applied 795 place count 192 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 796 place count 192 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 822 place count 192 transition count 345
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 10 with 16 rules applied. Total rules applied 838 place count 192 transition count 329
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 854 place count 176 transition count 329
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 854 place count 176 transition count 326
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 860 place count 173 transition count 326
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 862 place count 172 transition count 325
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 864 place count 170 transition count 323
Applied a total of 864 rules in 95 ms. Remains 170 /592 variables (removed 422) and now considering 323/801 (removed 478) transitions.
// Phase 1: matrix 323 rows 170 cols
[2024-06-02 19:23:51] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:23:51] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 19:23:51] [INFO ] Invariant cache hit.
[2024-06-02 19:23:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:23:51] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-06-02 19:23:51] [INFO ] Redundant transitions in 16 ms returned []
Running 309 sub problems to find dead transitions.
[2024-06-02 19:23:51] [INFO ] Invariant cache hit.
[2024-06-02 19:23:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 322/492 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 1/493 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 0/493 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 176 constraints, problems are : Problem set: 0 solved, 309 unsolved in 9385 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 322/492 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 309/484 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 1/493 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/493 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 485 constraints, problems are : Problem set: 0 solved, 309 unsolved in 17050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
After SMT, in 26594ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 26597ms
Starting structural reductions in SI_CTL mode, iteration 1 : 170/592 places, 323/801 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26925 ms. Remains : 170/592 places, 323/801 transitions.
[2024-06-02 19:24:17] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:24:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:24:18] [INFO ] Input system was already deterministic with 323 transitions.
[2024-06-02 19:24:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:24:18] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:24:18] [INFO ] Time to serialize gal into /tmp/CTLFireability18236989282245239627.gal : 2 ms
[2024-06-02 19:24:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9522501916435258095.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/CTLFireability18236989282245239627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9522501916435258095.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.45623e+08,0.247341,13544,2,2354,5,40909,6,0,988,37223,0
Converting to forward existential form...Done !
original formula: AG(A((p232==1) U !(E((((p918==1)&&(p969==1))&&(p1161==1)) U EG((p187==1))))))
=> equivalent forward existential formula: ([FwdG(FwdU((FwdU(FwdU(Init,TRUE),!(!(E((((p918==1)&&(p969==1))&&(p1161==1)) U EG((p187==1)))))) * !((p232==1)))...310
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t24, t39, t55, t65, t80, t86, t154, t196, t199, t221, t284, t287, t291, t297, t307, ...273
Detected timeout of ITS tools.
[2024-06-02 19:24:48] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:24:48] [INFO ] Applying decomposition
[2024-06-02 19:24:48] [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/graph13849878227734765873.txt' '-o' '/tmp/graph13849878227734765873.bin' '-w' '/tmp/graph13849878227734765873.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13849878227734765873.bin' '-l' '-1' '-v' '-w' '/tmp/graph13849878227734765873.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:24:48] [INFO ] Decomposing Gal with order
[2024-06-02 19:24:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:24:48] [INFO ] Removed a total of 288 redundant transitions.
[2024-06-02 19:24:48] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:24:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 131 labels/synchronizations in 4 ms.
[2024-06-02 19:24:48] [INFO ] Time to serialize gal into /tmp/CTLFireability13108977013232951394.gal : 2 ms
[2024-06-02 19:24:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14568528057419525758.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/CTLFireability13108977013232951394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14568528057419525758.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 -...264
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.45623e+08,0.070475,5476,148,76,2594,795,592,4029,135,2079,0
Converting to forward existential form...Done !
original formula: AG(A((i1.i3.u11.p232==1) U !(E((((i6.i1.u52.p918==1)&&(i7.i1.u57.p969==1))&&(i7.i1.u59.p1161==1)) U EG((i0.i0.u6.p187==1))))))
=> equivalent forward existential formula: ([FwdG(FwdU((FwdU(FwdU(Init,TRUE),!(!(E((((i6.i1.u52.p918==1)&&(i7.i1.u57.p969==1))&&(i7.i1.u59.p1161==1)) U EG(...437
Reverse transition relation is NOT exact ! Due to transitions t278, t283, t284, i0.i2.u5.t86, i0.i4.u20.t65, i1.i0.u8.t80, i1.i3.u12.t154, i4.i0.u29.t196, ...415
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
(forward)formula 0,0,2.91636,123216,1,0,170321,7499,3440,818263,663,50240,128068
FORMULA CO4-PT-20-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 557 transition count 764
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 557 transition count 764
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 72 place count 557 transition count 762
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 96 place count 533 transition count 737
Iterating global reduction 1 with 24 rules applied. Total rules applied 120 place count 533 transition count 737
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 121 place count 533 transition count 736
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 137 place count 517 transition count 720
Iterating global reduction 2 with 16 rules applied. Total rules applied 153 place count 517 transition count 720
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 157 place count 517 transition count 716
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 164 place count 510 transition count 709
Iterating global reduction 3 with 7 rules applied. Total rules applied 171 place count 510 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 172 place count 510 transition count 708
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 176 place count 506 transition count 704
Iterating global reduction 4 with 4 rules applied. Total rules applied 180 place count 506 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 181 place count 506 transition count 703
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 182 place count 505 transition count 702
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 505 transition count 702
Applied a total of 183 rules in 56 ms. Remains 505 /592 variables (removed 87) and now considering 702/801 (removed 99) transitions.
// Phase 1: matrix 702 rows 505 cols
[2024-06-02 19:24:51] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 19:24:51] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 19:24:51] [INFO ] Invariant cache hit.
[2024-06-02 19:24:51] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 701 sub problems to find dead transitions.
[2024-06-02 19:24:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/505 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (OVERLAPS) 702/1207 variables, 505/510 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-06-02 19:25:17] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 3 ms to minimize.
[2024-06-02 19:25:17] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 3 ms to minimize.
[2024-06-02 19:25:17] [INFO ] Deduced a trap composed of 194 places in 72 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1207/1207 variables, and 513 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 701 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/505 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (OVERLAPS) 702/1207 variables, 505/513 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1207 variables, 701/1214 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-06-02 19:25:42] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1207/1207 variables, and 1215 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 4/4 constraints]
After SMT, in 60250ms problems are : Problem set: 0 solved, 701 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Starting structural reductions in LTL mode, iteration 1 : 505/592 places, 702/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60724 ms. Remains : 505/592 places, 702/801 transitions.
[2024-06-02 19:25:51] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:25:51] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:25:51] [INFO ] Input system was already deterministic with 702 transitions.
[2024-06-02 19:25:51] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:25:51] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:25:51] [INFO ] Time to serialize gal into /tmp/CTLFireability499963020888068790.gal : 3 ms
[2024-06-02 19:25:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11271765691422174012.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/CTLFireability499963020888068790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11271765691422174012.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.51635e+12,18.7192,483156,2,32425,5,1.45233e+06,6,0,2716,2.4559e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:26:22] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:26:22] [INFO ] Applying decomposition
[2024-06-02 19:26:22] [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/graph7915397529247852777.txt' '-o' '/tmp/graph7915397529247852777.bin' '-w' '/tmp/graph7915397529247852777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7915397529247852777.bin' '-l' '-1' '-v' '-w' '/tmp/graph7915397529247852777.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:26:22] [INFO ] Decomposing Gal with order
[2024-06-02 19:26:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:26:22] [INFO ] Removed a total of 409 redundant transitions.
[2024-06-02 19:26:22] [INFO ] Flatten gal took : 39 ms
[2024-06-02 19:26:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 17 ms.
[2024-06-02 19:26:22] [INFO ] Time to serialize gal into /tmp/CTLFireability17188894786019179993.gal : 6 ms
[2024-06-02 19:26:22] [INFO ] Time to serialize properties into /tmp/CTLFireability3669074338042839287.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/CTLFireability17188894786019179993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3669074338042839287.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.51635e+12,4.05497,135256,2487,231,180338,11197,1244,956336,123,123280,0
Converting to forward existential form...Done !
original formula: !(E((((EX(!(EF((i16.i1.i0.u140.p847==1)))) + !(((i19.u177.p1069==1)||(i3.u36.p302==1)))) + ((i7.u68.p454!=1)||(i9.u122.p765==1))) + (EX((...332
=> equivalent forward existential formula: [((FwdU(Init,(((EX(!(E(TRUE U (i16.i1.i0.u140.p847==1)))) + !(((i19.u177.p1069==1)||(i3.u36.p302==1)))) + ((i7.u...386
Reverse transition relation is NOT exact ! Due to transitions t18, t29, t53, t86, t95, t96, t140, t188, t236, t273, t362, t374, t452, t464, t535, t563, t56...1198
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
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Graph (trivial) has 632 edges and 592 vertex of which 3 / 592 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1132 edges and 590 vertex of which 582 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 273 rules applied. Total rules applied 275 place count 581 transition count 516
Reduce places removed 273 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 275 rules applied. Total rules applied 550 place count 308 transition count 514
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 550 place count 308 transition count 473
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 632 place count 267 transition count 473
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 647 place count 252 transition count 455
Iterating global reduction 2 with 15 rules applied. Total rules applied 662 place count 252 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 663 place count 252 transition count 454
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 663 place count 252 transition count 448
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 675 place count 246 transition count 448
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 679 place count 242 transition count 442
Iterating global reduction 3 with 4 rules applied. Total rules applied 683 place count 242 transition count 442
Performed 37 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 757 place count 205 transition count 403
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 13 rules applied. Total rules applied 770 place count 205 transition count 390
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 778 place count 200 transition count 387
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 787 place count 191 transition count 374
Iterating global reduction 5 with 9 rules applied. Total rules applied 796 place count 191 transition count 374
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 5 with 3 rules applied. Total rules applied 799 place count 191 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 800 place count 190 transition count 371
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 7 with 2 rules applied. Total rules applied 802 place count 189 transition count 370
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 803 place count 188 transition count 368
Iterating global reduction 7 with 1 rules applied. Total rules applied 804 place count 188 transition count 368
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 805 place count 187 transition count 366
Iterating global reduction 7 with 1 rules applied. Total rules applied 806 place count 187 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 807 place count 187 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 833 place count 187 transition count 339
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 8 with 16 rules applied. Total rules applied 849 place count 187 transition count 323
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 865 place count 171 transition count 323
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 865 place count 171 transition count 320
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 871 place count 168 transition count 320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 873 place count 167 transition count 319
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 875 place count 165 transition count 317
Applied a total of 875 rules in 98 ms. Remains 165 /592 variables (removed 427) and now considering 317/801 (removed 484) transitions.
// Phase 1: matrix 317 rows 165 cols
[2024-06-02 19:26:52] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:26:52] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-02 19:26:52] [INFO ] Invariant cache hit.
[2024-06-02 19:26:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:26:52] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-06-02 19:26:52] [INFO ] Redundant transitions in 4 ms returned []
Running 294 sub problems to find dead transitions.
[2024-06-02 19:26:52] [INFO ] Invariant cache hit.
[2024-06-02 19:26:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 316/481 variables, 165/170 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 1/482 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 171 constraints, problems are : Problem set: 0 solved, 294 unsolved in 10059 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 316/481 variables, 165/170 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 294/464 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 1/482 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/482 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 465 constraints, problems are : Problem set: 0 solved, 294 unsolved in 13842 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
After SMT, in 23988ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 23991ms
Starting structural reductions in SI_CTL mode, iteration 1 : 165/592 places, 317/801 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24346 ms. Remains : 165/592 places, 317/801 transitions.
[2024-06-02 19:27:16] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:27:16] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:27:16] [INFO ] Input system was already deterministic with 317 transitions.
[2024-06-02 19:27:16] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:27:16] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:27:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14309440412757297940.gal : 2 ms
[2024-06-02 19:27:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6928404827509439651.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14309440412757297940.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6928404827509439651.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 25286 steps (1977 resets) in 166 ms. (151 steps per ms) remains 0/1 properties
FORMULA CO4-PT-20-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in SI_CTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Graph (trivial) has 627 edges and 592 vertex of which 3 / 592 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1132 edges and 590 vertex of which 582 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 272 rules applied. Total rules applied 274 place count 581 transition count 517
Reduce places removed 272 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 276 rules applied. Total rules applied 550 place count 309 transition count 513
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 552 place count 307 transition count 513
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 552 place count 307 transition count 473
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 632 place count 267 transition count 473
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 647 place count 252 transition count 455
Iterating global reduction 3 with 15 rules applied. Total rules applied 662 place count 252 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 663 place count 252 transition count 454
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 663 place count 252 transition count 448
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 675 place count 246 transition count 448
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 679 place count 242 transition count 442
Iterating global reduction 4 with 4 rules applied. Total rules applied 683 place count 242 transition count 442
Performed 37 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 757 place count 205 transition count 403
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 13 rules applied. Total rules applied 770 place count 205 transition count 390
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 778 place count 200 transition count 387
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 787 place count 191 transition count 374
Iterating global reduction 6 with 9 rules applied. Total rules applied 796 place count 191 transition count 374
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 3 rules applied. Total rules applied 799 place count 191 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 800 place count 190 transition count 371
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 802 place count 189 transition count 370
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 803 place count 188 transition count 368
Iterating global reduction 8 with 1 rules applied. Total rules applied 804 place count 188 transition count 368
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 805 place count 187 transition count 366
Iterating global reduction 8 with 1 rules applied. Total rules applied 806 place count 187 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 807 place count 187 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 833 place count 187 transition count 339
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 16 rules applied. Total rules applied 849 place count 187 transition count 323
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 865 place count 171 transition count 323
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 865 place count 171 transition count 320
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 871 place count 168 transition count 320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 873 place count 167 transition count 319
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 875 place count 165 transition count 317
Applied a total of 875 rules in 61 ms. Remains 165 /592 variables (removed 427) and now considering 317/801 (removed 484) transitions.
// Phase 1: matrix 317 rows 165 cols
[2024-06-02 19:27:16] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:27:17] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-02 19:27:17] [INFO ] Invariant cache hit.
[2024-06-02 19:27:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:27:17] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-06-02 19:27:17] [INFO ] Redundant transitions in 3 ms returned []
Running 298 sub problems to find dead transitions.
[2024-06-02 19:27:17] [INFO ] Invariant cache hit.
[2024-06-02 19:27:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 316/480 variables, 164/169 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 1/481 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (OVERLAPS) 1/482 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 0/482 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 171 constraints, problems are : Problem set: 0 solved, 298 unsolved in 10677 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 316/480 variables, 164/169 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 295/464 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (OVERLAPS) 1/481 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 3/468 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 1/482 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (OVERLAPS) 0/482 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 469 constraints, problems are : Problem set: 0 solved, 298 unsolved in 19556 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints]
After SMT, in 30332ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 30335ms
Starting structural reductions in SI_CTL mode, iteration 1 : 165/592 places, 317/801 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30754 ms. Remains : 165/592 places, 317/801 transitions.
[2024-06-02 19:27:47] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:27:47] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:27:47] [INFO ] Input system was already deterministic with 317 transitions.
[2024-06-02 19:27:47] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:27:47] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:27:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5487161033312198916.gal : 1 ms
[2024-06-02 19:27:47] [INFO ] Time to serialize properties into /tmp/CTLFireability14345660526372153111.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/CTLFireability5487161033312198916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14345660526372153111.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,3.37392e+08,0.285707,15560,2,3312,5,52976,6,0,963,38901,0
Converting to forward existential form...Done !
original formula: AG(AF(((p351==1)&&(p532==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p351==1)&&(p532==1))))] = FALSE
Hit Full ! (commute/partial/dont) 289/0/28
(forward)formula 0,0,1.91813,69684,1,0,8,401825,20,3,5105,137289,8
FORMULA CO4-PT-20-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 557 transition count 764
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 557 transition count 764
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 72 place count 557 transition count 762
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 96 place count 533 transition count 737
Iterating global reduction 1 with 24 rules applied. Total rules applied 120 place count 533 transition count 737
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 122 place count 533 transition count 735
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 138 place count 517 transition count 719
Iterating global reduction 2 with 16 rules applied. Total rules applied 154 place count 517 transition count 719
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 158 place count 517 transition count 715
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 165 place count 510 transition count 708
Iterating global reduction 3 with 7 rules applied. Total rules applied 172 place count 510 transition count 708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 173 place count 510 transition count 707
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 176 place count 507 transition count 704
Iterating global reduction 4 with 3 rules applied. Total rules applied 179 place count 507 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 180 place count 507 transition count 703
Applied a total of 180 rules in 44 ms. Remains 507 /592 variables (removed 85) and now considering 703/801 (removed 98) transitions.
// Phase 1: matrix 703 rows 507 cols
[2024-06-02 19:27:49] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:27:49] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 19:27:49] [INFO ] Invariant cache hit.
[2024-06-02 19:27:49] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 702 sub problems to find dead transitions.
[2024-06-02 19:27:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 702 unsolved
[2024-06-02 19:28:05] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:28:05] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/507 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 4 (OVERLAPS) 703/1210 variables, 507/514 constraints. Problems are: Problem set: 0 solved, 702 unsolved
[2024-06-02 19:28:17] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-06-02 19:28:17] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 3 ms to minimize.
[2024-06-02 19:28:18] [INFO ] Deduced a trap composed of 198 places in 86 ms of which 2 ms to minimize.
((s0 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1210/1210 variables, and 517 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 702 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/507 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 4 (OVERLAPS) 703/1210 variables, 507/517 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1210 variables, 702/1219 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1210/1210 variables, and 1219 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 5/5 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 702 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Starting structural reductions in LTL mode, iteration 1 : 507/592 places, 703/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60626 ms. Remains : 507/592 places, 703/801 transitions.
[2024-06-02 19:28:50] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:28:50] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:28:50] [INFO ] Input system was already deterministic with 703 transitions.
[2024-06-02 19:28:50] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:28:50] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:28:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16096155033999604660.gal : 2 ms
[2024-06-02 19:28:50] [INFO ] Time to serialize properties into /tmp/CTLFireability9827598242785190066.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/CTLFireability16096155033999604660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9827598242785190066.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.78577e+12,27.2503,662260,2,48300,5,1.79317e+06,6,0,2725,3.49522e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:29:20] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:29:20] [INFO ] Applying decomposition
[2024-06-02 19:29:20] [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/graph14016084630770712763.txt' '-o' '/tmp/graph14016084630770712763.bin' '-w' '/tmp/graph14016084630770712763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14016084630770712763.bin' '-l' '-1' '-v' '-w' '/tmp/graph14016084630770712763.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:29:20] [INFO ] Decomposing Gal with order
[2024-06-02 19:29:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:29:20] [INFO ] Removed a total of 414 redundant transitions.
[2024-06-02 19:29:20] [INFO ] Flatten gal took : 27 ms
[2024-06-02 19:29:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 7 ms.
[2024-06-02 19:29:20] [INFO ] Time to serialize gal into /tmp/CTLFireability2413546436967003386.gal : 5 ms
[2024-06-02 19:29:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5604014161554589816.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/CTLFireability2413546436967003386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5604014161554589816.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.78577e+12,3.02091,108148,3509,173,151805,6317,1157,693176,124,59639,0
Converting to forward existential form...Done !
original formula: E(EX((!(AX((i15.u126.p759==1))) + !(((i17.u142.p838==1)&&(i9.u170.p959==1))))) U !(((AF(!(EG((i2.u12.p147==1)))) + !(AG(((i12.i0.i0.u81.p...290
=> equivalent forward existential formula: [FwdG(((FwdU(Init,EX((!(!(EX(!((i15.u126.p759==1))))) + !(((i17.u142.p838==1)&&(i9.u170.p959==1)))))) * !((E(TRU...370
Reverse transition relation is NOT exact ! Due to transitions t19, t30, t55, t86, t95, t96, t129, t135, t142, t153, t154, t212, t224, t227, t270, t271, t31...1428
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 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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 555 transition count 762
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 555 transition count 762
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 76 place count 555 transition count 760
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 102 place count 529 transition count 733
Iterating global reduction 1 with 26 rules applied. Total rules applied 128 place count 529 transition count 733
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 129 place count 529 transition count 732
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 145 place count 513 transition count 716
Iterating global reduction 2 with 16 rules applied. Total rules applied 161 place count 513 transition count 716
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 165 place count 513 transition count 712
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 171 place count 507 transition count 706
Iterating global reduction 3 with 6 rules applied. Total rules applied 177 place count 507 transition count 706
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 181 place count 503 transition count 702
Iterating global reduction 3 with 4 rules applied. Total rules applied 185 place count 503 transition count 702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 186 place count 503 transition count 701
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 187 place count 502 transition count 700
Iterating global reduction 4 with 1 rules applied. Total rules applied 188 place count 502 transition count 700
Applied a total of 188 rules in 54 ms. Remains 502 /592 variables (removed 90) and now considering 700/801 (removed 101) transitions.
// Phase 1: matrix 700 rows 502 cols
[2024-06-02 19:29:50] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 19:29:50] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-02 19:29:50] [INFO ] Invariant cache hit.
[2024-06-02 19:29:50] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 699 sub problems to find dead transitions.
[2024-06-02 19:29:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/502 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 699 unsolved
[2024-06-02 19:30:05] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-02 19:30:05] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 4 (OVERLAPS) 700/1202 variables, 502/509 constraints. Problems are: Problem set: 0 solved, 699 unsolved
[2024-06-02 19:30:17] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
[2024-06-02 19:30:17] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
[2024-06-02 19:30:19] [INFO ] Deduced a trap composed of 188 places in 83 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 512 constraints, problems are : Problem set: 0 solved, 699 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 699 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/502 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 4 (OVERLAPS) 700/1202 variables, 502/512 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 699/1211 constraints. Problems are: Problem set: 0 solved, 699 unsolved
[2024-06-02 19:30:37] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1212 constraints, problems are : Problem set: 0 solved, 699 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 6/6 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 699 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in LTL mode, iteration 1 : 502/592 places, 700/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60755 ms. Remains : 502/592 places, 700/801 transitions.
[2024-06-02 19:30:51] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:30:51] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:30:51] [INFO ] Input system was already deterministic with 700 transitions.
[2024-06-02 19:30:51] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:30:51] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:30:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9402874474593155244.gal : 3 ms
[2024-06-02 19:30:51] [INFO ] Time to serialize properties into /tmp/CTLFireability2675424264763847991.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/CTLFireability9402874474593155244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2675424264763847991.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.51769e+12,15.1955,416280,2,29347,5,1.24183e+06,6,0,2702,2.10137e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:31:21] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:31:21] [INFO ] Applying decomposition
[2024-06-02 19:31:21] [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/graph18332009223332019292.txt' '-o' '/tmp/graph18332009223332019292.bin' '-w' '/tmp/graph18332009223332019292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18332009223332019292.bin' '-l' '-1' '-v' '-w' '/tmp/graph18332009223332019292.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:31:21] [INFO ] Decomposing Gal with order
[2024-06-02 19:31:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:31:21] [INFO ] Removed a total of 421 redundant transitions.
[2024-06-02 19:31:21] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:31:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 5 ms.
[2024-06-02 19:31:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4520710549076967270.gal : 5 ms
[2024-06-02 19:31:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11378276376672584457.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/CTLFireability4520710549076967270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11378276376672584457.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.51769e+12,4.80375,174208,2194,177,217170,7126,1201,1.39446e+06,119,69424,0
Converting to forward existential form...Done !
original formula: AF(((i16.u92.p611==1) * (AG((((i20.u182.p1073==1)||(i2.u18.p204==1)) + AX(FALSE))) + AF(AG(((i1.i0.i1.u13.p160==0)||(i11.u169.p955==0))))...158
=> equivalent forward existential formula: [FwdG(Init,!(((i16.u92.p611==1) * (!(E(TRUE U !((((i20.u182.p1073==1)||(i2.u18.p204==1)) + !(EX(!(FALSE))))))) +...239
Reverse transition relation is NOT exact ! Due to transitions t18, t29, t53, t66, t90, t99, t100, t144, t178, t228, t236, t272, t362, t371, t561, t562, t59...1138
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 553 transition count 760
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 553 transition count 760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 553 transition count 758
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 107 place count 526 transition count 730
Iterating global reduction 1 with 27 rules applied. Total rules applied 134 place count 526 transition count 730
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 136 place count 526 transition count 728
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 153 place count 509 transition count 711
Iterating global reduction 2 with 17 rules applied. Total rules applied 170 place count 509 transition count 711
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 174 place count 509 transition count 707
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 181 place count 502 transition count 700
Iterating global reduction 3 with 7 rules applied. Total rules applied 188 place count 502 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 189 place count 502 transition count 699
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 192 place count 499 transition count 696
Iterating global reduction 4 with 3 rules applied. Total rules applied 195 place count 499 transition count 696
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 196 place count 498 transition count 695
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 498 transition count 695
Applied a total of 197 rules in 58 ms. Remains 498 /592 variables (removed 94) and now considering 695/801 (removed 106) transitions.
// Phase 1: matrix 695 rows 498 cols
[2024-06-02 19:31:51] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 19:31:51] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 19:31:51] [INFO ] Invariant cache hit.
[2024-06-02 19:31:51] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 694 sub problems to find dead transitions.
[2024-06-02 19:31:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (OVERLAPS) 1/498 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 694 unsolved
[2024-06-02 19:32:07] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-02 19:32:07] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 4 (OVERLAPS) 695/1193 variables, 498/505 constraints. Problems are: Problem set: 0 solved, 694 unsolved
[2024-06-02 19:32:19] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-06-02 19:32:19] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:32:20] [INFO ] Deduced a trap composed of 192 places in 81 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1193/1193 variables, and 508 constraints, problems are : Problem set: 0 solved, 694 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 694/694 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (OVERLAPS) 1/498 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 4 (OVERLAPS) 695/1193 variables, 498/508 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1193 variables, 694/1202 constraints. Problems are: Problem set: 0 solved, 694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1193/1193 variables, and 1202 constraints, problems are : Problem set: 0 solved, 694 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 694/694 constraints, Known Traps: 5/5 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 694 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Starting structural reductions in LTL mode, iteration 1 : 498/592 places, 695/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60732 ms. Remains : 498/592 places, 695/801 transitions.
[2024-06-02 19:32:52] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:32:52] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:32:52] [INFO ] Input system was already deterministic with 695 transitions.
[2024-06-02 19:32:52] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:32:52] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:32:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7302167134839385663.gal : 4 ms
[2024-06-02 19:32:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1264589853582853690.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/CTLFireability7302167134839385663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1264589853582853690.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.31606e+12,16.8113,425800,2,29779,5,1.24997e+06,6,0,2681,2.11257e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:33:22] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:33:22] [INFO ] Applying decomposition
[2024-06-02 19:33:22] [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/graph11216759664095779999.txt' '-o' '/tmp/graph11216759664095779999.bin' '-w' '/tmp/graph11216759664095779999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11216759664095779999.bin' '-l' '-1' '-v' '-w' '/tmp/graph11216759664095779999.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:33:22] [INFO ] Decomposing Gal with order
[2024-06-02 19:33:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:33:22] [INFO ] Removed a total of 415 redundant transitions.
[2024-06-02 19:33:22] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:33:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 4 ms.
[2024-06-02 19:33:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14243165320300909958.gal : 4 ms
[2024-06-02 19:33:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9740128793170911349.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/CTLFireability14243165320300909958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9740128793170911349.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.31606e+12,1.68517,68512,1884,178,90581,7097,1179,438697,128,64625,0
Converting to forward existential form...Done !
original formula: EG((AX((i5.u22.p216==0)) + AG((i10.u127.p783==0))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!((i5.u22.p216==0)))) + !(E(TRUE U !((i10.u127.p783==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t52, t83, t92, t93, t137, t183, t226, t270, t311, t323, t359, t368, t412, t458, t52...1120
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 552 transition count 759
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 552 transition count 759
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 82 place count 552 transition count 757
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 110 place count 524 transition count 728
Iterating global reduction 1 with 28 rules applied. Total rules applied 138 place count 524 transition count 728
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 140 place count 524 transition count 726
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 158 place count 506 transition count 708
Iterating global reduction 2 with 18 rules applied. Total rules applied 176 place count 506 transition count 708
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 180 place count 506 transition count 704
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 188 place count 498 transition count 696
Iterating global reduction 3 with 8 rules applied. Total rules applied 196 place count 498 transition count 696
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 197 place count 498 transition count 695
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 201 place count 494 transition count 691
Iterating global reduction 4 with 4 rules applied. Total rules applied 205 place count 494 transition count 691
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 206 place count 494 transition count 690
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 207 place count 493 transition count 689
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 493 transition count 689
Applied a total of 208 rules in 52 ms. Remains 493 /592 variables (removed 99) and now considering 689/801 (removed 112) transitions.
// Phase 1: matrix 689 rows 493 cols
[2024-06-02 19:33:52] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 19:33:52] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 19:33:52] [INFO ] Invariant cache hit.
[2024-06-02 19:33:52] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 688 sub problems to find dead transitions.
[2024-06-02 19:33:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
[2024-06-02 19:34:07] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:34:07] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 4 (OVERLAPS) 689/1182 variables, 493/500 constraints. Problems are: Problem set: 0 solved, 688 unsolved
[2024-06-02 19:34:19] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
[2024-06-02 19:34:19] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 3 ms to minimize.
[2024-06-02 19:34:20] [INFO ] Deduced a trap composed of 187 places in 81 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1182/1182 variables, and 503 constraints, problems are : Problem set: 0 solved, 688 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 4 (OVERLAPS) 689/1182 variables, 493/503 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1182 variables, 688/1191 constraints. Problems are: Problem set: 0 solved, 688 unsolved
[2024-06-02 19:34:38] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1182/1182 variables, and 1192 constraints, problems are : Problem set: 0 solved, 688 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 6/6 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 688 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Starting structural reductions in LTL mode, iteration 1 : 493/592 places, 689/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60673 ms. Remains : 493/592 places, 689/801 transitions.
[2024-06-02 19:34:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:34:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:34:53] [INFO ] Input system was already deterministic with 689 transitions.
[2024-06-02 19:34:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:34:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:34:53] [INFO ] Time to serialize gal into /tmp/CTLFireability2940471425492539957.gal : 2 ms
[2024-06-02 19:34:53] [INFO ] Time to serialize properties into /tmp/CTLFireability11404349382228386084.ctl : 6 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/CTLFireability2940471425492539957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11404349382228386084.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.2873e+12,16.3254,417532,2,29610,5,1.24554e+06,6,0,2655,2.08006e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:35:23] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:35:23] [INFO ] Applying decomposition
[2024-06-02 19:35:23] [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/graph16787918663479075966.txt' '-o' '/tmp/graph16787918663479075966.bin' '-w' '/tmp/graph16787918663479075966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16787918663479075966.bin' '-l' '-1' '-v' '-w' '/tmp/graph16787918663479075966.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:35:23] [INFO ] Decomposing Gal with order
[2024-06-02 19:35:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:35:23] [INFO ] Removed a total of 418 redundant transitions.
[2024-06-02 19:35:23] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:35:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 4 ms.
[2024-06-02 19:35:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14045724274493264432.gal : 4 ms
[2024-06-02 19:35:23] [INFO ] Time to serialize properties into /tmp/CTLFireability7420394711163205922.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/CTLFireability14045724274493264432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7420394711163205922.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.2873e+12,1.69715,64668,2089,181,89618,6470,1061,397892,124,57399,0
Converting to forward existential form...Done !
original formula: E(EG(!(EG((((i15.u121.p746==1)&&(i20.u167.p969==1))&&(i20.u172.p1069==1))))) U EX(EF(EG((i19.u149.p883==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(FwdU(Init,EG(!(EG((((i15.u121.p746==1)&&(i20.u167.p969==1))&&(i20.u172.p1069==1))))))),TRUE),(i19....179
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t52, t83, t92, t93, t137, t171, t183, t265, t306, t318, t354, t363, t453, t462, t46...1044
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 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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 553 transition count 760
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 553 transition count 760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 553 transition count 758
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 108 place count 525 transition count 729
Iterating global reduction 1 with 28 rules applied. Total rules applied 136 place count 525 transition count 729
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 138 place count 525 transition count 727
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 156 place count 507 transition count 709
Iterating global reduction 2 with 18 rules applied. Total rules applied 174 place count 507 transition count 709
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 178 place count 507 transition count 705
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 186 place count 499 transition count 697
Iterating global reduction 3 with 8 rules applied. Total rules applied 194 place count 499 transition count 697
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 499 transition count 696
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 199 place count 495 transition count 692
Iterating global reduction 4 with 4 rules applied. Total rules applied 203 place count 495 transition count 692
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 495 transition count 691
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 205 place count 494 transition count 690
Iterating global reduction 5 with 1 rules applied. Total rules applied 206 place count 494 transition count 690
Applied a total of 206 rules in 56 ms. Remains 494 /592 variables (removed 98) and now considering 690/801 (removed 111) transitions.
// Phase 1: matrix 690 rows 494 cols
[2024-06-02 19:35:53] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 19:35:53] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 19:35:53] [INFO ] Invariant cache hit.
[2024-06-02 19:35:53] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 689 sub problems to find dead transitions.
[2024-06-02 19:35:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (OVERLAPS) 1/494 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 3 (OVERLAPS) 690/1184 variables, 494/499 constraints. Problems are: Problem set: 0 solved, 689 unsolved
[2024-06-02 19:36:18] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 3 ms to minimize.
[2024-06-02 19:36:19] [INFO ] Deduced a trap composed of 188 places in 80 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1184/1184 variables, and 501 constraints, problems are : Problem set: 0 solved, 689 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 494/494 constraints, PredecessorRefiner: 689/689 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 689 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (OVERLAPS) 1/494 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/494 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 4 (OVERLAPS) 690/1184 variables, 494/501 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1184 variables, 689/1190 constraints. Problems are: Problem set: 0 solved, 689 unsolved
[2024-06-02 19:36:39] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:36:39] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1184/1184 variables, and 1192 constraints, problems are : Problem set: 0 solved, 689 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 494/494 constraints, PredecessorRefiner: 689/689 constraints, Known Traps: 4/4 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 689 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Starting structural reductions in LTL mode, iteration 1 : 494/592 places, 690/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60686 ms. Remains : 494/592 places, 690/801 transitions.
[2024-06-02 19:36:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:36:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:36:54] [INFO ] Input system was already deterministic with 690 transitions.
[2024-06-02 19:36:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:36:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:36:54] [INFO ] Time to serialize gal into /tmp/CTLFireability13565737382231159192.gal : 2 ms
[2024-06-02 19:36:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12834913146196596567.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/CTLFireability13565737382231159192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12834913146196596567.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.29304e+12,16.9108,429304,2,29569,5,1.24816e+06,6,0,2660,2.14849e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:37:24] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:37:24] [INFO ] Applying decomposition
[2024-06-02 19:37:24] [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/graph9703107144738947227.txt' '-o' '/tmp/graph9703107144738947227.bin' '-w' '/tmp/graph9703107144738947227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9703107144738947227.bin' '-l' '-1' '-v' '-w' '/tmp/graph9703107144738947227.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:37:24] [INFO ] Decomposing Gal with order
[2024-06-02 19:37:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:37:24] [INFO ] Removed a total of 424 redundant transitions.
[2024-06-02 19:37:24] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:37:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 4 ms.
[2024-06-02 19:37:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14714294578257372800.gal : 4 ms
[2024-06-02 19:37:24] [INFO ] Time to serialize properties into /tmp/CTLFireability3275061154885646661.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/CTLFireability14714294578257372800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3275061154885646661.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.29304e+12,2.13532,76612,2308,178,104412,7518,1106,484365,125,76807,0
Converting to forward existential form...Done !
original formula: EG(A(AX((i13.u90.p616!=1)) U A(AX((i16.u131.p824==1)) U (i9.u162.p640!=1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!((E(!((i9.u162.p640!=1)) U (!(!(EX(!((i16.u131.p824==1))))) * !((i9.u162.p640!=1)))) + EG(!((...469
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t52, t83, t92, t93, t137, t171, t183, t221, t265, t319, t355, t364, t454, t525, t55...1071
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 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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 561 transition count 770
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 561 transition count 770
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 561 transition count 768
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 86 place count 539 transition count 745
Iterating global reduction 1 with 22 rules applied. Total rules applied 108 place count 539 transition count 745
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 110 place count 539 transition count 743
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 124 place count 525 transition count 729
Iterating global reduction 2 with 14 rules applied. Total rules applied 138 place count 525 transition count 729
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 142 place count 525 transition count 725
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 149 place count 518 transition count 718
Iterating global reduction 3 with 7 rules applied. Total rules applied 156 place count 518 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 157 place count 518 transition count 717
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 160 place count 515 transition count 714
Iterating global reduction 4 with 3 rules applied. Total rules applied 163 place count 515 transition count 714
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 164 place count 515 transition count 713
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 165 place count 514 transition count 712
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 514 transition count 712
Applied a total of 166 rules in 46 ms. Remains 514 /592 variables (removed 78) and now considering 712/801 (removed 89) transitions.
// Phase 1: matrix 712 rows 514 cols
[2024-06-02 19:37:54] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 19:37:54] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 19:37:54] [INFO ] Invariant cache hit.
[2024-06-02 19:37:54] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 711 sub problems to find dead transitions.
[2024-06-02 19:37:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 1 (OVERLAPS) 1/514 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 3 (OVERLAPS) 712/1226 variables, 514/519 constraints. Problems are: Problem set: 0 solved, 711 unsolved
[2024-06-02 19:38:22] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
[2024-06-02 19:38:22] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 7 ms to minimize.
[2024-06-02 19:38:23] [INFO ] Deduced a trap composed of 194 places in 88 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1226/1226 variables, and 522 constraints, problems are : Problem set: 0 solved, 711 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 711/711 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 711 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 1 (OVERLAPS) 1/514 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 4 (OVERLAPS) 712/1226 variables, 514/522 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1226 variables, 711/1233 constraints. Problems are: Problem set: 0 solved, 711 unsolved
[2024-06-02 19:38:49] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1226/1226 variables, and 1234 constraints, problems are : Problem set: 0 solved, 711 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 711/711 constraints, Known Traps: 4/4 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 711 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Starting structural reductions in LTL mode, iteration 1 : 514/592 places, 712/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60661 ms. Remains : 514/592 places, 712/801 transitions.
[2024-06-02 19:38:55] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:38:55] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:38:55] [INFO ] Input system was already deterministic with 712 transitions.
[2024-06-02 19:38:55] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:38:55] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:38:55] [INFO ] Time to serialize gal into /tmp/CTLFireability3628030766735384688.gal : 3 ms
[2024-06-02 19:38:55] [INFO ] Time to serialize properties into /tmp/CTLFireability15257006693054378814.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/CTLFireability3628030766735384688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15257006693054378814.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.5319e+12,14.8502,388916,2,31160,5,1.18706e+06,6,0,2762,1.90354e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:39:25] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:39:25] [INFO ] Applying decomposition
[2024-06-02 19:39:25] [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/graph10416517442982622026.txt' '-o' '/tmp/graph10416517442982622026.bin' '-w' '/tmp/graph10416517442982622026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10416517442982622026.bin' '-l' '-1' '-v' '-w' '/tmp/graph10416517442982622026.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:39:25] [INFO ] Decomposing Gal with order
[2024-06-02 19:39:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:39:25] [INFO ] Removed a total of 427 redundant transitions.
[2024-06-02 19:39:25] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:39:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 4 ms.
[2024-06-02 19:39:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3888632116663554072.gal : 4 ms
[2024-06-02 19:39:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8994311703951612017.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/CTLFireability3888632116663554072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8994311703951612017.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.5319e+12,5.51857,193376,2310,184,236788,9343,1159,1.57713e+06,126,92329,0
Converting to forward existential form...Done !
original formula: (E((EF(!(EX((((i16.i0.i1.i0.u157.p887==1)&&(i17.u175.p969==1))&&(i17.u189.p1161==1))))) + AX((((i3.u24.p221==1)||((i10.u124.p745==1)&&(i7...444
=> equivalent forward existential formula: ([(EY((Init * !(E((E(TRUE U !(EX((((i16.i0.i1.i0.u157.p887==1)&&(i17.u175.p969==1))&&(i17.u189.p1161==1))))) + !...858
Reverse transition relation is NOT exact ! Due to transitions t0, t20, t31, t55, t88, t97, t98, t143, t177, t189, t236, t287, t295, t303, t366, t568, t569,...1140
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
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Graph (trivial) has 632 edges and 592 vertex of which 3 / 592 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1132 edges and 590 vertex of which 582 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 273 rules applied. Total rules applied 275 place count 581 transition count 516
Reduce places removed 273 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 274 rules applied. Total rules applied 549 place count 308 transition count 515
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 549 place count 308 transition count 474
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 631 place count 267 transition count 474
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 646 place count 252 transition count 456
Iterating global reduction 2 with 15 rules applied. Total rules applied 661 place count 252 transition count 456
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 662 place count 252 transition count 455
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 662 place count 252 transition count 449
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 674 place count 246 transition count 449
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 678 place count 242 transition count 443
Iterating global reduction 3 with 4 rules applied. Total rules applied 682 place count 242 transition count 443
Performed 37 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 756 place count 205 transition count 404
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 13 rules applied. Total rules applied 769 place count 205 transition count 391
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 777 place count 200 transition count 388
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 786 place count 191 transition count 375
Iterating global reduction 5 with 9 rules applied. Total rules applied 795 place count 191 transition count 375
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 5 with 3 rules applied. Total rules applied 798 place count 191 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 799 place count 190 transition count 372
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 7 with 2 rules applied. Total rules applied 801 place count 189 transition count 371
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 802 place count 188 transition count 369
Iterating global reduction 7 with 1 rules applied. Total rules applied 803 place count 188 transition count 369
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 804 place count 187 transition count 367
Iterating global reduction 7 with 1 rules applied. Total rules applied 805 place count 187 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 806 place count 187 transition count 366
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 832 place count 187 transition count 340
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 8 with 16 rules applied. Total rules applied 848 place count 187 transition count 324
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 864 place count 171 transition count 324
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 864 place count 171 transition count 322
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 868 place count 169 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 870 place count 168 transition count 321
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 872 place count 166 transition count 319
Applied a total of 872 rules in 81 ms. Remains 166 /592 variables (removed 426) and now considering 319/801 (removed 482) transitions.
// Phase 1: matrix 319 rows 166 cols
[2024-06-02 19:39:55] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 19:39:55] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 19:39:55] [INFO ] Invariant cache hit.
[2024-06-02 19:39:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:39:55] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-06-02 19:39:55] [INFO ] Redundant transitions in 5 ms returned []
Running 296 sub problems to find dead transitions.
[2024-06-02 19:39:55] [INFO ] Invariant cache hit.
[2024-06-02 19:39:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 318/484 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 1/485 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 0/485 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 172 constraints, problems are : Problem set: 0 solved, 296 unsolved in 10209 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 166/166 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 318/484 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 296/467 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (OVERLAPS) 1/485 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 468 constraints, problems are : Problem set: 0 solved, 296 unsolved in 14176 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 166/166 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 0/0 constraints]
After SMT, in 24470ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 24475ms
Starting structural reductions in SI_CTL mode, iteration 1 : 166/592 places, 319/801 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24779 ms. Remains : 166/592 places, 319/801 transitions.
[2024-06-02 19:40:20] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:40:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:40:20] [INFO ] Input system was already deterministic with 319 transitions.
[2024-06-02 19:40:20] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:40:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:40:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15061029626429007999.gal : 1 ms
[2024-06-02 19:40:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7159293655681019934.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/CTLFireability15061029626429007999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7159293655681019934.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,3.97509e+08,0.287229,15572,2,3405,5,54014,6,0,969,39442,0
Converting to forward existential form...Done !
original formula: EG(AG(AF((p464==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!((p464==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t23, t38, t54, t56, t69, t83, t88, t133, t309, t312, Intersection with reachable a...225
Detected timeout of ITS tools.
[2024-06-02 19:40:50] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:40:50] [INFO ] Applying decomposition
[2024-06-02 19:40:50] [INFO ] Flatten gal took : 5 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/graph9385324128872875751.txt' '-o' '/tmp/graph9385324128872875751.bin' '-w' '/tmp/graph9385324128872875751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9385324128872875751.bin' '-l' '-1' '-v' '-w' '/tmp/graph9385324128872875751.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:40:50] [INFO ] Decomposing Gal with order
[2024-06-02 19:40:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:40:50] [INFO ] Removed a total of 248 redundant transitions.
[2024-06-02 19:40:50] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:40:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 2 ms.
[2024-06-02 19:40:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7048726143659050153.gal : 1 ms
[2024-06-02 19:40:50] [INFO ] Time to serialize properties into /tmp/CTLFireability5002150716913856181.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/CTLFireability7048726143659050153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5002150716913856181.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,3.97509e+08,0.04991,5420,135,75,2140,543,564,3125,133,1620,0
Converting to forward existential form...Done !
original formula: EG(AG(AF((i2.i1.u27.p464==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!((i2.i1.u27.p464==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.i1.u4.t88, i0.i1.u6.t83, i0.i2.u18.t69, i1.i1.u10.t133, i2.i1.u26.t54, i2.i1.u26.t56, i6.i...340
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local 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
(forward)formula 0,0,7.41242,279844,1,0,310105,12454,3493,2.33477e+06,729,121345,171112
FORMULA CO4-PT-20-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 801/801 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 553 transition count 760
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 553 transition count 760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 553 transition count 758
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 107 place count 526 transition count 730
Iterating global reduction 1 with 27 rules applied. Total rules applied 134 place count 526 transition count 730
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 136 place count 526 transition count 728
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 151 place count 511 transition count 713
Iterating global reduction 2 with 15 rules applied. Total rules applied 166 place count 511 transition count 713
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 170 place count 511 transition count 709
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 177 place count 504 transition count 702
Iterating global reduction 3 with 7 rules applied. Total rules applied 184 place count 504 transition count 702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 185 place count 504 transition count 701
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 188 place count 501 transition count 698
Iterating global reduction 4 with 3 rules applied. Total rules applied 191 place count 501 transition count 698
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 500 transition count 697
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 500 transition count 697
Applied a total of 193 rules in 62 ms. Remains 500 /592 variables (removed 92) and now considering 697/801 (removed 104) transitions.
// Phase 1: matrix 697 rows 500 cols
[2024-06-02 19:40:57] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 19:40:58] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 19:40:58] [INFO ] Invariant cache hit.
[2024-06-02 19:40:58] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2024-06-02 19:40:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (OVERLAPS) 1/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 696 unsolved
[2024-06-02 19:41:13] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-02 19:41:13] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 697/1197 variables, 500/507 constraints. Problems are: Problem set: 0 solved, 696 unsolved
[2024-06-02 19:41:24] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-06-02 19:41:25] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-06-02 19:41:26] [INFO ] Deduced a trap composed of 190 places in 81 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1197/1197 variables, and 510 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (OVERLAPS) 1/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 697/1197 variables, 500/510 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1197 variables, 696/1206 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1197/1197 variables, and 1206 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 5/5 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Starting structural reductions in LTL mode, iteration 1 : 500/592 places, 697/801 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60722 ms. Remains : 500/592 places, 697/801 transitions.
[2024-06-02 19:41:58] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:41:58] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:41:58] [INFO ] Input system was already deterministic with 697 transitions.
[2024-06-02 19:41:58] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:41:58] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:41:58] [INFO ] Time to serialize gal into /tmp/CTLFireability16951790844296098902.gal : 2 ms
[2024-06-02 19:41:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2898528953632337908.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/CTLFireability16951790844296098902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2898528953632337908.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.31848e+12,18.9093,484788,2,36659,5,1.38692e+06,6,0,2691,2.51002e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:42:28] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:42:28] [INFO ] Applying decomposition
[2024-06-02 19:42:28] [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/graph9109066578905964528.txt' '-o' '/tmp/graph9109066578905964528.bin' '-w' '/tmp/graph9109066578905964528.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9109066578905964528.bin' '-l' '-1' '-v' '-w' '/tmp/graph9109066578905964528.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:42:28] [INFO ] Decomposing Gal with order
[2024-06-02 19:42:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:42:28] [INFO ] Removed a total of 429 redundant transitions.
[2024-06-02 19:42:28] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:42:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 4 ms.
[2024-06-02 19:42:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14272227508846297777.gal : 4 ms
[2024-06-02 19:42:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15296734817247182263.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/CTLFireability14272227508846297777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15296734817247182263.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 -...264
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.31848e+12,5.2766,179952,2208,175,222746,8063,1209,1.45184e+06,121,81900,0
Converting to forward existential form...Done !
original formula: (AX(AG(AF((i9.u132.p785==0)))) * E((i6.u33.p289==1) U AF(!(AF((i9.u78.p956==1))))))
=> equivalent forward existential formula: ([FwdG(FwdU(EY(Init),TRUE),!((i9.u132.p785==0)))] = FALSE * [(Init * !(E((i6.u33.p289==1) U !(EG(!(!(!(EG(!((i9....187
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t52, t83, t92, t93, t139, t185, t226, t270, t311, t323, t360, t369, t413, t558, t55...1145
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 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.
[2024-06-02 19:42:58] [INFO ] Flatten gal took : 32 ms
[2024-06-02 19:42:59] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:42:59] [INFO ] Applying decomposition
[2024-06-02 19:42:59] [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/graph1896285790211537440.txt' '-o' '/tmp/graph1896285790211537440.bin' '-w' '/tmp/graph1896285790211537440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1896285790211537440.bin' '-l' '-1' '-v' '-w' '/tmp/graph1896285790211537440.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:42:59] [INFO ] Decomposing Gal with order
[2024-06-02 19:42:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:42:59] [INFO ] Removed a total of 450 redundant transitions.
[2024-06-02 19:42:59] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:42:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 4 ms.
[2024-06-02 19:42:59] [INFO ] Time to serialize gal into /tmp/CTLFireability15810827773726522502.gal : 4 ms
[2024-06-02 19:42:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16820883811150437224.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/CTLFireability15810827773726522502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16820883811150437224.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 -...264
No direction supplied, using forward translation only.
Parsed 10 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,4.97712e+12,38.1981,1206052,6306,260,2.14051e+06,31328,1296,9.01664e+06,134,190203,0
Converting to forward existential form...Done !
original formula: AX(AF(EX((i22.i0.i2.u184.p880==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX((i22.i0.i2.u184.p880==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t37, t38, t125, t126, t187, t188, t249, t255, t269, t271, t272, t320, t346, t366, t381, t...1818
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 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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
ITS-tools command line returned an error code 137
[2024-06-02 20:04:57] [INFO ] Applying decomposition
[2024-06-02 20:04:57] [INFO ] Flatten gal took : 23 ms
[2024-06-02 20:04:57] [INFO ] Decomposing Gal with order
[2024-06-02 20:04:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:04:57] [INFO ] Removed a total of 282 redundant transitions.
[2024-06-02 20:04:57] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:04:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 2 ms.
[2024-06-02 20:04:57] [INFO ] Time to serialize gal into /tmp/CTLFireability10137299310065580607.gal : 4 ms
[2024-06-02 20:04:57] [INFO ] Time to serialize properties into /tmp/CTLFireability6836498349526084706.ctl : 4 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/CTLFireability10137299310065580607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6836498349526084706.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 10 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,4.97712e+12,28.0678,741160,1951,8144,654025,638305,352,3.16492e+06,1770,4.93634e+06,0
Converting to forward existential form...Done !
original formula: AX(AF(EX((i0.i1.i0.i1.u11.p880==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX((i0.i1.i0.i1.u11.p880==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t763, i0.t647, i0.t271, i0.t62, i0.i0.i0.u5.t0, i0.i0.i0.u5.t460, i0.i0.i0.u5.t486, i0.i0.i0....2769
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
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-20"
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-20, 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-171734898700154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-20.tgz
mv CO4-PT-20 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 '
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 ;