fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r070-tall-171620506100546
Last Updated
July 7, 2024

About the Execution of ITS-Tools for CloudDeployment-PT-2b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11202.203 3600000.00 3780295.00 7556.60 F?TF???FFFFF???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.r070-tall-171620506100546.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 CloudDeployment-PT-2b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620506100546
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 166K May 18 16:42 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 CloudDeployment-PT-2b-CTLFireability-2024-00
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2024-01
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2024-02
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2024-03
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2024-04
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2024-05
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2024-06
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2024-07
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2024-08
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2024-09
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2024-10
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2024-11
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2023-12
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2023-13
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2023-14
FORMULA_NAME CloudDeployment-PT-2b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716323547143

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-2b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 20:32:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:32:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:32:28] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-05-21 20:32:28] [INFO ] Transformed 556 places.
[2024-05-21 20:32:28] [INFO ] Transformed 684 transitions.
[2024-05-21 20:32:28] [INFO ] Found NUPN structural information;
[2024-05-21 20:32:28] [INFO ] Parsed PT model containing 556 places and 684 transitions and 1987 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 117 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 684/684 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 554 transition count 684
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 98 place count 458 transition count 588
Iterating global reduction 1 with 96 rules applied. Total rules applied 194 place count 458 transition count 588
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 224 place count 428 transition count 558
Iterating global reduction 1 with 30 rules applied. Total rules applied 254 place count 428 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 255 place count 428 transition count 557
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 257 place count 426 transition count 555
Iterating global reduction 2 with 2 rules applied. Total rules applied 259 place count 426 transition count 555
Applied a total of 259 rules in 115 ms. Remains 426 /556 variables (removed 130) and now considering 555/684 (removed 129) transitions.
// Phase 1: matrix 555 rows 426 cols
[2024-05-21 20:32:28] [INFO ] Computed 7 invariants in 25 ms
[2024-05-21 20:32:29] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-21 20:32:29] [INFO ] Invariant cache hit.
[2024-05-21 20:32:29] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 554 sub problems to find dead transitions.
[2024-05-21 20:32:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 555/980 variables, 425/432 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/980 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/981 variables, 1/433 constraints. Problems are: Problem set: 15 solved, 539 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 0/433 constraints. Problems are: Problem set: 15 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/981 variables, and 433 constraints, problems are : Problem set: 15 solved, 539 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 539 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 15 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/3 constraints. Problems are: Problem set: 15 solved, 539 unsolved
At refinement iteration 2 (OVERLAPS) 4/425 variables, 4/7 constraints. Problems are: Problem set: 15 solved, 539 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/7 constraints. Problems are: Problem set: 15 solved, 539 unsolved
At refinement iteration 4 (OVERLAPS) 555/980 variables, 425/432 constraints. Problems are: Problem set: 15 solved, 539 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/980 variables, 539/971 constraints. Problems are: Problem set: 15 solved, 539 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/980 variables, 0/971 constraints. Problems are: Problem set: 15 solved, 539 unsolved
At refinement iteration 7 (OVERLAPS) 1/981 variables, 1/972 constraints. Problems are: Problem set: 15 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 972 constraints, problems are : Problem set: 15 solved, 539 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 539/554 constraints, Known Traps: 0/0 constraints]
After SMT, in 60318ms problems are : Problem set: 15 solved, 539 unsolved
Search for dead transitions found 15 dead transitions in 60352ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 426/556 places, 540/684 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 423 transition count 540
Applied a total of 3 rules in 8 ms. Remains 423 /426 variables (removed 3) and now considering 540/540 (removed 0) transitions.
// Phase 1: matrix 540 rows 423 cols
[2024-05-21 20:33:29] [INFO ] Computed 8 invariants in 5 ms
[2024-05-21 20:33:29] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 20:33:29] [INFO ] Invariant cache hit.
[2024-05-21 20:33:30] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 423/556 places, 540/684 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61523 ms. Remains : 423/556 places, 540/684 transitions.
Support contains 117 out of 423 places after structural reductions.
[2024-05-21 20:33:30] [INFO ] Flatten gal took : 88 ms
[2024-05-21 20:33:30] [INFO ] Flatten gal took : 37 ms
[2024-05-21 20:33:30] [INFO ] Input system was already deterministic with 540 transitions.
RANDOM walk for 40000 steps (631 resets) in 1369 ms. (29 steps per ms) remains 42/85 properties
BEST_FIRST walk for 4002 steps (12 resets) in 49 ms. (80 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (15 resets) in 40 ms. (97 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (14 resets) in 55 ms. (71 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (15 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (13 resets) in 42 ms. (93 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (14 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (15 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (16 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (14 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (15 resets) in 45 ms. (87 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (11 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (10 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (13 resets) in 26 ms. (148 steps per ms) remains 36/42 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (12 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (12 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (11 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (13 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (13 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (17 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (10 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (13 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (12 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
[2024-05-21 20:33:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 59/124 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 238/362 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 6 (OVERLAPS) 291/653 variables, 128/260 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 0/260 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 185/838 variables, 98/358 constraints. Problems are: Problem set: 3 solved, 31 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/838 variables, 0/358 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 96/934 variables, 50/408 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/934 variables, 0/408 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 25/959 variables, 20/428 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/959 variables, 0/428 constraints. Problems are: Problem set: 3 solved, 31 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp76 is UNSAT
At refinement iteration 14 (OVERLAPS) 4/963 variables, 3/431 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/963 variables, 0/431 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 0/963 variables, 0/431 constraints. Problems are: Problem set: 7 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 963/963 variables, and 431 constraints, problems are : Problem set: 7 solved, 27 unsolved in 3502 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 63/104 variables, 5/5 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 204/308 variables, 104/109 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 4/113 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/113 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 252/560 variables, 110/223 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 3/226 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 23/249 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 0/249 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 202/762 variables, 98/347 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/347 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 139/901 variables, 68/415 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/901 variables, 0/415 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 47/948 variables, 34/449 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/948 variables, 0/449 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 11/959 variables, 6/455 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/959 variables, 0/455 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 18 (OVERLAPS) 4/963 variables, 3/458 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/963 variables, 0/458 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 20 (OVERLAPS) 0/963 variables, 0/458 constraints. Problems are: Problem set: 7 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 963/963 variables, and 458 constraints, problems are : Problem set: 7 solved, 27 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 27/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 8549ms problems are : Problem set: 7 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 540/540 transitions.
Graph (trivial) has 371 edges and 423 vertex of which 88 / 423 are part of one of the 8 SCC in 5 ms
Free SCC test removed 80 places
Drop transitions (Empty/Sink Transition effects.) removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Graph (complete) has 837 edges and 343 vertex of which 333 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 333 transition count 311
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 125 rules applied. Total rules applied 254 place count 210 transition count 309
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 265 place count 209 transition count 299
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 275 place count 199 transition count 299
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 275 place count 199 transition count 278
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 317 place count 178 transition count 278
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 326 place count 169 transition count 269
Iterating global reduction 4 with 9 rules applied. Total rules applied 335 place count 169 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 336 place count 169 transition count 268
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 336 place count 169 transition count 265
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 342 place count 166 transition count 265
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 416 place count 129 transition count 227
Performed 17 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 450 place count 112 transition count 308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 455 place count 112 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 457 place count 111 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 497 place count 111 transition count 277
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 505 place count 111 transition count 269
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 515 place count 103 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 518 place count 103 transition count 264
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 521 place count 103 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 522 place count 103 transition count 263
Applied a total of 522 rules in 109 ms. Remains 103 /423 variables (removed 320) and now considering 263/540 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 103/423 places, 263/540 transitions.
RANDOM walk for 40000 steps (1591 resets) in 632 ms. (63 steps per ms) remains 15/27 properties
BEST_FIRST walk for 4004 steps (23 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (22 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (22 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (22 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (22 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (21 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (17 resets) in 7 ms. (500 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (21 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (21 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (23 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (21 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (24 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
[2024-05-21 20:33:40] [INFO ] Flow matrix only has 247 transitions (discarded 16 similar events)
// Phase 1: matrix 247 rows 103 cols
[2024-05-21 20:33:40] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 20:33:40] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 50/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 10/87 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 20:33:40] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 242/329 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 20/349 variables, 15/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 1/350 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/350 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 134 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1147 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 50/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 10/87 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 242/329 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 20/349 variables, 15/119 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 9/148 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 1/350 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 20:33:42] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-05-21 20:33:42] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/350 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/350 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/350 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 151 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 3/3 constraints]
After SMT, in 2645ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 10 properties in 1759 ms.
Support contains 14 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 263/263 transitions.
Graph (trivial) has 72 edges and 103 vertex of which 14 / 103 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 96 transition count 240
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 87 transition count 238
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 85 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 24 place count 85 transition count 235
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 83 transition count 235
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 82 transition count 234
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 82 transition count 234
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 42 place count 76 transition count 228
Performed 5 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 52 place count 71 transition count 252
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 81 place count 71 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 4 with 43 rules applied. Total rules applied 124 place count 71 transition count 180
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 128 place count 71 transition count 176
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 136 place count 67 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 142 place count 67 transition count 166
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 66 transition count 163
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 66 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 65 transition count 162
Applied a total of 145 rules in 40 ms. Remains 65 /103 variables (removed 38) and now considering 162/263 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 65/103 places, 162/263 transitions.
RANDOM walk for 40000 steps (1896 resets) in 354 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (274 resets) in 27 ms. (1428 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (270 resets) in 25 ms. (1538 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (269 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (268 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (278 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1370713 steps, run timeout after 3001 ms. (steps per millisecond=456 ) properties seen :2 out of 5
Probabilistic random walk after 1370713 steps, saw 218406 distinct states, run finished after 3006 ms. (steps per millisecond=455 ) properties seen :2
[2024-05-21 20:33:47] [INFO ] Flow matrix only has 140 transitions (discarded 22 similar events)
// Phase 1: matrix 140 rows 65 cols
[2024-05-21 20:33:47] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 20:33:47] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 100/136 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 62/198 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/199 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/205 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/205 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 75 constraints, problems are : Problem set: 0 solved, 3 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 100/136 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 62/198 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/199 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/205 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/205 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 78 constraints, problems are : Problem set: 0 solved, 3 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 21 ms.
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 162/162 transitions.
Graph (trivial) has 38 edges and 65 vertex of which 4 / 65 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 62 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 62 transition count 153
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 59 transition count 150
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 0 with 2 rules applied. Total rules applied 11 place count 58 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 31 place count 58 transition count 131
Free-agglomeration rule applied 12 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 43 place count 58 transition count 117
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 219 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 23 rules applied. Total rules applied 66 place count 45 transition count 107
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 45 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 79 place count 45 transition count 94
Applied a total of 79 rules in 17 ms. Remains 45 /65 variables (removed 20) and now considering 94/162 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 45/65 places, 94/162 transitions.
RANDOM walk for 16431 steps (407 resets) in 144 ms. (113 steps per ms) remains 0/1 properties
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA CloudDeployment-PT-2b-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:33:48] [INFO ] Flatten gal took : 26 ms
[2024-05-21 20:33:48] [INFO ] Flatten gal took : 31 ms
[2024-05-21 20:33:48] [INFO ] Input system was already deterministic with 540 transitions.
Computed a total of 76 stabilizing places and 125 stable transitions
Graph (complete) has 939 edges and 423 vertex of which 413 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 417 transition count 540
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 37 place count 386 transition count 509
Iterating global reduction 1 with 31 rules applied. Total rules applied 68 place count 386 transition count 509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 386 transition count 508
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 78 place count 377 transition count 499
Iterating global reduction 2 with 9 rules applied. Total rules applied 87 place count 377 transition count 499
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 375 transition count 497
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 375 transition count 497
Applied a total of 91 rules in 63 ms. Remains 375 /423 variables (removed 48) and now considering 497/540 (removed 43) transitions.
// Phase 1: matrix 497 rows 375 cols
[2024-05-21 20:33:48] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:33:48] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-21 20:33:48] [INFO ] Invariant cache hit.
[2024-05-21 20:33:49] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-21 20:33:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 497/871 variables, 374/376 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/871 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (OVERLAPS) 1/872 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/872 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 0/872 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 496 unsolved
No progress, stopping.
After SMT solving in domain Real declared 872/872 variables, and 377 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 497/871 variables, 374/376 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/871 variables, 496/872 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (OVERLAPS) 1/872 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 872/872 variables, and 873 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 0/0 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 375/423 places, 497/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60891 ms. Remains : 375/423 places, 497/540 transitions.
[2024-05-21 20:34:49] [INFO ] Flatten gal took : 24 ms
[2024-05-21 20:34:49] [INFO ] Flatten gal took : 20 ms
[2024-05-21 20:34:49] [INFO ] Input system was already deterministic with 497 transitions.
[2024-05-21 20:34:49] [INFO ] Flatten gal took : 20 ms
[2024-05-21 20:34:49] [INFO ] Flatten gal took : 19 ms
[2024-05-21 20:34:49] [INFO ] Time to serialize gal into /tmp/CTLFireability17089138645839960539.gal : 10 ms
[2024-05-21 20:34:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10006206387141833748.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17089138645839960539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10006206387141833748.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.15e+10,1.69004,57524,2,9749,5,163082,6,0,1994,260350,0


Converting to forward existential form...Done !
original formula: A((A(AG((p63==1)) U !(AG((p35==1)))) + (!(EF(EX((p257==1)))) * (EG((p140==1)) + (AG((p384!=1)) * (p412==1))))) U AF(AG(EF(EG((p495==1))))...157
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(E(TRUE U !(E(TRUE U EG((p495==1))))))))))))) * !(E(!(!(EG(!(!(E(TRUE U !(E(TRUE U EG((...481
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t22, t26, t28, t83, t97, t98, t103, t125, t131, t160, t161, t162, t169, t171, t17...654
Detected timeout of ITS tools.
[2024-05-21 20:35:19] [INFO ] Flatten gal took : 17 ms
[2024-05-21 20:35:19] [INFO ] Applying decomposition
[2024-05-21 20:35:19] [INFO ] Flatten gal took : 16 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/graph12036842097420280101.txt' '-o' '/tmp/graph12036842097420280101.bin' '-w' '/tmp/graph12036842097420280101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12036842097420280101.bin' '-l' '-1' '-v' '-w' '/tmp/graph12036842097420280101.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:35:19] [INFO ] Decomposing Gal with order
[2024-05-21 20:35:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:35:19] [INFO ] Removed a total of 324 redundant transitions.
[2024-05-21 20:35:19] [INFO ] Flatten gal took : 62 ms
[2024-05-21 20:35:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 11 ms.
[2024-05-21 20:35:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16539035377494245907.gal : 7 ms
[2024-05-21 20:35:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1333776144934815030.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/CTLFireability16539035377494245907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1333776144934815030.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.15e+10,0.20829,11232,1040,70,13923,639,834,22977,78,1913,0


Converting to forward existential form...Done !
original formula: A((A(AG((i5.u12.p63==1)) U !(AG((i16.u5.p35==1)))) + (!(EF(EX((i7.u70.p257==1)))) * (EG((i3.u38.p140==1)) + (AG((i10.u104.p384!=1)) * (i1...211
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(E(TRUE U !(E(TRUE U EG((i13.u129.p495==1))))))))))))) * !(E(!(!(EG(!(!(E(TRUE U !(E(TR...567
Reverse transition relation is NOT exact ! Due to transitions t160, t179, t349, t369, t397, t399, t400, t401, t402, t403, t404, t405, t406, t410, t411, t41...817
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 417 transition count 540
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 38 place count 385 transition count 508
Iterating global reduction 1 with 32 rules applied. Total rules applied 70 place count 385 transition count 508
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 385 transition count 507
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 376 transition count 498
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 376 transition count 498
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 374 transition count 496
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 374 transition count 496
Applied a total of 93 rules in 39 ms. Remains 374 /423 variables (removed 49) and now considering 496/540 (removed 44) transitions.
// Phase 1: matrix 496 rows 374 cols
[2024-05-21 20:35:50] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 20:35:50] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-21 20:35:50] [INFO ] Invariant cache hit.
[2024-05-21 20:35:50] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 495 sub problems to find dead transitions.
[2024-05-21 20:35:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 496/869 variables, 373/375 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/869 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 4 (OVERLAPS) 1/870 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/870 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/870 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 495 unsolved
No progress, stopping.
After SMT solving in domain Real declared 870/870 variables, and 376 constraints, problems are : Problem set: 0 solved, 495 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 374/374 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 495 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 496/869 variables, 373/375 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/869 variables, 495/870 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 5 (OVERLAPS) 1/870 variables, 1/871 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 870/870 variables, and 871 constraints, problems are : Problem set: 0 solved, 495 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 374/374 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 0/0 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 495 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Starting structural reductions in LTL mode, iteration 1 : 374/423 places, 496/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60764 ms. Remains : 374/423 places, 496/540 transitions.
[2024-05-21 20:36:50] [INFO ] Flatten gal took : 18 ms
[2024-05-21 20:36:50] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:36:50] [INFO ] Input system was already deterministic with 496 transitions.
[2024-05-21 20:36:50] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:36:50] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:36:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16662615354237667858.gal : 3 ms
[2024-05-21 20:36:50] [INFO ] Time to serialize properties into /tmp/CTLFireability12740489549062534733.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/CTLFireability16662615354237667858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12740489549062534733.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.15168e+10,1.68418,57196,2,10200,5,164900,6,0,1989,255131,0


Converting to forward existential form...Done !
original formula: A(!((((p221==1) * (AX((p30!=1)) + E(AG((p162==1)) U (p156!=1)))) + EF((((p383==1)&&(p217!=1))&&(p243!=1))))) U EG(EX(AF(((p330==1)||(p459...164
=> equivalent forward existential formula: [((Init * !(EG(!(EG(EX(!(EG(!(((p330==1)||(p459==1))))))))))) * !(E(!(EG(EX(!(EG(!(((p330==1)||(p459==1)))))))) ...351
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t22, t26, t28, t83, t97, t98, t103, t124, t130, t159, t160, t161, t169, t172, t17...648
Detected timeout of ITS tools.
[2024-05-21 20:37:20] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:37:20] [INFO ] Applying decomposition
[2024-05-21 20:37: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/graph7523186877931669310.txt' '-o' '/tmp/graph7523186877931669310.bin' '-w' '/tmp/graph7523186877931669310.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7523186877931669310.bin' '-l' '-1' '-v' '-w' '/tmp/graph7523186877931669310.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:37:21] [INFO ] Decomposing Gal with order
[2024-05-21 20:37:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:37:21] [INFO ] Removed a total of 315 redundant transitions.
[2024-05-21 20:37:21] [INFO ] Flatten gal took : 23 ms
[2024-05-21 20:37:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 7 ms.
[2024-05-21 20:37:21] [INFO ] Time to serialize gal into /tmp/CTLFireability8711413870078092941.gal : 4 ms
[2024-05-21 20:37:21] [INFO ] Time to serialize properties into /tmp/CTLFireability14668931615128740974.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/CTLFireability8711413870078092941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14668931615128740974.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.15168e+10,0.177791,10716,980,79,13524,973,815,19354,88,2693,0


Converting to forward existential form...Done !
original formula: A(!((((i5.i0.i1.u55.p221==1) * (AX((i0.u10.p30!=1)) + E(AG((i3.u12.p162==1)) U (i3.u37.p156!=1)))) + EF((((i9.u94.p383==1)&&(i5.i0.i2.u53...243
=> equivalent forward existential formula: [((Init * !(EG(!(EG(EX(!(EG(!(((i10.u107.p330==1)||(i11.u108.p459==1))))))))))) * !(E(!(EG(EX(!(EG(!(((i10.u107....466
Reverse transition relation is NOT exact ! Due to transitions t103, t130, t159, t160, t179, t293, t320, t349, t369, t396, t398, t400, t402, t403, t404, t40...777
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Graph (trivial) has 436 edges and 423 vertex of which 149 / 423 are part of one of the 16 SCC in 1 ms
Free SCC test removed 133 places
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Graph (complete) has 781 edges and 290 vertex of which 280 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 279 transition count 256
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 264 place count 148 transition count 256
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 264 place count 148 transition count 241
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 294 place count 133 transition count 241
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 305 place count 122 transition count 230
Iterating global reduction 2 with 11 rules applied. Total rules applied 316 place count 122 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 317 place count 122 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 317 place count 122 transition count 228
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 319 place count 121 transition count 228
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 389 place count 86 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 397 place count 86 transition count 185
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 3 with 4 rules applied. Total rules applied 401 place count 86 transition count 181
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 405 place count 82 transition count 181
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 5 with 4 rules applied. Total rules applied 409 place count 80 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 410 place count 79 transition count 178
Applied a total of 410 rules in 52 ms. Remains 79 /423 variables (removed 344) and now considering 178/540 (removed 362) transitions.
[2024-05-21 20:37:51] [INFO ] Flow matrix only has 147 transitions (discarded 31 similar events)
// Phase 1: matrix 147 rows 79 cols
[2024-05-21 20:37:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:37:51] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 20:37:51] [INFO ] Flow matrix only has 147 transitions (discarded 31 similar events)
[2024-05-21 20:37:51] [INFO ] Invariant cache hit.
[2024-05-21 20:37:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 20:37:51] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-05-21 20:37:51] [INFO ] Redundant transitions in 103 ms returned []
Running 161 sub problems to find dead transitions.
[2024-05-21 20:37:51] [INFO ] Flow matrix only has 147 transitions (discarded 31 similar events)
[2024-05-21 20:37:51] [INFO ] Invariant cache hit.
[2024-05-21 20:37:51] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 146/223 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 2/225 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/226 variables, and 85 constraints, problems are : Problem set: 0 solved, 161 unsolved in 2995 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 146/223 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 2/225 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 141/246 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/226 variables, and 246 constraints, problems are : Problem set: 0 solved, 161 unsolved in 4234 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 7314ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 7317ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/423 places, 178/540 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7769 ms. Remains : 79/423 places, 178/540 transitions.
[2024-05-21 20:37:58] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:37:58] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:37:58] [INFO ] Input system was already deterministic with 178 transitions.
[2024-05-21 20:37:58] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:37:58] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:37:58] [INFO ] Time to serialize gal into /tmp/CTLFireability16402978270916051092.gal : 2 ms
[2024-05-21 20:37:58] [INFO ] Time to serialize properties into /tmp/CTLFireability7335674696473674343.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/CTLFireability16402978270916051092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7335674696473674343.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.04542e+06,0.048755,5316,2,570,5,6024,6,0,470,6130,0


Converting to forward existential form...Done !
original formula: EF(EG((p193==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p193==1))] != FALSE
Hit Full ! (commute/partial/dont) 176/0/2
(forward)formula 0,1,0.144003,9012,1,0,8,29519,19,2,2911,15099,8
FORMULA CloudDeployment-PT-2b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 417 transition count 540
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 37 place count 386 transition count 509
Iterating global reduction 1 with 31 rules applied. Total rules applied 68 place count 386 transition count 509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 386 transition count 508
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 376 transition count 498
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 376 transition count 498
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 375 transition count 497
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 375 transition count 497
Applied a total of 91 rules in 19 ms. Remains 375 /423 variables (removed 48) and now considering 497/540 (removed 43) transitions.
// Phase 1: matrix 497 rows 375 cols
[2024-05-21 20:37:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:37:59] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 20:37:59] [INFO ] Invariant cache hit.
[2024-05-21 20:37:59] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-21 20:37:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 497/871 variables, 374/376 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/871 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (OVERLAPS) 1/872 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/872 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 0/872 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 496 unsolved
No progress, stopping.
After SMT solving in domain Real declared 872/872 variables, and 377 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 497/871 variables, 374/376 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/871 variables, 496/872 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (OVERLAPS) 1/872 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 872/872 variables, and 873 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 375/423 places, 497/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60613 ms. Remains : 375/423 places, 497/540 transitions.
[2024-05-21 20:38:59] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:38:59] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:38:59] [INFO ] Input system was already deterministic with 497 transitions.
[2024-05-21 20:38:59] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:38:59] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:38:59] [INFO ] Time to serialize gal into /tmp/CTLFireability10881634217622992387.gal : 2 ms
[2024-05-21 20:38:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16309334779176469744.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/CTLFireability10881634217622992387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16309334779176469744.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.1572e+10,1.96409,64844,2,11389,5,191955,6,0,1994,291238,0


Converting to forward existential form...Done !
original formula: (AG(((p162==0) * (((EF((p266==1)) + EX((p493==0))) * (p422==1)) + E((p333!=1) U EG((p547==1)))))) + AG((((!(E((p83==1) U (p368==1))) * !(...238
=> equivalent forward existential formula: ((([(FwdU(FwdU((Init * !(!(E(TRUE U !(((p162==0) * (((E(TRUE U (p266==1)) + EX((p493==0))) * (p422==1)) + E((p33...978
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t22, t26, t28, t84, t98, t99, t105, t127, t133, t162, t163, t164, t165, t167, t17...654
(forward)formula 0,0,29.3439,767796,1,0,830,3.51349e+06,1032,484,13713,3.39853e+06,1206
FORMULA CloudDeployment-PT-2b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 417 transition count 540
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 40 place count 383 transition count 506
Iterating global reduction 1 with 34 rules applied. Total rules applied 74 place count 383 transition count 506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 383 transition count 505
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 84 place count 374 transition count 496
Iterating global reduction 2 with 9 rules applied. Total rules applied 93 place count 374 transition count 496
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 373 transition count 495
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 373 transition count 495
Applied a total of 95 rules in 16 ms. Remains 373 /423 variables (removed 50) and now considering 495/540 (removed 45) transitions.
// Phase 1: matrix 495 rows 373 cols
[2024-05-21 20:39:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:39:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 20:39:29] [INFO ] Invariant cache hit.
[2024-05-21 20:39:29] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 494 sub problems to find dead transitions.
[2024-05-21 20:39:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 495/867 variables, 372/374 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/867 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (OVERLAPS) 1/868 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/868 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 6 (OVERLAPS) 0/868 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 494 unsolved
No progress, stopping.
After SMT solving in domain Real declared 868/868 variables, and 375 constraints, problems are : Problem set: 0 solved, 494 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 494/494 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 494 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 495/867 variables, 372/374 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/867 variables, 494/868 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/867 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (OVERLAPS) 1/868 variables, 1/869 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/868 variables, and 869 constraints, problems are : Problem set: 0 solved, 494 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 494/494 constraints, Known Traps: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 494 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 373/423 places, 495/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60488 ms. Remains : 373/423 places, 495/540 transitions.
[2024-05-21 20:40:30] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:40:30] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:40:30] [INFO ] Input system was already deterministic with 495 transitions.
[2024-05-21 20:40:30] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:40:30] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:40:30] [INFO ] Time to serialize gal into /tmp/CTLFireability16151126826175205848.gal : 2 ms
[2024-05-21 20:40:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12054146754085805552.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/CTLFireability16151126826175205848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12054146754085805552.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.1494e+10,1.70867,57116,2,9844,5,165789,6,0,1984,250365,0


Converting to forward existential form...Done !
original formula: EF((AX((AF(((((p28==1)&&(p57==1))&&((p215==1)&&(p543==1)))&&(p552==1))) * (p51==1))) * (p386==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p386==1)) * !(EX(!((!(EG(!(((((p28==1)&&(p57==1))&&((p215==1)&&(p543==1)))&&(p552==1))))) ...180
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t22, t26, t28, t83, t97, t98, t103, t127, t133, t162, t163, t164, t171, t173, t17...648
Detected timeout of ITS tools.
[2024-05-21 20:41:00] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:41:00] [INFO ] Applying decomposition
[2024-05-21 20:41:00] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7940285367457669731.txt' '-o' '/tmp/graph7940285367457669731.bin' '-w' '/tmp/graph7940285367457669731.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7940285367457669731.bin' '-l' '-1' '-v' '-w' '/tmp/graph7940285367457669731.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:41:00] [INFO ] Decomposing Gal with order
[2024-05-21 20:41:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:41:00] [INFO ] Removed a total of 314 redundant transitions.
[2024-05-21 20:41:00] [INFO ] Flatten gal took : 21 ms
[2024-05-21 20:41:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-21 20:41:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17904626648780309457.gal : 4 ms
[2024-05-21 20:41:00] [INFO ] Time to serialize properties into /tmp/CTLFireability15980463080349907345.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/CTLFireability17904626648780309457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15980463080349907345.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.1494e+10,0.170881,10324,862,122,12531,892,799,18349,92,2343,0


Converting to forward existential form...Done !
original formula: EF((AX((AF(((((i15.u3.p28==1)&&(i0.u10.p57==1))&&((i5.u53.p215==1)&&(i15.u139.p543==1)))&&(i15.u139.p552==1))) * (i0.u6.p51==1))) * (i9.u...168
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (i9.u95.p386==1)) * !(EX(!((!(EG(!(((((i15.u3.p28==1)&&(i0.u10.p57==1))&&((i5.u53.p215==1)&...232
Reverse transition relation is NOT exact ! Due to transitions t162, t163, t173, t181, t349, t369, t395, t397, t398, t399, t400, t402, t403, t404, t406, t40...794
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 417 transition count 540
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 39 place count 384 transition count 507
Iterating global reduction 1 with 33 rules applied. Total rules applied 72 place count 384 transition count 507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 384 transition count 506
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 83 place count 374 transition count 496
Iterating global reduction 2 with 10 rules applied. Total rules applied 93 place count 374 transition count 496
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 372 transition count 494
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 372 transition count 494
Applied a total of 97 rules in 26 ms. Remains 372 /423 variables (removed 51) and now considering 494/540 (removed 46) transitions.
// Phase 1: matrix 494 rows 372 cols
[2024-05-21 20:41:30] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 20:41:30] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 20:41:30] [INFO ] Invariant cache hit.
[2024-05-21 20:41:30] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 493 sub problems to find dead transitions.
[2024-05-21 20:41:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (OVERLAPS) 494/865 variables, 371/373 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/865 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 4 (OVERLAPS) 1/866 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/866 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 6 (OVERLAPS) 0/866 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 493 unsolved
No progress, stopping.
After SMT solving in domain Real declared 866/866 variables, and 374 constraints, problems are : Problem set: 0 solved, 493 unsolved in 30008 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 493 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (OVERLAPS) 494/865 variables, 371/373 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/865 variables, 493/866 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/865 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 5 (OVERLAPS) 1/866 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 493 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/866 variables, and 867 constraints, problems are : Problem set: 0 solved, 493 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 493 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LTL mode, iteration 1 : 372/423 places, 494/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60476 ms. Remains : 372/423 places, 494/540 transitions.
[2024-05-21 20:42:30] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:42:30] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:42:30] [INFO ] Input system was already deterministic with 494 transitions.
[2024-05-21 20:42:30] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:42:30] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:42:30] [INFO ] Time to serialize gal into /tmp/CTLFireability6266331240114433042.gal : 2 ms
[2024-05-21 20:42:30] [INFO ] Time to serialize properties into /tmp/CTLFireability1081597765284657603.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/CTLFireability6266331240114433042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1081597765284657603.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.14176e+10,3.29883,103920,2,13361,5,320370,6,0,1979,511223,0


Converting to forward existential form...Done !
original formula: EF((((AX((EF((p474==1)) * AG((p191==0)))) + (p393==1)) + (p152==1)) * (AG((p499==1)) + EG(((((p291==0)||(p320==0))||((p504==0)||(p543==0)...173
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((!(EX(!((E(TRUE U (p474==1)) * !(E(TRUE U !((p191==0)))))))) + (p393==1)) + (p152==1))) *...382
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t22, t26, t28, t84, t98, t99, t104, t126, t132, t161, t162, t163, t170, t172, t17...648
Detected timeout of ITS tools.
[2024-05-21 20:43:00] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:43:00] [INFO ] Applying decomposition
[2024-05-21 20:43:01] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17936422784902222643.txt' '-o' '/tmp/graph17936422784902222643.bin' '-w' '/tmp/graph17936422784902222643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17936422784902222643.bin' '-l' '-1' '-v' '-w' '/tmp/graph17936422784902222643.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:43:01] [INFO ] Decomposing Gal with order
[2024-05-21 20:43:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:43:01] [INFO ] Removed a total of 313 redundant transitions.
[2024-05-21 20:43:01] [INFO ] Flatten gal took : 19 ms
[2024-05-21 20:43:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2024-05-21 20:43:01] [INFO ] Time to serialize gal into /tmp/CTLFireability10993700145851838307.gal : 3 ms
[2024-05-21 20:43:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3720881242737421632.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/CTLFireability10993700145851838307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3720881242737421632.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.14176e+10,0.249717,13772,886,72,17972,988,801,40841,84,3046,0


Converting to forward existential form...Done !
original formula: EF((((AX((EF((i13.i0.i1.u123.p474==1)) * AG((i6.u45.p191==0)))) + (i10.u103.p393==1)) + (i4.u37.p152==1)) * (AG((i13.i1.i1.u129.p499==1))...265
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((!(EX(!((E(TRUE U (i13.i0.i1.u123.p474==1)) * !(E(TRUE U !((i6.u45.p191==0)))))))) + (i10...512
Reverse transition relation is NOT exact ! Due to transitions t104, t132, t161, t162, t172, t180, t319, t348, t358, t368, t394, t420, t421, t422, t423, t42...743
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 417 transition count 540
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 38 place count 385 transition count 508
Iterating global reduction 1 with 32 rules applied. Total rules applied 70 place count 385 transition count 508
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 385 transition count 507
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 79 place count 377 transition count 499
Iterating global reduction 2 with 8 rules applied. Total rules applied 87 place count 377 transition count 499
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 375 transition count 497
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 375 transition count 497
Applied a total of 91 rules in 24 ms. Remains 375 /423 variables (removed 48) and now considering 497/540 (removed 43) transitions.
// Phase 1: matrix 497 rows 375 cols
[2024-05-21 20:43:31] [INFO ] Computed 2 invariants in 7 ms
[2024-05-21 20:43:31] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 20:43:31] [INFO ] Invariant cache hit.
[2024-05-21 20:43:31] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-21 20:43:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 497/871 variables, 374/376 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/871 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (OVERLAPS) 1/872 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/872 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 496 unsolved
(s41 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 1.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 1.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 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0timeout
)
(s42 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/872 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 496 unsolved
No progress, stopping.
After SMT solving in domain Real declared 872/872 variables, and 377 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 497/871 variables, 374/376 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/871 variables, 496/872 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (OVERLAPS) 1/872 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 872/872 variables, and 873 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 375/423 places, 497/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60538 ms. Remains : 375/423 places, 497/540 transitions.
[2024-05-21 20:44:31] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:44:31] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:44:31] [INFO ] Input system was already deterministic with 497 transitions.
[2024-05-21 20:44:31] [INFO ] Flatten gal took : 23 ms
[2024-05-21 20:44:31] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:44:31] [INFO ] Time to serialize gal into /tmp/CTLFireability2741856976875947954.gal : 2 ms
[2024-05-21 20:44:31] [INFO ] Time to serialize properties into /tmp/CTLFireability16058194888830519756.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/CTLFireability2741856976875947954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16058194888830519756.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.41351e+10,2.0153,66936,2,10988,5,196145,6,0,1994,302440,0


Converting to forward existential form...Done !
original formula: A((EF((p38==1)) * AF((((EG(E((p28==1) U (p398==1))) * (p291==1)) * ((p320==1)&&(p449==1))) * ((p543==1)&&(p552==1))))) U A((!((((p370!=1)...258
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((!(E(TRUE U ((p291==1)&&(p375==1)))) + !(E(TRUE U !(!(!(EX(!((p14==1)))))))))) U (!((!((...1222
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t22, t26, t28, t83, t97, t98, t103, t124, t130, t143, t161, t162, t163, t170, t17...552
Detected timeout of ITS tools.
[2024-05-21 20:45:01] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:45:01] [INFO ] Applying decomposition
[2024-05-21 20:45:01] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13681443207583356521.txt' '-o' '/tmp/graph13681443207583356521.bin' '-w' '/tmp/graph13681443207583356521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13681443207583356521.bin' '-l' '-1' '-v' '-w' '/tmp/graph13681443207583356521.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:45:01] [INFO ] Decomposing Gal with order
[2024-05-21 20:45:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:45:01] [INFO ] Removed a total of 279 redundant transitions.
[2024-05-21 20:45:01] [INFO ] Flatten gal took : 20 ms
[2024-05-21 20:45:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2024-05-21 20:45:01] [INFO ] Time to serialize gal into /tmp/CTLFireability14879882777828888667.gal : 9 ms
[2024-05-21 20:45:01] [INFO ] Time to serialize properties into /tmp/CTLFireability7452229451879306992.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/CTLFireability14879882777828888667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7452229451879306992.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.41351e+10,0.368225,17524,759,418,16698,17003,809,28638,119,83402,0


Converting to forward existential form...Done !
original formula: A((EF((i1.u4.p38==1)) * AF((((EG(E((i16.u134.p28==1) U (i12.u97.p398==1))) * (i16.u66.p291==1)) * ((i9.u68.p320==1)&&(i14.u111.p449==1)))...381
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((!(E(TRUE U ((i16.u66.p291==1)&&(i10.u90.p375==1)))) + !(E(TRUE U !(!(!(EX(!((i16.u2.p14...1599
Reverse transition relation is NOT exact ! Due to transitions t161, t162, t180, t292, t319, t348, t368, t397, t435, t437, t438, t440, t442, t444, t446, t46...782
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Graph (trivial) has 437 edges and 423 vertex of which 154 / 423 are part of one of the 16 SCC in 2 ms
Free SCC test removed 138 places
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Graph (complete) has 775 edges and 285 vertex of which 275 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 274 transition count 252
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 1 with 129 rules applied. Total rules applied 260 place count 145 transition count 252
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 260 place count 145 transition count 238
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 288 place count 131 transition count 238
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 299 place count 120 transition count 227
Iterating global reduction 2 with 11 rules applied. Total rules applied 310 place count 120 transition count 227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 310 place count 120 transition count 226
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 312 place count 119 transition count 226
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 380 place count 85 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 388 place count 85 transition count 184
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 2 with 4 rules applied. Total rules applied 392 place count 85 transition count 180
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 396 place count 81 transition count 180
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 4 with 4 rules applied. Total rules applied 400 place count 79 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 401 place count 78 transition count 177
Applied a total of 401 rules in 55 ms. Remains 78 /423 variables (removed 345) and now considering 177/540 (removed 363) transitions.
[2024-05-21 20:45:32] [INFO ] Flow matrix only has 146 transitions (discarded 31 similar events)
// Phase 1: matrix 146 rows 78 cols
[2024-05-21 20:45:32] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:45:32] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 20:45:32] [INFO ] Flow matrix only has 146 transitions (discarded 31 similar events)
[2024-05-21 20:45:32] [INFO ] Invariant cache hit.
[2024-05-21 20:45:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 20:45:32] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-21 20:45:32] [INFO ] Redundant transitions in 91 ms returned []
Running 160 sub problems to find dead transitions.
[2024-05-21 20:45:32] [INFO ] Flow matrix only has 146 transitions (discarded 31 similar events)
[2024-05-21 20:45:32] [INFO ] Invariant cache hit.
[2024-05-21 20:45:32] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 145/221 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 2/223 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/224 variables, and 84 constraints, problems are : Problem set: 0 solved, 160 unsolved in 2993 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 145/221 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 16/98 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 2/223 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 144/244 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/224 variables, and 244 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4197 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 7265ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 7266ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/423 places, 177/540 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7738 ms. Remains : 78/423 places, 177/540 transitions.
[2024-05-21 20:45:39] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:45:39] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:45:39] [INFO ] Input system was already deterministic with 177 transitions.
RANDOM walk for 668 steps (62 resets) in 9 ms. (66 steps per ms) remains 0/1 properties
FORMULA CloudDeployment-PT-2b-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 20:45:39] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:45:39] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:45:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18332029720177691929.gal : 1 ms
[2024-05-21 20:45:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6145969048974255936.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18332029720177691929.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6145969048974255936.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 417 transition count 540
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 41 place count 382 transition count 505
Iterating global reduction 1 with 35 rules applied. Total rules applied 76 place count 382 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 382 transition count 504
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 87 place count 372 transition count 494
Iterating global reduction 2 with 10 rules applied. Total rules applied 97 place count 372 transition count 494
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 370 transition count 492
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 370 transition count 492
Applied a total of 101 rules in 16 ms. Remains 370 /423 variables (removed 53) and now considering 492/540 (removed 48) transitions.
// Phase 1: matrix 492 rows 370 cols
[2024-05-21 20:45:39] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 20:45:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 20:45:39] [INFO ] Invariant cache hit.
[2024-05-21 20:45:40] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 491 sub problems to find dead transitions.
[2024-05-21 20:45:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (OVERLAPS) 492/861 variables, 369/371 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/861 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (OVERLAPS) 1/862 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/862 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 6 (OVERLAPS) 0/862 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 491 unsolved
No progress, stopping.
After SMT solving in domain Real declared 862/862 variables, and 372 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30010 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 491 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (OVERLAPS) 492/861 variables, 369/371 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/861 variables, 491/862 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/861 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 5 (OVERLAPS) 1/862 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 491 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 862/862 variables, and 863 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 491 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 370/423 places, 492/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60489 ms. Remains : 370/423 places, 492/540 transitions.
[2024-05-21 20:46:40] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:46:40] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:46:40] [INFO ] Input system was already deterministic with 492 transitions.
[2024-05-21 20:46:40] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:46:40] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:46:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12635737383299380557.gal : 2 ms
[2024-05-21 20:46:40] [INFO ] Time to serialize properties into /tmp/CTLFireability18221596363966420553.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/CTLFireability12635737383299380557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18221596363966420553.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.12646e+10,1.85849,62120,2,10517,5,180168,6,0,1969,280453,0


Converting to forward existential form...Done !
original formula: AF(EX(EX((p264==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EX((p264==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t22, t26, t28, t83, t97, t98, t103, t124, t130, t159, t160, t161, t168, t170, t17...648
Detected timeout of ITS tools.
[2024-05-21 20:47:10] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:47:10] [INFO ] Applying decomposition
[2024-05-21 20:47:10] [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/graph3368895442743486164.txt' '-o' '/tmp/graph3368895442743486164.bin' '-w' '/tmp/graph3368895442743486164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3368895442743486164.bin' '-l' '-1' '-v' '-w' '/tmp/graph3368895442743486164.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:47:10] [INFO ] Decomposing Gal with order
[2024-05-21 20:47:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:47:10] [INFO ] Removed a total of 312 redundant transitions.
[2024-05-21 20:47:10] [INFO ] Flatten gal took : 18 ms
[2024-05-21 20:47:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2024-05-21 20:47:10] [INFO ] Time to serialize gal into /tmp/CTLFireability14339658593987506290.gal : 4 ms
[2024-05-21 20:47:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14980786282332446209.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/CTLFireability14339658593987506290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14980786282332446209.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.12646e+10,0.293821,16696,1202,73,24419,700,945,60714,82,2278,0


Converting to forward existential form...Done !
original formula: AF(EX(EX((i8.i1.u68.p264==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EX((i8.i1.u68.p264==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t103, t130, t159, t178, t285, t317, t346, t347, t358, t366, t392, t394, t395, t396, t397, t39...847
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 a local 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
(forward)formula 0,0,3.17714,142888,1,0,265665,1049,5349,830709,348,4693,399261
FORMULA CloudDeployment-PT-2b-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Graph (trivial) has 436 edges and 423 vertex of which 154 / 423 are part of one of the 16 SCC in 0 ms
Free SCC test removed 138 places
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Graph (complete) has 775 edges and 285 vertex of which 275 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 274 transition count 252
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 1 with 129 rules applied. Total rules applied 260 place count 145 transition count 252
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 260 place count 145 transition count 238
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 288 place count 131 transition count 238
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 298 place count 121 transition count 228
Iterating global reduction 2 with 10 rules applied. Total rules applied 308 place count 121 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 309 place count 121 transition count 227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 309 place count 121 transition count 226
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 311 place count 120 transition count 226
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 379 place count 86 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 387 place count 86 transition count 184
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 3 with 4 rules applied. Total rules applied 391 place count 86 transition count 180
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 395 place count 82 transition count 180
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 5 with 4 rules applied. Total rules applied 399 place count 80 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 400 place count 79 transition count 177
Applied a total of 400 rules in 22 ms. Remains 79 /423 variables (removed 344) and now considering 177/540 (removed 363) transitions.
[2024-05-21 20:47:13] [INFO ] Flow matrix only has 146 transitions (discarded 31 similar events)
// Phase 1: matrix 146 rows 79 cols
[2024-05-21 20:47:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:47:13] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 20:47:13] [INFO ] Flow matrix only has 146 transitions (discarded 31 similar events)
[2024-05-21 20:47:13] [INFO ] Invariant cache hit.
[2024-05-21 20:47:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 20:47:13] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-21 20:47:14] [INFO ] Redundant transitions in 76 ms returned []
Running 160 sub problems to find dead transitions.
[2024-05-21 20:47:14] [INFO ] Flow matrix only has 146 transitions (discarded 31 similar events)
[2024-05-21 20:47:14] [INFO ] Invariant cache hit.
[2024-05-21 20:47:14] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 145/222 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 2/224 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/224 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/225 variables, and 85 constraints, problems are : Problem set: 0 solved, 160 unsolved in 3033 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 145/222 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 2/224 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 140/245 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 0/224 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/225 variables, and 245 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4217 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 7335ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 7336ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/423 places, 177/540 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7586 ms. Remains : 79/423 places, 177/540 transitions.
[2024-05-21 20:47:21] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:47:21] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:47:21] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-21 20:47:21] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:47:21] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:47:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11386738486974412272.gal : 1 ms
[2024-05-21 20:47:21] [INFO ] Time to serialize properties into /tmp/CTLFireability17463979799752979752.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/CTLFireability11386738486974412272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17463979799752979752.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,4.97882e+06,0.062231,5572,2,624,5,7026,6,0,469,7583,0


Converting to forward existential form...Done !
original formula: EG(AF(AG(E((p361==1) U (p214==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !(E((p361==1) U (p214==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t7, t9, t14, t18, t19, t20, t24, t28, t41, t45, t46, t50, t54, t78, t83, t87, t101, t...440
(forward)formula 0,0,1.62831,65568,1,0,471,365103,370,223,4010,370743,553
FORMULA CloudDeployment-PT-2b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 417 transition count 540
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 41 place count 382 transition count 505
Iterating global reduction 1 with 35 rules applied. Total rules applied 76 place count 382 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 382 transition count 504
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 85 place count 374 transition count 496
Iterating global reduction 2 with 8 rules applied. Total rules applied 93 place count 374 transition count 496
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 373 transition count 495
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 373 transition count 495
Applied a total of 95 rules in 26 ms. Remains 373 /423 variables (removed 50) and now considering 495/540 (removed 45) transitions.
// Phase 1: matrix 495 rows 373 cols
[2024-05-21 20:47:23] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 20:47:23] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 20:47:23] [INFO ] Invariant cache hit.
[2024-05-21 20:47:23] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 494 sub problems to find dead transitions.
[2024-05-21 20:47:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 495/867 variables, 372/374 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/867 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (OVERLAPS) 1/868 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/868 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 6 (OVERLAPS) 0/868 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 494 unsolved
No progress, stopping.
After SMT solving in domain Real declared 868/868 variables, and 375 constraints, problems are : Problem set: 0 solved, 494 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 494/494 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 494 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 495/867 variables, 372/374 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/867 variables, 494/868 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/867 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (OVERLAPS) 1/868 variables, 1/869 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/868 variables, and 869 constraints, problems are : Problem set: 0 solved, 494 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 494/494 constraints, Known Traps: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 494 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 373/423 places, 495/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60491 ms. Remains : 373/423 places, 495/540 transitions.
[2024-05-21 20:48:23] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:48:23] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:48:23] [INFO ] Input system was already deterministic with 495 transitions.
[2024-05-21 20:48:23] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:48:23] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:48:23] [INFO ] Time to serialize gal into /tmp/CTLFireability11082567443877511114.gal : 7 ms
[2024-05-21 20:48:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14099496780312344097.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/CTLFireability11082567443877511114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14099496780312344097.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.1494e+10,2.04025,67960,2,10675,5,201774,6,0,1984,306228,0


Converting to forward existential form...Done !
original formula: E(AF(!(EG(AF((p419==1))))) U !(((EF(!(AG((p434==1)))) + AX((p410==1))) + EG((p181!=1)))))
=> equivalent forward existential formula: [(EY(((FwdU(Init,!(EG(!(!(EG(!(EG(!((p419==1)))))))))) * !(EG((p181!=1)))) * !(E(TRUE U !(!(E(TRUE U !((p434==1)...189
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t23, t27, t29, t84, t98, t99, t104, t127, t133, t162, t163, t164, t171, t173,...652
(forward)formula 0,0,19.3952,530780,1,0,671,2.15805e+06,1014,417,12391,2.14729e+06,1005
FORMULA CloudDeployment-PT-2b-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 417 transition count 540
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 39 place count 384 transition count 507
Iterating global reduction 1 with 33 rules applied. Total rules applied 72 place count 384 transition count 507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 384 transition count 506
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 375 transition count 497
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 375 transition count 497
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 373 transition count 495
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 373 transition count 495
Applied a total of 95 rules in 15 ms. Remains 373 /423 variables (removed 50) and now considering 495/540 (removed 45) transitions.
// Phase 1: matrix 495 rows 373 cols
[2024-05-21 20:48:43] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 20:48:43] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 20:48:43] [INFO ] Invariant cache hit.
[2024-05-21 20:48:43] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 494 sub problems to find dead transitions.
[2024-05-21 20:48:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 495/867 variables, 372/374 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/867 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (OVERLAPS) 1/868 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/868 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (OVERLAPS) 0/868 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 494 unsolved
No progress, stopping.
After SMT solving in domain Real declared 868/868 variables, and 375 constraints, problems are : Problem set: 0 solved, 494 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 494/494 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 494 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 495/867 variables, 372/374 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/867 variables, 494/868 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/867 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (OVERLAPS) 1/868 variables, 1/869 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/868 variables, and 869 constraints, problems are : Problem set: 0 solved, 494 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 494/494 constraints, Known Traps: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 494 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 373/423 places, 495/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60487 ms. Remains : 373/423 places, 495/540 transitions.
[2024-05-21 20:49:43] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:49:43] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:49:43] [INFO ] Input system was already deterministic with 495 transitions.
[2024-05-21 20:49:43] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:49:43] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:49:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16098809262844425489.gal : 2 ms
[2024-05-21 20:49:43] [INFO ] Time to serialize properties into /tmp/CTLFireability613815248342079610.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/CTLFireability16098809262844425489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability613815248342079610.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.19223e+10,2.72212,88892,2,13230,5,271605,6,0,1984,413893,0


Converting to forward existential form...Done !
original formula: AX((EX((p487==1)) + (AX(EG((p46==0))) * EX(((AG((p245==0)) * (p199==0)) * (p297==0))))))
=> equivalent forward existential formula: ([(EY((EY(Init) * !(EX((p487==1))))) * !(EG((p46==0))))] = FALSE * [((EY(Init) * !(EX((p487==1)))) * !(EX(((!(E(...215
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t22, t26, t28, t83, t97, t98, t103, t124, t130, t159, t160, t161, t168, t170, t17...540
Detected timeout of ITS tools.
[2024-05-21 20:50:13] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:50:13] [INFO ] Applying decomposition
[2024-05-21 20:50:13] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12224197689561934898.txt' '-o' '/tmp/graph12224197689561934898.bin' '-w' '/tmp/graph12224197689561934898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12224197689561934898.bin' '-l' '-1' '-v' '-w' '/tmp/graph12224197689561934898.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:50:13] [INFO ] Decomposing Gal with order
[2024-05-21 20:50:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:50:13] [INFO ] Removed a total of 310 redundant transitions.
[2024-05-21 20:50:13] [INFO ] Flatten gal took : 17 ms
[2024-05-21 20:50:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2024-05-21 20:50:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9363026815049174222.gal : 3 ms
[2024-05-21 20:50:13] [INFO ] Time to serialize properties into /tmp/CTLFireability13462664851131921680.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/CTLFireability9363026815049174222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13462664851131921680.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.19223e+10,0.224959,13216,946,81,17443,867,799,39015,83,3055,0


Converting to forward existential form...Done !
original formula: AX((EX((i14.u120.p487==1)) + (AX(EG((i1.u7.p46==0))) * EX(((AG((i7.u61.p245==0)) * (i5.u46.p199==0)) * (i8.u73.p297==0))))))
=> equivalent forward existential formula: ([(EY((EY(Init) * !(EX((i14.u120.p487==1))))) * !(EG((i1.u7.p46==0))))] = FALSE * [((EY(Init) * !(EX((i14.u120.p...260
Reverse transition relation is NOT exact ! Due to transitions t130, t159, t160, t178, t293, t320, t349, t359, t369, t395, t398, t399, t400, t401, t402, t40...729
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 417 transition count 540
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 41 place count 382 transition count 505
Iterating global reduction 1 with 35 rules applied. Total rules applied 76 place count 382 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 382 transition count 504
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 87 place count 372 transition count 494
Iterating global reduction 2 with 10 rules applied. Total rules applied 97 place count 372 transition count 494
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 370 transition count 492
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 370 transition count 492
Applied a total of 101 rules in 19 ms. Remains 370 /423 variables (removed 53) and now considering 492/540 (removed 48) transitions.
// Phase 1: matrix 492 rows 370 cols
[2024-05-21 20:50:43] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 20:50:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 20:50:44] [INFO ] Invariant cache hit.
[2024-05-21 20:50:44] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 491 sub problems to find dead transitions.
[2024-05-21 20:50:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (OVERLAPS) 492/861 variables, 369/371 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/861 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (OVERLAPS) 1/862 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/862 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 6 (OVERLAPS) 0/862 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 491 unsolved
No progress, stopping.
After SMT solving in domain Real declared 862/862 variables, and 372 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 491 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (OVERLAPS) 492/861 variables, 369/371 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/861 variables, 491/862 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/861 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 5 (OVERLAPS) 1/862 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 491 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 862/862 variables, and 863 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 491 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 370/423 places, 492/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60449 ms. Remains : 370/423 places, 492/540 transitions.
[2024-05-21 20:51:44] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:51:44] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:51:44] [INFO ] Input system was already deterministic with 492 transitions.
[2024-05-21 20:51:44] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:51:44] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:51:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17952082680004690883.gal : 2 ms
[2024-05-21 20:51:44] [INFO ] Time to serialize properties into /tmp/CTLFireability9710901753186857338.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/CTLFireability17952082680004690883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9710901753186857338.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.12646e+10,1.84573,62032,2,10517,5,180168,6,0,1969,280453,0


Converting to forward existential form...Done !
original formula: (EG(((!(E((p243!=1) U EG((p90==1)))) + AX(AX(((p28==1)&&(p253==1))))) + (E(E((p220==1) U ((((p28==1)&&(p57==1))&&((p82==1)&&(p543==1)))&&...316
=> equivalent forward existential formula: ([FwdG(Init,((!(E((p243!=1) U EG((p90==1)))) + !(EX(!(!(EX(!(((p28==1)&&(p253==1))))))))) + (E(E((p220==1) U (((...395
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t22, t26, t28, t83, t97, t98, t103, t124, t130, t159, t160, t161, t168, t170, t17...648
Detected timeout of ITS tools.
[2024-05-21 20:52:14] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:52:14] [INFO ] Applying decomposition
[2024-05-21 20:52:14] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17967555344059540458.txt' '-o' '/tmp/graph17967555344059540458.bin' '-w' '/tmp/graph17967555344059540458.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17967555344059540458.bin' '-l' '-1' '-v' '-w' '/tmp/graph17967555344059540458.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:52:14] [INFO ] Decomposing Gal with order
[2024-05-21 20:52:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:52:14] [INFO ] Removed a total of 309 redundant transitions.
[2024-05-21 20:52:14] [INFO ] Flatten gal took : 18 ms
[2024-05-21 20:52:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2024-05-21 20:52:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17261354027211868118.gal : 3 ms
[2024-05-21 20:52:14] [INFO ] Time to serialize properties into /tmp/CTLFireability15096170782604102139.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/CTLFireability17261354027211868118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15096170782604102139.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.12646e+10,0.260273,14932,1012,75,22119,796,940,42683,84,2372,0


Converting to forward existential form...Done !
original formula: (EG(((!(E((i0.i1.u60.p243!=1) U EG((i2.i0.u19.p90==1)))) + AX(AX(((i16.i1.u2.p28==1)&&(i0.i0.u62.p253==1))))) + (E(E((i1.i1.u54.p220==1) ...534
=> equivalent forward existential formula: ([FwdG(Init,((!(E((i0.i1.u60.p243!=1) U EG((i2.i0.u19.p90==1)))) + !(EX(!(!(EX(!(((i16.i1.u2.p28==1)&&(i0.i0.u62...613
Reverse transition relation is NOT exact ! Due to transitions t130, t159, t160, t170, t178, t285, t290, t349, t366, t392, t419, t420, t421, t422, t423, t42...864
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 540
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 392 transition count 510
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 392 transition count 510
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 392 transition count 509
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 71 place count 383 transition count 500
Iterating global reduction 2 with 9 rules applied. Total rules applied 80 place count 383 transition count 500
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 381 transition count 498
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 381 transition count 498
Applied a total of 84 rules in 20 ms. Remains 381 /423 variables (removed 42) and now considering 498/540 (removed 42) transitions.
// Phase 1: matrix 498 rows 381 cols
[2024-05-21 20:52:44] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 20:52:44] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 20:52:44] [INFO ] Invariant cache hit.
[2024-05-21 20:52:45] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 497 sub problems to find dead transitions.
[2024-05-21 20:52:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 2 (OVERLAPS) 2/380 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 4 (OVERLAPS) 498/878 variables, 380/387 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/878 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 6 (OVERLAPS) 1/879 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/879 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 497 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 879/879 variables, and 388 constraints, problems are : Problem set: 0 solved, 497 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 497/497 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 497 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 2 (OVERLAPS) 2/380 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 4 (OVERLAPS) 498/878 variables, 380/387 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/878 variables, 497/884 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/878 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 7 (OVERLAPS) 1/879 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 497 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 879/879 variables, and 885 constraints, problems are : Problem set: 0 solved, 497 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 497/497 constraints, Known Traps: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 497 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 381/423 places, 498/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60508 ms. Remains : 381/423 places, 498/540 transitions.
[2024-05-21 20:53:45] [INFO ] Flatten gal took : 17 ms
[2024-05-21 20:53:45] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:53:45] [INFO ] Input system was already deterministic with 498 transitions.
[2024-05-21 20:53:45] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:53:45] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:53:45] [INFO ] Time to serialize gal into /tmp/CTLFireability1675860634010200421.gal : 2 ms
[2024-05-21 20:53:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13053856916175062704.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/CTLFireability1675860634010200421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13053856916175062704.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.1701e+10,1.95839,64860,2,10525,5,188191,6,0,2015,292653,0


Converting to forward existential form...Done !
original formula: E(((p53==1) + ((p379==1) * AX((EG((p101==1)) * (((p342==1)||(p225==1))||(((((p18==1)&&(p33==1))&&((p65==1)&&(p281==1)))&&(((p296==1)&&(p3...268
=> equivalent forward existential formula: [FwdG(FwdU(Init,((p53==1) + ((p379==1) * !(EX(!((EG((p101==1)) * (((p342==1)||(p225==1))||(((((p18==1)&&(p33==1)...391
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t23, t27, t29, t84, t98, t99, t104, t125, t159, t162, t163, t164, t172, t175,...628
Detected timeout of ITS tools.
[2024-05-21 20:54:15] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:54:15] [INFO ] Applying decomposition
[2024-05-21 20:54:15] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2842880091599248373.txt' '-o' '/tmp/graph2842880091599248373.bin' '-w' '/tmp/graph2842880091599248373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2842880091599248373.bin' '-l' '-1' '-v' '-w' '/tmp/graph2842880091599248373.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:54:15] [INFO ] Decomposing Gal with order
[2024-05-21 20:54:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:54:15] [INFO ] Removed a total of 298 redundant transitions.
[2024-05-21 20:54:15] [INFO ] Flatten gal took : 21 ms
[2024-05-21 20:54:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2024-05-21 20:54:15] [INFO ] Time to serialize gal into /tmp/CTLFireability944745281195414056.gal : 6 ms
[2024-05-21 20:54:15] [INFO ] Time to serialize properties into /tmp/CTLFireability18142743613434537410.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/CTLFireability944745281195414056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18142743613434537410.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.1701e+10,0.229658,12940,983,231,16285,3762,869,25985,136,13545,0


Converting to forward existential form...Done !
original formula: E(((i0.u9.p53==1) + ((i10.u96.p379==1) * AX((EG((i2.u19.p101==1)) * (((i8.u83.p342==1)||(i6.i0.i1.u58.p225==1))||(((((i15.u2.p18==1)&&(i1...425
=> equivalent forward existential formula: [FwdG(FwdU(Init,((i0.u9.p53==1) + ((i10.u96.p379==1) * !(EX(!((EG((i2.u19.p101==1)) * (((i8.u83.p342==1)||(i6.i0...576
Reverse transition relation is NOT exact ! Due to transitions t162, t182, t290, t355, t364, t372, t398, t412, t413, t414, t415, t416, t418, t419, t423, t42...778
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 540/540 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 417 transition count 540
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 36 place count 387 transition count 510
Iterating global reduction 1 with 30 rules applied. Total rules applied 66 place count 387 transition count 510
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 387 transition count 509
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 75 place count 379 transition count 501
Iterating global reduction 2 with 8 rules applied. Total rules applied 83 place count 379 transition count 501
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 378 transition count 500
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 378 transition count 500
Applied a total of 85 rules in 15 ms. Remains 378 /423 variables (removed 45) and now considering 500/540 (removed 40) transitions.
// Phase 1: matrix 500 rows 378 cols
[2024-05-21 20:54:45] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 20:54:45] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 20:54:45] [INFO ] Invariant cache hit.
[2024-05-21 20:54:45] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2024-05-21 20:54:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/377 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 500/877 variables, 377/379 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/877 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (OVERLAPS) 1/878 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/878 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 6 (OVERLAPS) 0/878 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 499 unsolved
No progress, stopping.
After SMT solving in domain Real declared 878/878 variables, and 380 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/377 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 500/877 variables, 377/379 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/877 variables, 499/878 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/877 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (OVERLAPS) 1/878 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 878/878 variables, and 879 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 378/423 places, 500/540 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60469 ms. Remains : 378/423 places, 500/540 transitions.
[2024-05-21 20:55:45] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:55:45] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:55:46] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-21 20:55:46] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:55:46] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:55:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5802464392245762036.gal : 3 ms
[2024-05-21 20:55:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1103211822469560227.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/CTLFireability5802464392245762036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1103211822469560227.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.29831e+10,1.33828,47552,2,8989,5,132228,6,0,2009,213530,0


Converting to forward existential form...Done !
original formula: AF(((((p161==1) * E((p421==1) U EG((p254==1)))) * (EG(((((p28==1)&&(p57==1))&&((p160==1)&&(p543==1)))&&(p552==1))) * A(AX((p210==1)) U (p...217
=> equivalent forward existential formula: [FwdG(Init,!(((((p161==1) * E((p421==1) U EG((p254==1)))) * (EG(((((p28==1)&&(p57==1))&&((p160==1)&&(p543==1)))&...315
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t23, t27, t29, t84, t98, t99, t105, t129, t135, t164, t165, t166, t173, t175,...550
Detected timeout of ITS tools.
[2024-05-21 20:56:16] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:56:16] [INFO ] Applying decomposition
[2024-05-21 20:56:16] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5965296282320058263.txt' '-o' '/tmp/graph5965296282320058263.bin' '-w' '/tmp/graph5965296282320058263.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5965296282320058263.bin' '-l' '-1' '-v' '-w' '/tmp/graph5965296282320058263.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:56:16] [INFO ] Decomposing Gal with order
[2024-05-21 20:56:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:56:16] [INFO ] Removed a total of 321 redundant transitions.
[2024-05-21 20:56:16] [INFO ] Flatten gal took : 22 ms
[2024-05-21 20:56:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-21 20:56:16] [INFO ] Time to serialize gal into /tmp/CTLFireability17003125518086897692.gal : 4 ms
[2024-05-21 20:56:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13759252128936144396.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/CTLFireability17003125518086897692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13759252128936144396.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.29831e+10,0.238998,10076,862,128,11859,979,807,17107,99,2513,0


Converting to forward existential form...Done !
original formula: AF(((((i3.u36.p161==1) * E((i11.u105.p421==1) U EG((i6.u64.p254==1)))) * (EG(((((i8.u3.p28==1)&&(i0.u10.p57==1))&&((i3.u36.p160==1)&&(i8....321
=> equivalent forward existential formula: [FwdG(Init,!(((((i3.u36.p161==1) * E((i11.u105.p421==1) U EG((i6.u64.p254==1)))) * (EG(((((i8.u3.p28==1)&&(i0.u1...437
Reverse transition relation is NOT exact ! Due to transitions t105, t135, t164, t165, t175, t183, t353, t373, t400, t414, t415, t416, t417, t418, t419, t42...735
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,11.478,519772,1,0,839585,3784,6963,4.20935e+06,516,15545,466959
FORMULA CloudDeployment-PT-2b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-21 20:56:27] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:56:27] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:56:27] [INFO ] Applying decomposition
[2024-05-21 20:56:27] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15582274220205855537.txt' '-o' '/tmp/graph15582274220205855537.bin' '-w' '/tmp/graph15582274220205855537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15582274220205855537.bin' '-l' '-1' '-v' '-w' '/tmp/graph15582274220205855537.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:56:27] [INFO ] Decomposing Gal with order
[2024-05-21 20:56:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:56:27] [INFO ] Removed a total of 293 redundant transitions.
[2024-05-21 20:56:27] [INFO ] Flatten gal took : 19 ms
[2024-05-21 20:56:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2024-05-21 20:56:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13406277476005158907.gal : 4 ms
[2024-05-21 20:56:27] [INFO ] Time to serialize properties into /tmp/CTLFireability18199740894621824534.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/CTLFireability13406277476005158907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18199740894621824534.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.23069e+10,4.87523,146688,1239,1119,93219,119869,967,288028,150,1.79623e+06,0


Converting to forward existential form...Done !
original formula: A((A(AG((i7.i0.u13.p63==1)) U !(AG((i15.u4.p35==1)))) + (!(EF(EX((i6.i2.u74.p257==1)))) * (EG((i3.i1.u34.p140==1)) + (AG((i11.i1.u107.p38...230
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(E(TRUE U !(E(TRUE U EG((i14.i3.u146.p495==1))))))))))))) * !(E(!(!(EG(!(!(E(TRUE U !(E...592
Reverse transition relation is NOT exact ! Due to transitions t180, t191, t201, t320, t386, t388, t406, t439, t509, i1.i0.u18.t385, i3.i1.u27.t351, i3.i5.t...965
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
(forward)formula 0,0,285.467,2479572,1,0,2.1395e+06,1.53131e+06,3241,1.43494e+07,439,1.35794e+07,590531
FORMULA CloudDeployment-PT-2b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(!((((i5.i2.u61.p221==1) * (AX((i15.u10.p30!=1)) + E(AG((i2.u40.p162==1)) U (i4.i0.u39.p156!=1)))) + EF((((i11.i1.u106.p383==1)&&(i5.i1....255
=> equivalent forward existential formula: [((Init * !(EG(!(EG(EX(!(EG(!(((i10.i3.u125.p330==1)||(i12.i1.u135.p459==1))))))))))) * !(E(!(EG(EX(!(EG(!(((i10...490
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 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
Detected timeout of ITS tools.
[2024-05-21 21:24:27] [INFO ] Applying decomposition
[2024-05-21 21:24:27] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:24:27] [INFO ] Decomposing Gal with order
[2024-05-21 21:24:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:24:27] [INFO ] Removed a total of 262 redundant transitions.
[2024-05-21 21:24:27] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:24:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 2 ms.
[2024-05-21 21:24:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8524853441555016899.gal : 2 ms
[2024-05-21 21:24:27] [INFO ] Time to serialize properties into /tmp/CTLFireability8103589504383614249.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/CTLFireability8524853441555016899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8103589504383614249.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 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.23069e+10,1.13374,41484,408,4767,5046,92909,360,15461,1151,463942,0


Converting to forward existential form...Done !
original formula: A(!((((i0.i0.i0.u7.p221==1) * (AX((i0.i0.i0.i0.u6.p30!=1)) + E(AG((i0.i0.i0.u7.p162==1)) U (i0.i0.i0.u7.p156!=1)))) + EF((((i0.i0.i1.u12....278
=> equivalent forward existential formula: [((Init * !(EG(!(EG(EX(!(EG(!(((i0.i0.i1.u12.p330==1)||(i0.i0.i1.u12.p459==1))))))))))) * !(E(!(EG(EX(!(EG(!(((i...517
Reverse transition relation is NOT exact ! Due to transitions t439, u16.t4, u16.t5, i0.t533, i0.t530, i0.i0.t181, i0.i0.i0.t514, i0.i0.i0.u7.t236, i0.i0.i0...1282

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="CloudDeployment-PT-2b"
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 CloudDeployment-PT-2b, 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 r070-tall-171620506100546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-2b.tgz
mv CloudDeployment-PT-2b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;