Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734899000305.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 FireWire-PT-18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000305
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 168K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717369555199

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 23:05:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:05:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:05:56] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-02 23:05:56] [INFO ] Transformed 437 places.
[2024-06-02 23:05:56] [INFO ] Transformed 707 transitions.
[2024-06-02 23:05:56] [INFO ] Found NUPN structural information;
[2024-06-02 23:05:56] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
FORMULA FireWire-PT-18-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 139 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 707/707 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 431 transition count 707
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 67 place count 370 transition count 646
Iterating global reduction 1 with 61 rules applied. Total rules applied 128 place count 370 transition count 646
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 133 place count 365 transition count 639
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 365 transition count 639
Applied a total of 138 rules in 70 ms. Remains 365 /437 variables (removed 72) and now considering 639/707 (removed 68) transitions.
// Phase 1: matrix 639 rows 365 cols
[2024-06-02 23:05:56] [INFO ] Computed 7 invariants in 25 ms
[2024-06-02 23:05:57] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-06-02 23:05:57] [INFO ] Invariant cache hit.
[2024-06-02 23:05:57] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
Running 638 sub problems to find dead transitions.
[2024-06-02 23:05:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2024-06-02 23:06:04] [INFO ] Deduced a trap composed of 219 places in 150 ms of which 21 ms to minimize.
[2024-06-02 23:06:05] [INFO ] Deduced a trap composed of 205 places in 147 ms of which 4 ms to minimize.
[2024-06-02 23:06:05] [INFO ] Deduced a trap composed of 111 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:06:05] [INFO ] Deduced a trap composed of 111 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:06:05] [INFO ] Deduced a trap composed of 122 places in 61 ms of which 2 ms to minimize.
[2024-06-02 23:06:06] [INFO ] Deduced a trap composed of 96 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:06:06] [INFO ] Deduced a trap composed of 96 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:06:06] [INFO ] Deduced a trap composed of 98 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:06:06] [INFO ] Deduced a trap composed of 123 places in 63 ms of which 12 ms to minimize.
[2024-06-02 23:06:07] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:06:08] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:06:08] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 1 ms to minimize.
[2024-06-02 23:06:08] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:06:08] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:06:08] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:06:08] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:06:08] [INFO ] Deduced a trap composed of 122 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:06:08] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:06:08] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:06:09] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2024-06-02 23:06:10] [INFO ] Deduced a trap composed of 113 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:06:11] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:06:11] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:06:11] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:06:11] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:06:12] [INFO ] Deduced a trap composed of 109 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:06:13] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:06:13] [INFO ] Deduced a trap composed of 107 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2024-06-02 23:06:19] [INFO ] Deduced a trap composed of 100 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:06:20] [INFO ] Deduced a trap composed of 109 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:06:20] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:06:20] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:06:21] [INFO ] Deduced a trap composed of 191 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:06:23] [INFO ] Deduced a trap composed of 120 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2024-06-02 23:06:25] [INFO ] Deduced a trap composed of 123 places in 61 ms of which 5 ms to minimize.
[2024-06-02 23:06:25] [INFO ] Deduced a trap composed of 97 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/1004 variables, and 43 constraints, problems are : Problem set: 0 solved, 638 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/365 constraints, PredecessorRefiner: 638/638 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 638 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 4 (OVERLAPS) 639/1000 variables, 361/404 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 624/1028 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2024-06-02 23:06:43] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:06:43] [INFO ] Deduced a trap composed of 148 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:06:44] [INFO ] Deduced a trap composed of 109 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:06:45] [INFO ] Deduced a trap composed of 201 places in 119 ms of which 2 ms to minimize.
[2024-06-02 23:06:46] [INFO ] Deduced a trap composed of 217 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:06:46] [INFO ] Deduced a trap composed of 186 places in 124 ms of which 3 ms to minimize.
[2024-06-02 23:06:47] [INFO ] Deduced a trap composed of 214 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:06:52] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1004 variables, and 1036 constraints, problems are : Problem set: 0 solved, 638 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 361/365 constraints, PredecessorRefiner: 624/638 constraints, Known Traps: 44/44 constraints]
After SMT, in 60433ms problems are : Problem set: 0 solved, 638 unsolved
Search for dead transitions found 0 dead transitions in 60455ms
Starting structural reductions in LTL mode, iteration 1 : 365/437 places, 639/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61310 ms. Remains : 365/437 places, 639/707 transitions.
Support contains 139 out of 365 places after structural reductions.
[2024-06-02 23:06:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 23:06:58] [INFO ] Flatten gal took : 73 ms
FORMULA FireWire-PT-18-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 23:06:58] [INFO ] Flatten gal took : 39 ms
[2024-06-02 23:06:58] [INFO ] Input system was already deterministic with 639 transitions.
Support contains 128 out of 365 places (down from 139) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 1794 ms. (22 steps per ms) remains 58/78 properties
BEST_FIRST walk for 4004 steps (9 resets) in 50 ms. (78 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (10 resets) in 48 ms. (81 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (9 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4003 steps (9 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (10 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (10 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (10 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
[2024-06-02 23:06:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 249/339 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 621/960 variables, 339/346 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/960 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 30/990 variables, 18/364 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/990 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 10/1000 variables, 5/369 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 4/1004 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1004 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/1004 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1004/1004 variables, and 372 constraints, problems are : Problem set: 0 solved, 54 unsolved in 4157 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 249/339 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 53 unsolved
[2024-06-02 23:07:03] [INFO ] Deduced a trap composed of 122 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:07:03] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:07:03] [INFO ] Deduced a trap composed of 109 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:07:04] [INFO ] Deduced a trap composed of 187 places in 119 ms of which 2 ms to minimize.
[2024-06-02 23:07:04] [INFO ] Deduced a trap composed of 110 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:07:04] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:07:04] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:07:04] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:07:04] [INFO ] Deduced a trap composed of 121 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:07:05] [INFO ] Deduced a trap composed of 171 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:07:05] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 11/18 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 621/960 variables, 339/357 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/960 variables, 48/405 constraints. Problems are: Problem set: 1 solved, 53 unsolved
[2024-06-02 23:07:06] [INFO ] Deduced a trap composed of 107 places in 66 ms of which 8 ms to minimize.
[2024-06-02 23:07:07] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:07:07] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:07:07] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:07:07] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:07:08] [INFO ] Deduced a trap composed of 205 places in 117 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/960 variables, 6/411 constraints. Problems are: Problem set: 1 solved, 53 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/1004 variables, and 411 constraints, problems are : Problem set: 1 solved, 53 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 339/365 constraints, PredecessorRefiner: 48/54 constraints, Known Traps: 17/17 constraints]
After SMT, in 9189ms problems are : Problem set: 1 solved, 53 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 639/639 transitions.
Graph (trivial) has 165 edges and 365 vertex of which 5 / 365 are part of one of the 1 SCC in 6 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1160 edges and 361 vertex of which 360 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 360 transition count 611
Reduce places removed 22 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 31 rules applied. Total rules applied 55 place count 338 transition count 602
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 64 place count 329 transition count 602
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 64 place count 329 transition count 588
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 92 place count 315 transition count 588
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 104 place count 303 transition count 575
Iterating global reduction 3 with 12 rules applied. Total rules applied 116 place count 303 transition count 575
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 116 place count 303 transition count 574
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 302 transition count 574
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 300 transition count 572
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 300 transition count 572
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 180 place count 271 transition count 542
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 270 transition count 540
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 270 transition count 540
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 269 transition count 537
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 269 transition count 537
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 268 transition count 535
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 268 transition count 535
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 267 transition count 532
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 267 transition count 532
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 214 place count 254 transition count 591
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 220 place count 254 transition count 585
Free-agglomeration rule applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 246 place count 254 transition count 559
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 276 place count 228 transition count 555
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 4 with 36 rules applied. Total rules applied 312 place count 228 transition count 519
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 318 place count 228 transition count 519
Applied a total of 318 rules in 174 ms. Remains 228 /365 variables (removed 137) and now considering 519/639 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 228/365 places, 519/639 transitions.
RANDOM walk for 40000 steps (17 resets) in 426 ms. (93 steps per ms) remains 48/53 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 45/48 properties
BEST_FIRST walk for 4001 steps (12 resets) in 35 ms. (111 steps per ms) remains 43/45 properties
BEST_FIRST walk for 4000 steps (15 resets) in 25 ms. (153 steps per ms) remains 40/43 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (12 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (19 resets) in 44 ms. (88 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (12 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (19 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (16 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (17 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (15 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (16 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (14 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (13 resets) in 17 ms. (222 steps per ms) remains 37/40 properties
BEST_FIRST walk for 4001 steps (10 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (12 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (14 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (15 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (14 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (13 resets) in 16 ms. (235 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4002 steps (16 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (11 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (13 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (10 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (11 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (13 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (11 resets) in 24 ms. (160 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4002 steps (16 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (15 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (13 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (17 resets) in 14 ms. (266 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4000 steps (17 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (15 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (15 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (11 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (16 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (17 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
[2024-06-02 23:07:09] [INFO ] Flow matrix only has 516 transitions (discarded 3 similar events)
// Phase 1: matrix 516 rows 228 cols
[2024-06-02 23:07:09] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:07:09] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 167/216 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 514/730 variables, 216/223 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/730 variables, 62/285 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/730 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 13/743 variables, 11/296 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/744 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/744 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/744 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 744/744 variables, and 297 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1722 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 228/228 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 167/216 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 23:07:10] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:07:11] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:07:11] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 2 ms to minimize.
[2024-06-02 23:07:11] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:07:11] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 23:07:11] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 514/730 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/730 variables, 62/291 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 29/320 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 23:07:12] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:07:12] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:07:12] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/730 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 23:07:13] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:07:13] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:07:13] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:07:13] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/730 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 23:07:14] [INFO ] Deduced a trap composed of 132 places in 89 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/730 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 23:07:15] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:07:15] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/730 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/730 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 13 (OVERLAPS) 13/743 variables, 11/341 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/743 variables, 3/344 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/743 variables, 0/344 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 16 (OVERLAPS) 1/744 variables, 1/345 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/744 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 18 (OVERLAPS) 0/744 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 744/744 variables, and 345 constraints, problems are : Problem set: 1 solved, 32 unsolved in 8947 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 228/228 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 32/33 constraints, Known Traps: 16/16 constraints]
After SMT, in 10693ms problems are : Problem set: 1 solved, 32 unsolved
Fused 32 Parikh solutions to 30 different solutions.
Parikh walk visited 4 properties in 1962 ms.
Support contains 42 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 519/519 transitions.
Graph (complete) has 898 edges and 228 vertex of which 226 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 226 transition count 513
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 222 transition count 511
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 220 transition count 511
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 220 transition count 509
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 218 transition count 509
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 24 place count 213 transition count 503
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 213 transition count 503
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 212 transition count 502
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 212 transition count 502
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 53 place count 201 transition count 491
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 57 place count 201 transition count 487
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 60 place count 198 transition count 483
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 198 transition count 483
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 71 place count 194 transition count 507
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 91 place count 194 transition count 487
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 101 place count 194 transition count 477
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 4 with 35 rules applied. Total rules applied 136 place count 184 transition count 452
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 137 place count 183 transition count 451
Iterating global reduction 5 with 1 rules applied. Total rules applied 138 place count 183 transition count 451
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 149 place count 183 transition count 440
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 153 place count 183 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 154 place count 183 transition count 439
Applied a total of 154 rules in 75 ms. Remains 183 /228 variables (removed 45) and now considering 439/519 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 183/228 places, 439/519 transitions.
RANDOM walk for 40000 steps (27 resets) in 236 ms. (168 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (13 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (10 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (16 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (12 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (15 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (14 resets) in 45 ms. (86 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (11 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (18 resets) in 28 ms. (137 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (15 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (20 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (13 resets) in 31 ms. (125 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4000 steps (10 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (18 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (13 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (16 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (16 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (13 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (16 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (14 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (16 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4000 steps (10 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (16 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (10 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (12 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (15 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
[2024-06-02 23:07:22] [INFO ] Flow matrix only has 412 transitions (discarded 27 similar events)
// Phase 1: matrix 412 rows 183 cols
[2024-06-02 23:07:22] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:07:22] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 136/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 409/580 variables, 171/178 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 62/240 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 14/594 variables, 11/251 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 1/595 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 0/595 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 252 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1118 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 183/183 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 136/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 23:07:23] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:07:23] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:07:23] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:07:23] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 23:07:23] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 409/580 variables, 171/184 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 62/246 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 22/268 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 51 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 14/594 variables, 11/283 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/594 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/594 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 1/595 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 23:07:26] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:07:26] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:07:26] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:07:26] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/595 variables, 4/291 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/595 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 16 (OVERLAPS) 0/595 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 291 constraints, problems are : Problem set: 0 solved, 25 unsolved in 4444 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 183/183 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 14/14 constraints]
After SMT, in 5578ms problems are : Problem set: 0 solved, 25 unsolved
Parikh walk visited 0 properties in 1728 ms.
Support contains 35 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 439/439 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 437
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 181 transition count 437
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 180 transition count 436
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 180 transition count 436
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 2 with 2 rules applied. Total rules applied 8 place count 179 transition count 435
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 178 transition count 443
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 178 transition count 441
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 23 place count 178 transition count 430
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 178 transition count 428
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 28 place count 176 transition count 427
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 176 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 30 place count 176 transition count 426
Applied a total of 30 rules in 48 ms. Remains 176 /183 variables (removed 7) and now considering 426/439 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 176/183 places, 426/439 transitions.
RANDOM walk for 40000 steps (16 resets) in 212 ms. (187 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (18 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (14 resets) in 49 ms. (80 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (12 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (11 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (12 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (18 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (14 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (12 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (11 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (14 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (15 resets) in 22 ms. (173 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (17 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (12 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (12 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (19 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (13 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (13 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (17 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (10 resets) in 49 ms. (80 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (12 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (15 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (17 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (16 resets) in 53 ms. (74 steps per ms) remains 25/25 properties
Finished probabilistic random walk after 488400 steps, run visited all 25 properties in 1417 ms. (steps per millisecond=344 )
Probabilistic random walk after 488400 steps, saw 120546 distinct states, run finished after 1421 ms. (steps per millisecond=343 ) properties seen :25
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2024-06-02 23:07:31] [INFO ] Flatten gal took : 29 ms
[2024-06-02 23:07:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-18-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 23:07:31] [INFO ] Flatten gal took : 28 ms
[2024-06-02 23:07:31] [INFO ] Input system was already deterministic with 639 transitions.
Support contains 115 out of 365 places (down from 121) after GAL structural reductions.
Computed a total of 110 stabilizing places and 164 stable transitions
Graph (complete) has 1166 edges and 365 vertex of which 361 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.14 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 365/365 places, 639/639 transitions.
Graph (trivial) has 262 edges and 365 vertex of which 8 / 365 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1159 edges and 359 vertex of which 355 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 354 transition count 577
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 300 transition count 576
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 111 place count 300 transition count 561
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 141 place count 285 transition count 561
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 170 place count 256 transition count 509
Iterating global reduction 2 with 29 rules applied. Total rules applied 199 place count 256 transition count 509
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 201 place count 256 transition count 507
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 201 place count 256 transition count 502
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 211 place count 251 transition count 502
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 223 place count 239 transition count 467
Iterating global reduction 3 with 12 rules applied. Total rules applied 235 place count 239 transition count 467
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 3 with 2 rules applied. Total rules applied 237 place count 239 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 238 place count 238 transition count 465
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 241 place count 235 transition count 460
Iterating global reduction 5 with 3 rules applied. Total rules applied 244 place count 235 transition count 460
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 5 with 2 rules applied. Total rules applied 246 place count 235 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 247 place count 234 transition count 458
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 291 place count 212 transition count 436
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 7 with 2 rules applied. Total rules applied 293 place count 212 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 294 place count 211 transition count 434
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 299 place count 206 transition count 406
Iterating global reduction 9 with 5 rules applied. Total rules applied 304 place count 206 transition count 406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 305 place count 206 transition count 405
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 307 place count 204 transition count 399
Iterating global reduction 10 with 2 rules applied. Total rules applied 309 place count 204 transition count 399
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 311 place count 202 transition count 395
Iterating global reduction 10 with 2 rules applied. Total rules applied 313 place count 202 transition count 395
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 315 place count 200 transition count 389
Iterating global reduction 10 with 2 rules applied. Total rules applied 317 place count 200 transition count 389
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 319 place count 198 transition count 385
Iterating global reduction 10 with 2 rules applied. Total rules applied 321 place count 198 transition count 385
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 323 place count 196 transition count 379
Iterating global reduction 10 with 2 rules applied. Total rules applied 325 place count 196 transition count 379
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 327 place count 194 transition count 375
Iterating global reduction 10 with 2 rules applied. Total rules applied 329 place count 194 transition count 375
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 331 place count 192 transition count 369
Iterating global reduction 10 with 2 rules applied. Total rules applied 333 place count 192 transition count 369
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 335 place count 190 transition count 365
Iterating global reduction 10 with 2 rules applied. Total rules applied 337 place count 190 transition count 365
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 339 place count 188 transition count 359
Iterating global reduction 10 with 2 rules applied. Total rules applied 341 place count 188 transition count 359
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 343 place count 186 transition count 355
Iterating global reduction 10 with 2 rules applied. Total rules applied 345 place count 186 transition count 355
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 347 place count 184 transition count 351
Iterating global reduction 10 with 2 rules applied. Total rules applied 349 place count 184 transition count 351
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 351 place count 182 transition count 347
Iterating global reduction 10 with 2 rules applied. Total rules applied 353 place count 182 transition count 347
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 354 place count 182 transition count 347
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 356 place count 180 transition count 345
Applied a total of 356 rules in 130 ms. Remains 180 /365 variables (removed 185) and now considering 345/639 (removed 294) transitions.
[2024-06-02 23:07:31] [INFO ] Flow matrix only has 342 transitions (discarded 3 similar events)
// Phase 1: matrix 342 rows 180 cols
[2024-06-02 23:07:31] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:07:31] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 23:07:31] [INFO ] Flow matrix only has 342 transitions (discarded 3 similar events)
[2024-06-02 23:07:31] [INFO ] Invariant cache hit.
[2024-06-02 23:07:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:07:31] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-06-02 23:07:31] [INFO ] Redundant transitions in 21 ms returned []
Running 336 sub problems to find dead transitions.
[2024-06-02 23:07:31] [INFO ] Flow matrix only has 342 transitions (discarded 3 similar events)
[2024-06-02 23:07:31] [INFO ] Invariant cache hit.
[2024-06-02 23:07:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 23:07:33] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:07:33] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:07:33] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:07:34] [INFO ] Deduced a trap composed of 125 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:07:34] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:07:34] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:07:34] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:07:34] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (OVERLAPS) 341/519 variables, 178/193 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 23:07:39] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 23:07:43] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (OVERLAPS) 2/521 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (OVERLAPS) 0/521 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/522 variables, and 199 constraints, problems are : Problem set: 0 solved, 336 unsolved in 20076 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (OVERLAPS) 341/519 variables, 178/195 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 336/533 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 23:07:55] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (OVERLAPS) 2/521 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (OVERLAPS) 0/521 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Int declared 521/522 variables, and 536 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 11/11 constraints]
After SMT, in 50206ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 50209ms
Starting structural reductions in SI_CTL mode, iteration 1 : 180/365 places, 345/639 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50628 ms. Remains : 180/365 places, 345/639 transitions.
[2024-06-02 23:08:22] [INFO ] Flatten gal took : 24 ms
[2024-06-02 23:08:22] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:08:22] [INFO ] Input system was already deterministic with 345 transitions.
[2024-06-02 23:08:22] [INFO ] Flatten gal took : 33 ms
[2024-06-02 23:08:22] [INFO ] Flatten gal took : 24 ms
RANDOM walk for 40000 steps (1689 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
[2024-06-02 23:08:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9814604782751479189.gal : 10 ms
BEST_FIRST walk for 40004 steps (394 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2024-06-02 23:08:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18415265390810682558.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/ReachabilityCardinality9814604782751479189.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18415265390810682558.prop' '--nowitness' '--gen-order' 'FOLLOW'
Finished probabilistic random walk after 2679 steps, run visited all 1 properties in 9 ms. (steps per millisecond=297 )
Probabilistic random walk after 2679 steps, saw 943 distinct states, run finished after 9 ms. (steps per millisecond=297 ) properties seen :1
FORMULA FireWire-PT-18-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 639/639 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 361 transition count 639
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 51 place count 314 transition count 569
Iterating global reduction 1 with 47 rules applied. Total rules applied 98 place count 314 transition count 569
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 314 transition count 568
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 116 place count 297 transition count 507
Iterating global reduction 2 with 17 rules applied. Total rules applied 133 place count 297 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 135 place count 297 transition count 505
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 140 place count 292 transition count 496
Iterating global reduction 3 with 5 rules applied. Total rules applied 145 place count 292 transition count 496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 292 transition count 495
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 148 place count 290 transition count 490
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 290 transition count 490
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 288 transition count 485
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 288 transition count 485
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 156 place count 286 transition count 480
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 286 transition count 480
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 160 place count 284 transition count 475
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 284 transition count 475
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 164 place count 282 transition count 470
Iterating global reduction 4 with 2 rules applied. Total rules applied 166 place count 282 transition count 470
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 168 place count 280 transition count 465
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 280 transition count 465
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 278 transition count 460
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 278 transition count 460
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 176 place count 276 transition count 455
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 276 transition count 455
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 180 place count 274 transition count 450
Iterating global reduction 4 with 2 rules applied. Total rules applied 182 place count 274 transition count 450
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 184 place count 272 transition count 446
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 272 transition count 446
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 188 place count 270 transition count 442
Iterating global reduction 4 with 2 rules applied. Total rules applied 190 place count 270 transition count 442
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 192 place count 268 transition count 439
Iterating global reduction 4 with 2 rules applied. Total rules applied 194 place count 268 transition count 439
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 195 place count 267 transition count 438
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 267 transition count 438
Applied a total of 196 rules in 42 ms. Remains 267 /365 variables (removed 98) and now considering 438/639 (removed 201) transitions.
// Phase 1: matrix 438 rows 267 cols
[2024-06-02 23:08:22] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:08:22] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 23:08:22] [INFO ] Invariant cache hit.
[2024-06-02 23:08:22] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-06-02 23:08:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:08:26] [INFO ] Deduced a trap composed of 155 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:08:26] [INFO ] Deduced a trap composed of 79 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:08:26] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:08:27] [INFO ] Deduced a trap composed of 79 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:08:27] [INFO ] Deduced a trap composed of 78 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:08:27] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 2 ms to minimize.
[2024-06-02 23:08:28] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 5 ms to minimize.
[2024-06-02 23:08:28] [INFO ] Deduced a trap composed of 167 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:08:29] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:08:29] [INFO ] Deduced a trap composed of 153 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:08:30] [INFO ] Deduced a trap composed of 153 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (OVERLAPS) 438/705 variables, 267/285 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:08:37] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:08:38] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/705 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 8 (OVERLAPS) 0/705 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 437 unsolved
No progress, stopping.
After SMT solving in domain Real declared 705/705 variables, and 287 constraints, problems are : Problem set: 0 solved, 437 unsolved in 29540 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:08:54] [INFO ] Deduced a trap composed of 185 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:08:55] [INFO ] Deduced a trap composed of 183 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:08:55] [INFO ] Deduced a trap composed of 167 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:08:55] [INFO ] Deduced a trap composed of 167 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:08:55] [INFO ] Deduced a trap composed of 164 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:08:55] [INFO ] Deduced a trap composed of 164 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 5 (OVERLAPS) 438/705 variables, 267/293 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 437/730 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:09:03] [INFO ] Deduced a trap composed of 113 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:09:03] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/705 variables, 2/732 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-02 23:09:18] [INFO ] Deduced a trap composed of 164 places in 85 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 705/705 variables, and 733 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 22/22 constraints]
After SMT, in 59681ms problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 59684ms
Starting structural reductions in LTL mode, iteration 1 : 267/365 places, 438/639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60035 ms. Remains : 267/365 places, 438/639 transitions.
[2024-06-02 23:09:22] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:09:22] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:09:22] [INFO ] Input system was already deterministic with 438 transitions.
[2024-06-02 23:09:22] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:09:22] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:09:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality13664915464311692286.gal : 4 ms
[2024-06-02 23:09:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality1283523047500835895.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13664915464311692286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1283523047500835895.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57348e+10,24.4967,665584,2,22624,5,1.43095e+06,6,0,1506,3.13261e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57348e+10,15.6077,425916,2186,63,441824,685,1025,3.14937e+06,79,2327,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 639/639 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 361 transition count 639
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 49 place count 316 transition count 571
Iterating global reduction 1 with 45 rules applied. Total rules applied 94 place count 316 transition count 571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 316 transition count 570
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 112 place count 299 transition count 509
Iterating global reduction 2 with 17 rules applied. Total rules applied 129 place count 299 transition count 509
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 131 place count 299 transition count 507
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 137 place count 293 transition count 496
Iterating global reduction 3 with 6 rules applied. Total rules applied 143 place count 293 transition count 496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 144 place count 293 transition count 495
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 145 place count 292 transition count 492
Iterating global reduction 4 with 1 rules applied. Total rules applied 146 place count 292 transition count 492
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 291 transition count 490
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 291 transition count 490
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 290 transition count 487
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 290 transition count 487
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 151 place count 289 transition count 485
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 289 transition count 485
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 153 place count 288 transition count 482
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 288 transition count 482
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 287 transition count 480
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 287 transition count 480
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 286 transition count 477
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 286 transition count 477
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 159 place count 285 transition count 475
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 285 transition count 475
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 161 place count 284 transition count 472
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 284 transition count 472
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 163 place count 283 transition count 470
Iterating global reduction 4 with 1 rules applied. Total rules applied 164 place count 283 transition count 470
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 282 transition count 468
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 282 transition count 468
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 167 place count 281 transition count 466
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 281 transition count 466
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 280 transition count 465
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 280 transition count 465
Applied a total of 170 rules in 48 ms. Remains 280 /365 variables (removed 85) and now considering 465/639 (removed 174) transitions.
// Phase 1: matrix 465 rows 280 cols
[2024-06-02 23:10:22] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 23:10:23] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 23:10:23] [INFO ] Invariant cache hit.
[2024-06-02 23:10:23] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2024-06-02 23:10:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-02 23:10:27] [INFO ] Deduced a trap composed of 160 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:10:27] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:10:28] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:10:28] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:10:28] [INFO ] Deduced a trap composed of 77 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:10:28] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:10:28] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:10:29] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 1 ms to minimize.
[2024-06-02 23:10:29] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-02 23:10:32] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-02 23:10:37] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:10:37] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (OVERLAPS) 465/745 variables, 280/299 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-02 23:10:46] [INFO ] Deduced a trap composed of 104 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:10:47] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-02 23:10:50] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 745/745 variables, and 302 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 465/745 variables, 280/302 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/745 variables, 464/766 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-02 23:11:03] [INFO ] Deduced a trap composed of 164 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 1/767 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-02 23:11:15] [INFO ] Deduced a trap composed of 180 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:11:15] [INFO ] Deduced a trap composed of 163 places in 94 ms of which 3 ms to minimize.
[2024-06-02 23:11:16] [INFO ] Deduced a trap composed of 164 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:11:19] [INFO ] Deduced a trap composed of 158 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 745/745 variables, and 771 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 20/20 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 280/365 places, 465/639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60544 ms. Remains : 280/365 places, 465/639 transitions.
[2024-06-02 23:11:23] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:11:23] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:11:23] [INFO ] Input system was already deterministic with 465 transitions.
[2024-06-02 23:11:23] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:11:23] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:11:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality15011820507564206089.gal : 2 ms
[2024-06-02 23:11:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality14180209394856594331.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/CTLCardinality15011820507564206089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14180209394856594331.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,2.55347e+10,22.9585,603364,2,24333,5,1.30004e+06,6,0,1585,2.80524e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 23:11:53] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:11:53] [INFO ] Applying decomposition
[2024-06-02 23:11:53] [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/graph2726146983397023585.txt' '-o' '/tmp/graph2726146983397023585.bin' '-w' '/tmp/graph2726146983397023585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2726146983397023585.bin' '-l' '-1' '-v' '-w' '/tmp/graph2726146983397023585.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:11:53] [INFO ] Decomposing Gal with order
[2024-06-02 23:11:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:11:53] [INFO ] Removed a total of 506 redundant transitions.
[2024-06-02 23:11:53] [INFO ] Flatten gal took : 24 ms
[2024-06-02 23:11:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 8 ms.
[2024-06-02 23:11:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality1323048357720470243.gal : 4 ms
[2024-06-02 23:11:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality3721052629572617323.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/CTLCardinality1323048357720470243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3721052629572617323.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 639/639 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 362 transition count 639
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 321 transition count 575
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 321 transition count 575
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 321 transition count 574
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 99 place count 308 transition count 518
Iterating global reduction 2 with 13 rules applied. Total rules applied 112 place count 308 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 308 transition count 516
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 118 place count 304 transition count 509
Iterating global reduction 3 with 4 rules applied. Total rules applied 122 place count 304 transition count 509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 304 transition count 508
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 303 transition count 505
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 303 transition count 505
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 302 transition count 503
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 302 transition count 503
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 301 transition count 500
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 301 transition count 500
Applied a total of 129 rules in 22 ms. Remains 301 /365 variables (removed 64) and now considering 500/639 (removed 139) transitions.
// Phase 1: matrix 500 rows 301 cols
[2024-06-02 23:12:23] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:12:23] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 23:12:23] [INFO ] Invariant cache hit.
[2024-06-02 23:12:24] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2024-06-02 23:12:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:12:28] [INFO ] Deduced a trap composed of 185 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:12:29] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:12:29] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:12:29] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:12:29] [INFO ] Deduced a trap composed of 102 places in 60 ms of which 2 ms to minimize.
[2024-06-02 23:12:29] [INFO ] Deduced a trap composed of 170 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:12:29] [INFO ] Deduced a trap composed of 173 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:12:30] [INFO ] Deduced a trap composed of 170 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:12:30] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:12:30] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:12:30] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:12:30] [INFO ] Deduced a trap composed of 95 places in 47 ms of which 0 ms to minimize.
[2024-06-02 23:12:31] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:12:31] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:12:32] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:12:35] [INFO ] Deduced a trap composed of 94 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (OVERLAPS) 500/800 variables, 300/323 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:12:43] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/800 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 800/801 variables, and 324 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/301 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:12:56] [INFO ] Deduced a trap composed of 172 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:13:00] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:13:00] [INFO ] Deduced a trap composed of 208 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:13:04] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:13:04] [INFO ] Deduced a trap composed of 104 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:13:04] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:13:05] [INFO ] Deduced a trap composed of 168 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:13:05] [INFO ] Deduced a trap composed of 170 places in 97 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:13:07] [INFO ] Deduced a trap composed of 167 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:13:08] [INFO ] Deduced a trap composed of 181 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:13:08] [INFO ] Deduced a trap composed of 204 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 8 (OVERLAPS) 500/800 variables, 300/335 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/800 variables, 496/831 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 23:13:19] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:13:23] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 800/801 variables, and 833 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/301 constraints, PredecessorRefiner: 496/499 constraints, Known Traps: 30/30 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in LTL mode, iteration 1 : 301/365 places, 500/639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60616 ms. Remains : 301/365 places, 500/639 transitions.
[2024-06-02 23:13:24] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:13:24] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:13:24] [INFO ] Input system was already deterministic with 500 transitions.
[2024-06-02 23:13:24] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:13:24] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:13:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality990227035562061352.gal : 2 ms
[2024-06-02 23:13:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality296874205157010313.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/CTLCardinality990227035562061352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality296874205157010313.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:13:54] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:13:54] [INFO ] Applying decomposition
[2024-06-02 23:13:54] [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/graph17026956673346968576.txt' '-o' '/tmp/graph17026956673346968576.bin' '-w' '/tmp/graph17026956673346968576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17026956673346968576.bin' '-l' '-1' '-v' '-w' '/tmp/graph17026956673346968576.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:13:54] [INFO ] Decomposing Gal with order
[2024-06-02 23:13:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:13:54] [INFO ] Removed a total of 524 redundant transitions.
[2024-06-02 23:13:54] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:13:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 6 ms.
[2024-06-02 23:13:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality2187392311461506065.gal : 4 ms
[2024-06-02 23:13:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality18242336262677294823.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/CTLCardinality2187392311461506065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18242336262677294823.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,4.19958e+10,15.8657,452204,4037,83,586203,839,1126,2.85106e+06,111,2489,0


Converting to forward existential form...Done !
original formula: (E(((EG(!(((i2.u67.p285==0)||(i7.i1.u50.p228==1)))) + (((i0.i0.u6.p50!=1) + AX((i0.i0.u105.p423==0))) * (((i10.i1.u94.p374==1)&&((i10.i1....683
=> equivalent forward existential formula: [FwdG((Init * E(((EG(!(((i2.u67.p285==0)||(i7.i1.u50.p228==1)))) + (((i0.i0.u6.p50!=1) + !(EX(!((i0.i0.u105.p423...756
Reverse transition relation is NOT exact ! Due to transitions t68, t152, t159, t187, t202, t211, t213, t220, t226, t227, t228, t259, t260, t301, t332, t337...1430
Using 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 a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 639/639 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 361 transition count 639
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 45 place count 320 transition count 576
Iterating global reduction 1 with 41 rules applied. Total rules applied 86 place count 320 transition count 576
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 320 transition count 575
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 102 place count 305 transition count 515
Iterating global reduction 2 with 15 rules applied. Total rules applied 117 place count 305 transition count 515
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 305 transition count 513
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 123 place count 301 transition count 506
Iterating global reduction 3 with 4 rules applied. Total rules applied 127 place count 301 transition count 506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 301 transition count 505
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 130 place count 299 transition count 500
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 299 transition count 500
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 297 transition count 495
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 297 transition count 495
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 138 place count 295 transition count 490
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 295 transition count 490
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 142 place count 293 transition count 485
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 293 transition count 485
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 291 transition count 480
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 291 transition count 480
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 150 place count 289 transition count 475
Iterating global reduction 4 with 2 rules applied. Total rules applied 152 place count 289 transition count 475
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 154 place count 287 transition count 470
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 287 transition count 470
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 158 place count 285 transition count 465
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 285 transition count 465
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 162 place count 283 transition count 460
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 283 transition count 460
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 166 place count 281 transition count 456
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 281 transition count 456
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 280 transition count 454
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 280 transition count 454
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 171 place count 279 transition count 452
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 279 transition count 452
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 173 place count 278 transition count 451
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 278 transition count 451
Applied a total of 174 rules in 39 ms. Remains 278 /365 variables (removed 87) and now considering 451/639 (removed 188) transitions.
// Phase 1: matrix 451 rows 278 cols
[2024-06-02 23:14:24] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:14:24] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 23:14:24] [INFO ] Invariant cache hit.
[2024-06-02 23:14:25] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 450 sub problems to find dead transitions.
[2024-06-02 23:14:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-06-02 23:14:29] [INFO ] Deduced a trap composed of 170 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:14:29] [INFO ] Deduced a trap composed of 87 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:14:29] [INFO ] Deduced a trap composed of 87 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:14:29] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:14:29] [INFO ] Deduced a trap composed of 93 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 81 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 84 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (OVERLAPS) 451/729 variables, 278/294 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-06-02 23:14:38] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:14:39] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/729 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 7 (OVERLAPS) 0/729 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 450 unsolved
No progress, stopping.
After SMT solving in domain Real declared 729/729 variables, and 296 constraints, problems are : Problem set: 0 solved, 450 unsolved in 26613 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 450 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-06-02 23:14:53] [INFO ] Deduced a trap composed of 95 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:14:53] [INFO ] Deduced a trap composed of 95 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:14:54] [INFO ] Deduced a trap composed of 95 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:14:54] [INFO ] Deduced a trap composed of 95 places in 46 ms of which 0 ms to minimize.
[2024-06-02 23:14:55] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (OVERLAPS) 451/729 variables, 278/301 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 450/751 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-06-02 23:15:03] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:15:04] [INFO ] Deduced a trap composed of 163 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/729 variables, 2/753 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-06-02 23:15:15] [INFO ] Deduced a trap composed of 180 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:15:15] [INFO ] Deduced a trap composed of 189 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:15:17] [INFO ] Deduced a trap composed of 173 places in 103 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 729/729 variables, and 756 constraints, problems are : Problem set: 0 solved, 450 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 21/21 constraints]
After SMT, in 56743ms problems are : Problem set: 0 solved, 450 unsolved
Search for dead transitions found 0 dead transitions in 56748ms
Starting structural reductions in LTL mode, iteration 1 : 278/365 places, 451/639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57100 ms. Remains : 278/365 places, 451/639 transitions.
[2024-06-02 23:15:21] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:15:21] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:15:21] [INFO ] Input system was already deterministic with 451 transitions.
[2024-06-02 23:15:21] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:15:21] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:15:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality4968539452988062763.gal : 2 ms
[2024-06-02 23:15:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality2731803679144668642.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/CTLCardinality4968539452988062763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2731803679144668642.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.83432e+10,24.3531,619976,2,24605,5,1.36678e+06,6,0,1563,2.9806e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 23:15:51] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:15:51] [INFO ] Applying decomposition
[2024-06-02 23:15:51] [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/graph15649572255692563605.txt' '-o' '/tmp/graph15649572255692563605.bin' '-w' '/tmp/graph15649572255692563605.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15649572255692563605.bin' '-l' '-1' '-v' '-w' '/tmp/graph15649572255692563605.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:15:51] [INFO ] Decomposing Gal with order
[2024-06-02 23:15:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:15:51] [INFO ] Removed a total of 433 redundant transitions.
[2024-06-02 23:15:51] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:15:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 7 ms.
[2024-06-02 23:15:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality2782499892996639646.gal : 3 ms
[2024-06-02 23:15:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality12365436721634603440.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/CTLCardinality2782499892996639646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12365436721634603440.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 639/639 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 361 transition count 639
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 50 place count 315 transition count 570
Iterating global reduction 1 with 46 rules applied. Total rules applied 96 place count 315 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 97 place count 315 transition count 569
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 114 place count 298 transition count 509
Iterating global reduction 2 with 17 rules applied. Total rules applied 131 place count 298 transition count 509
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 133 place count 298 transition count 507
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 139 place count 292 transition count 496
Iterating global reduction 3 with 6 rules applied. Total rules applied 145 place count 292 transition count 496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 292 transition count 495
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 148 place count 290 transition count 490
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 290 transition count 490
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 288 transition count 485
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 288 transition count 485
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 156 place count 286 transition count 480
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 286 transition count 480
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 160 place count 284 transition count 475
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 284 transition count 475
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 164 place count 282 transition count 470
Iterating global reduction 4 with 2 rules applied. Total rules applied 166 place count 282 transition count 470
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 168 place count 280 transition count 465
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 280 transition count 465
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 278 transition count 460
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 278 transition count 460
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 175 place count 277 transition count 457
Iterating global reduction 4 with 1 rules applied. Total rules applied 176 place count 277 transition count 457
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 177 place count 276 transition count 455
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 276 transition count 455
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 179 place count 275 transition count 453
Iterating global reduction 4 with 1 rules applied. Total rules applied 180 place count 275 transition count 453
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 181 place count 274 transition count 451
Iterating global reduction 4 with 1 rules applied. Total rules applied 182 place count 274 transition count 451
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 183 place count 273 transition count 450
Iterating global reduction 4 with 1 rules applied. Total rules applied 184 place count 273 transition count 450
Applied a total of 184 rules in 35 ms. Remains 273 /365 variables (removed 92) and now considering 450/639 (removed 189) transitions.
// Phase 1: matrix 450 rows 273 cols
[2024-06-02 23:16:22] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:16:22] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 23:16:22] [INFO ] Invariant cache hit.
[2024-06-02 23:16:22] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2024-06-02 23:16:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:16:26] [INFO ] Deduced a trap composed of 168 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:16:26] [INFO ] Deduced a trap composed of 79 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:16:26] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:16:26] [INFO ] Deduced a trap composed of 92 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:16:27] [INFO ] Deduced a trap composed of 155 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:16:27] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:16:27] [INFO ] Deduced a trap composed of 76 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:16:27] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:16:28] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:16:28] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:16:28] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:16:30] [INFO ] Deduced a trap composed of 156 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:16:34] [INFO ] Deduced a trap composed of 153 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:16:38] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:16:38] [INFO ] Deduced a trap composed of 160 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:16:41] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:16:41] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:16:42] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (OVERLAPS) 450/723 variables, 273/298 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:16:49] [INFO ] Deduced a trap composed of 108 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:16:49] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:16:50] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 723/723 variables, and 301 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:16:54] [INFO ] Deduced a trap composed of 165 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:16:54] [INFO ] Deduced a trap composed of 173 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:16:55] [INFO ] Deduced a trap composed of 94 places in 45 ms of which 0 ms to minimize.
[2024-06-02 23:16:55] [INFO ] Deduced a trap composed of 78 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:16:58] [INFO ] Deduced a trap composed of 91 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 23:17:00] [INFO ] Deduced a trap composed of 161 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:17:00] [INFO ] Deduced a trap composed of 165 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:17:00] [INFO ] Deduced a trap composed of 159 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:17:01] [INFO ] Deduced a trap composed of 101 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:17:01] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:17:01] [INFO ] Deduced a trap composed of 155 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:17:01] [INFO ] Deduced a trap composed of 156 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (OVERLAPS) 450/723 variables, 273/313 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/723 variables, 449/762 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/723 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 723/723 variables, and 762 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 33/33 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 273/365 places, 450/639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60505 ms. Remains : 273/365 places, 450/639 transitions.
[2024-06-02 23:17:22] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:17:22] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:17:22] [INFO ] Input system was already deterministic with 450 transitions.
[2024-06-02 23:17:22] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:17:22] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:17:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality7761244696455297500.gal : 2 ms
[2024-06-02 23:17:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality12224571879356080975.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/CTLCardinality7761244696455297500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12224571879356080975.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.53837e+10,29.6215,739796,2,24710,5,1.53179e+06,6,0,1542,3.18147e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 23:17:52] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:17:52] [INFO ] Applying decomposition
[2024-06-02 23:17:52] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2046112924687480584.txt' '-o' '/tmp/graph2046112924687480584.bin' '-w' '/tmp/graph2046112924687480584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2046112924687480584.bin' '-l' '-1' '-v' '-w' '/tmp/graph2046112924687480584.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:17:52] [INFO ] Decomposing Gal with order
[2024-06-02 23:17:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:17:52] [INFO ] Removed a total of 480 redundant transitions.
[2024-06-02 23:17:52] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:17:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-06-02 23:17:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality12531862543009045980.gal : 4 ms
[2024-06-02 23:17:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality3484805065599484487.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/CTLCardinality12531862543009045980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3484805065599484487.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 639/639 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 362 transition count 639
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 42 place count 323 transition count 579
Iterating global reduction 1 with 39 rules applied. Total rules applied 81 place count 323 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 323 transition count 578
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 97 place count 308 transition count 539
Iterating global reduction 2 with 15 rules applied. Total rules applied 112 place count 308 transition count 539
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 308 transition count 537
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 119 place count 303 transition count 527
Iterating global reduction 3 with 5 rules applied. Total rules applied 124 place count 303 transition count 527
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 301 transition count 522
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 301 transition count 522
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 299 transition count 517
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 299 transition count 517
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 134 place count 297 transition count 512
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 297 transition count 512
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 138 place count 295 transition count 507
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 295 transition count 507
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 142 place count 293 transition count 502
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 293 transition count 502
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 291 transition count 497
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 291 transition count 497
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 150 place count 289 transition count 492
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 289 transition count 492
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 154 place count 287 transition count 487
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 287 transition count 487
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 285 transition count 482
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 285 transition count 482
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 284 transition count 480
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 284 transition count 480
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 283 transition count 478
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 283 transition count 478
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 282 transition count 477
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 282 transition count 477
Applied a total of 166 rules in 31 ms. Remains 282 /365 variables (removed 83) and now considering 477/639 (removed 162) transitions.
// Phase 1: matrix 477 rows 282 cols
[2024-06-02 23:18:22] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:18:22] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 23:18:22] [INFO ] Invariant cache hit.
[2024-06-02 23:18:23] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2024-06-02 23:18:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 476 unsolved
[2024-06-02 23:18:27] [INFO ] Deduced a trap composed of 162 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:18:27] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:18:27] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:18:27] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 2 ms to minimize.
[2024-06-02 23:18:28] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 0 ms to minimize.
[2024-06-02 23:18:28] [INFO ] Deduced a trap composed of 79 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:18:28] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:18:29] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:18:29] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:18:30] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 476 unsolved
[2024-06-02 23:18:32] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 476 unsolved
[2024-06-02 23:18:37] [INFO ] Deduced a trap composed of 92 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (OVERLAPS) 477/758 variables, 281/300 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/758 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 8 (OVERLAPS) 1/759 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 476 unsolved
[2024-06-02 23:18:51] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 759/759 variables, and 302 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (OVERLAPS) 477/758 variables, 281/301 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/758 variables, 469/770 constraints. Problems are: Problem set: 0 solved, 476 unsolved
[2024-06-02 23:19:02] [INFO ] Deduced a trap composed of 159 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:19:02] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:19:02] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:19:03] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:19:04] [INFO ] Deduced a trap composed of 165 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:19:04] [INFO ] Deduced a trap composed of 165 places in 101 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/758 variables, 6/776 constraints. Problems are: Problem set: 0 solved, 476 unsolved
[2024-06-02 23:19:19] [INFO ] Deduced a trap composed of 161 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 758/759 variables, and 777 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 281/282 constraints, PredecessorRefiner: 469/476 constraints, Known Traps: 20/20 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in LTL mode, iteration 1 : 282/365 places, 477/639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60522 ms. Remains : 282/365 places, 477/639 transitions.
[2024-06-02 23:19:23] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:19:23] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:19:23] [INFO ] Input system was already deterministic with 477 transitions.
[2024-06-02 23:19:23] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:19:23] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:19:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality15096741589040812218.gal : 2 ms
[2024-06-02 23:19:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality5210854446514725416.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/CTLCardinality15096741589040812218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5210854446514725416.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.
Detected timeout of ITS tools.
[2024-06-02 23:19:53] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:19:53] [INFO ] Applying decomposition
[2024-06-02 23:19:53] [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/graph16228774557606222995.txt' '-o' '/tmp/graph16228774557606222995.bin' '-w' '/tmp/graph16228774557606222995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16228774557606222995.bin' '-l' '-1' '-v' '-w' '/tmp/graph16228774557606222995.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:19:53] [INFO ] Decomposing Gal with order
[2024-06-02 23:19:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:19:53] [INFO ] Removed a total of 500 redundant transitions.
[2024-06-02 23:19:53] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:19:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 5 ms.
[2024-06-02 23:19:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17474195938771121450.gal : 3 ms
[2024-06-02 23:19:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality11095052358049597896.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/CTLCardinality17474195938771121450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11095052358049597896.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 639/639 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 361 transition count 639
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 49 place count 316 transition count 572
Iterating global reduction 1 with 45 rules applied. Total rules applied 94 place count 316 transition count 572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 316 transition count 571
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 111 place count 300 transition count 512
Iterating global reduction 2 with 16 rules applied. Total rules applied 127 place count 300 transition count 512
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 300 transition count 511
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 132 place count 296 transition count 504
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 296 transition count 504
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 295 transition count 501
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 295 transition count 501
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 294 transition count 499
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 294 transition count 499
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 293 transition count 496
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 293 transition count 496
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 292 transition count 494
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 292 transition count 494
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 291 transition count 491
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 291 transition count 491
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 290 transition count 489
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 290 transition count 489
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 289 transition count 486
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 289 transition count 486
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 288 transition count 484
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 288 transition count 484
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 287 transition count 481
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 287 transition count 481
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 286 transition count 479
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 286 transition count 479
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 285 transition count 477
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 285 transition count 477
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 284 transition count 475
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 284 transition count 475
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 283 transition count 474
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 283 transition count 474
Applied a total of 162 rules in 31 ms. Remains 283 /365 variables (removed 82) and now considering 474/639 (removed 165) transitions.
// Phase 1: matrix 474 rows 283 cols
[2024-06-02 23:20:23] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:20:23] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 23:20:23] [INFO ] Invariant cache hit.
[2024-06-02 23:20:24] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-06-02 23:20:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:20:28] [INFO ] Deduced a trap composed of 153 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:20:28] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 0 ms to minimize.
[2024-06-02 23:20:28] [INFO ] Deduced a trap composed of 79 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 79 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 5 ms to minimize.
[2024-06-02 23:20:30] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:20:30] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:20:32] [INFO ] Deduced a trap composed of 154 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:20:32] [INFO ] Deduced a trap composed of 166 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:20:33] [INFO ] Deduced a trap composed of 163 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:20:33] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:20:34] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:20:34] [INFO ] Deduced a trap composed of 183 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 474/757 variables, 283/306 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 757/757 variables, and 306 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:20:56] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 474/757 variables, 283/307 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 473/780 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:21:13] [INFO ] Deduced a trap composed of 99 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 1/781 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 757/757 variables, and 781 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 18/18 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 283/365 places, 474/639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60589 ms. Remains : 283/365 places, 474/639 transitions.
[2024-06-02 23:21:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:21:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:21:24] [INFO ] Input system was already deterministic with 474 transitions.
[2024-06-02 23:21:24] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:21:24] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:21:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality11577214380303238102.gal : 2 ms
[2024-06-02 23:21:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality17050517584854322700.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/CTLCardinality11577214380303238102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17050517584854322700.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.
Detected timeout of ITS tools.
[2024-06-02 23:21:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:21:54] [INFO ] Applying decomposition
[2024-06-02 23:21:54] [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/graph2507823674763773445.txt' '-o' '/tmp/graph2507823674763773445.bin' '-w' '/tmp/graph2507823674763773445.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2507823674763773445.bin' '-l' '-1' '-v' '-w' '/tmp/graph2507823674763773445.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:21:54] [INFO ] Decomposing Gal with order
[2024-06-02 23:21:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:21:54] [INFO ] Removed a total of 516 redundant transitions.
[2024-06-02 23:21:54] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:21:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2024-06-02 23:21:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13753087382029257678.gal : 4 ms
[2024-06-02 23:21:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality1167062757664617912.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/CTLCardinality13753087382029257678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1167062757664617912.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 639/639 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 361 transition count 639
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 52 place count 313 transition count 568
Iterating global reduction 1 with 48 rules applied. Total rules applied 100 place count 313 transition count 568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 313 transition count 567
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 120 place count 294 transition count 503
Iterating global reduction 2 with 19 rules applied. Total rules applied 139 place count 294 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 141 place count 294 transition count 501
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 147 place count 288 transition count 490
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 288 transition count 490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 288 transition count 489
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 156 place count 286 transition count 484
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 286 transition count 484
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 160 place count 284 transition count 479
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 284 transition count 479
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 164 place count 282 transition count 474
Iterating global reduction 4 with 2 rules applied. Total rules applied 166 place count 282 transition count 474
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 168 place count 280 transition count 469
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 280 transition count 469
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 278 transition count 464
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 278 transition count 464
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 176 place count 276 transition count 459
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 276 transition count 459
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 180 place count 274 transition count 454
Iterating global reduction 4 with 2 rules applied. Total rules applied 182 place count 274 transition count 454
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 184 place count 272 transition count 449
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 272 transition count 449
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 188 place count 270 transition count 444
Iterating global reduction 4 with 2 rules applied. Total rules applied 190 place count 270 transition count 444
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 192 place count 268 transition count 440
Iterating global reduction 4 with 2 rules applied. Total rules applied 194 place count 268 transition count 440
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 196 place count 266 transition count 436
Iterating global reduction 4 with 2 rules applied. Total rules applied 198 place count 266 transition count 436
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 200 place count 264 transition count 433
Iterating global reduction 4 with 2 rules applied. Total rules applied 202 place count 264 transition count 433
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 203 place count 263 transition count 432
Iterating global reduction 4 with 1 rules applied. Total rules applied 204 place count 263 transition count 432
Applied a total of 204 rules in 31 ms. Remains 263 /365 variables (removed 102) and now considering 432/639 (removed 207) transitions.
// Phase 1: matrix 432 rows 263 cols
[2024-06-02 23:22:24] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:22:24] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 23:22:24] [INFO ] Invariant cache hit.
[2024-06-02 23:22:24] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-06-02 23:22:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-02 23:22:28] [INFO ] Deduced a trap composed of 166 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:22:28] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:22:28] [INFO ] Deduced a trap composed of 76 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:22:29] [INFO ] Deduced a trap composed of 149 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:22:29] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:22:29] [INFO ] Deduced a trap composed of 76 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:22:29] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:22:30] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:22:30] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 432/695 variables, 263/279 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-02 23:22:36] [INFO ] Deduced a trap composed of 106 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:22:36] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-02 23:22:41] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 8 (OVERLAPS) 0/695 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 431 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 282 constraints, problems are : Problem set: 0 solved, 431 unsolved in 28011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 432/695 variables, 263/282 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 431/713 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-02 23:23:00] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:23:01] [INFO ] Deduced a trap composed of 153 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:23:01] [INFO ] Deduced a trap composed of 146 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:23:01] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 4/717 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-02 23:23:12] [INFO ] Deduced a trap composed of 158 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:23:14] [INFO ] Deduced a trap composed of 162 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:23:14] [INFO ] Deduced a trap composed of 158 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:23:19] [INFO ] Deduced a trap composed of 163 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 4/721 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 695/695 variables, and 721 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 20/20 constraints]
After SMT, in 58127ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 58131ms
Starting structural reductions in LTL mode, iteration 1 : 263/365 places, 432/639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58479 ms. Remains : 263/365 places, 432/639 transitions.
[2024-06-02 23:23:22] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:23:22] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:23:22] [INFO ] Input system was already deterministic with 432 transitions.
[2024-06-02 23:23:23] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:23:23] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:23:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality8458242364903181779.gal : 2 ms
[2024-06-02 23:23:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality3818499309057745700.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/CTLCardinality8458242364903181779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3818499309057745700.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.43326e+10,23.7243,610408,2,23080,5,1.36489e+06,6,0,1484,2.96742e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 23:23:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:23:53] [INFO ] Applying decomposition
[2024-06-02 23:23:53] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4737205975605552925.txt' '-o' '/tmp/graph4737205975605552925.bin' '-w' '/tmp/graph4737205975605552925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4737205975605552925.bin' '-l' '-1' '-v' '-w' '/tmp/graph4737205975605552925.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:23:53] [INFO ] Decomposing Gal with order
[2024-06-02 23:23:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:23:53] [INFO ] Removed a total of 456 redundant transitions.
[2024-06-02 23:23:53] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:23:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2024-06-02 23:23:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality5454662241635762233.gal : 2 ms
[2024-06-02 23:23:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality10389478181917212612.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/CTLCardinality5454662241635762233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10389478181917212612.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,2.43326e+10,7.54888,231884,2572,64,289664,639,968,1.44712e+06,73,2152,0


Converting to forward existential form...Done !
original formula: AG(EX(AX((i2.i1.u42.p180==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(!((i2.i1.u42.p180==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t56, t63, t140, t147, t185, t186, t188, t197, t206, t214, t219, t224, t229, t234, t244, t245,...1074
(forward)formula 0,0,9.54636,231884,1,0,289664,680,4715,1.44712e+06,315,2573,568738
FORMULA FireWire-PT-18-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 365/365 places, 639/639 transitions.
Graph (trivial) has 262 edges and 365 vertex of which 11 / 365 are part of one of the 3 SCC in 2 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1157 edges and 357 vertex of which 353 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 352 transition count 577
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 300 transition count 575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 299 transition count 575
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 109 place count 299 transition count 560
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 139 place count 284 transition count 560
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 167 place count 256 transition count 509
Iterating global reduction 3 with 28 rules applied. Total rules applied 195 place count 256 transition count 509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 256 transition count 508
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 196 place count 256 transition count 504
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 204 place count 252 transition count 504
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 216 place count 240 transition count 470
Iterating global reduction 4 with 12 rules applied. Total rules applied 228 place count 240 transition count 470
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 4 with 2 rules applied. Total rules applied 230 place count 240 transition count 468
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 239 transition count 468
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 234 place count 236 transition count 463
Iterating global reduction 6 with 3 rules applied. Total rules applied 237 place count 236 transition count 463
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 6 with 2 rules applied. Total rules applied 239 place count 236 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 240 place count 235 transition count 461
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 286 place count 212 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 288 place count 212 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 289 place count 211 transition count 436
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 294 place count 206 transition count 408
Iterating global reduction 10 with 5 rules applied. Total rules applied 299 place count 206 transition count 408
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 300 place count 206 transition count 407
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 302 place count 204 transition count 401
Iterating global reduction 11 with 2 rules applied. Total rules applied 304 place count 204 transition count 401
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 306 place count 202 transition count 397
Iterating global reduction 11 with 2 rules applied. Total rules applied 308 place count 202 transition count 397
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 310 place count 200 transition count 391
Iterating global reduction 11 with 2 rules applied. Total rules applied 312 place count 200 transition count 391
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 314 place count 198 transition count 387
Iterating global reduction 11 with 2 rules applied. Total rules applied 316 place count 198 transition count 387
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 318 place count 196 transition count 381
Iterating global reduction 11 with 2 rules applied. Total rules applied 320 place count 196 transition count 381
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 322 place count 194 transition count 377
Iterating global reduction 11 with 2 rules applied. Total rules applied 324 place count 194 transition count 377
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 326 place count 192 transition count 371
Iterating global reduction 11 with 2 rules applied. Total rules applied 328 place count 192 transition count 371
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 330 place count 190 transition count 367
Iterating global reduction 11 with 2 rules applied. Total rules applied 332 place count 190 transition count 367
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 334 place count 188 transition count 361
Iterating global reduction 11 with 2 rules applied. Total rules applied 336 place count 188 transition count 361
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 338 place count 186 transition count 357
Iterating global reduction 11 with 2 rules applied. Total rules applied 340 place count 186 transition count 357
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 342 place count 184 transition count 353
Iterating global reduction 11 with 2 rules applied. Total rules applied 344 place count 184 transition count 353
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 346 place count 182 transition count 349
Iterating global reduction 11 with 2 rules applied. Total rules applied 348 place count 182 transition count 349
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 350 place count 182 transition count 349
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 351 place count 181 transition count 348
Applied a total of 351 rules in 83 ms. Remains 181 /365 variables (removed 184) and now considering 348/639 (removed 291) transitions.
[2024-06-02 23:24:02] [INFO ] Flow matrix only has 344 transitions (discarded 4 similar events)
// Phase 1: matrix 344 rows 181 cols
[2024-06-02 23:24:02] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:24:02] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 23:24:02] [INFO ] Flow matrix only has 344 transitions (discarded 4 similar events)
[2024-06-02 23:24:02] [INFO ] Invariant cache hit.
[2024-06-02 23:24:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:24:03] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-06-02 23:24:03] [INFO ] Redundant transitions in 4 ms returned []
Running 344 sub problems to find dead transitions.
[2024-06-02 23:24:03] [INFO ] Flow matrix only has 344 transitions (discarded 4 similar events)
[2024-06-02 23:24:03] [INFO ] Invariant cache hit.
[2024-06-02 23:24:03] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/181 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 23:24:05] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:24:05] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 0 ms to minimize.
[2024-06-02 23:24:05] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:24:06] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:24:06] [INFO ] Deduced a trap composed of 127 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:24:06] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:24:06] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:24:06] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 23:24:08] [INFO ] Deduced a trap composed of 106 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:24:09] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (OVERLAPS) 343/524 variables, 181/198 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 10 (OVERLAPS) 0/524 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 344 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/525 variables, and 201 constraints, problems are : Problem set: 0 solved, 344 unsolved in 17216 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (OVERLAPS) 1/181 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (OVERLAPS) 343/524 variables, 181/199 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 344/545 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 10 (OVERLAPS) 0/524 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 344 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/525 variables, and 545 constraints, problems are : Problem set: 0 solved, 344 unsolved in 22356 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 11/11 constraints]
After SMT, in 39682ms problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 39684ms
Starting structural reductions in SI_CTL mode, iteration 1 : 181/365 places, 348/639 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40027 ms. Remains : 181/365 places, 348/639 transitions.
[2024-06-02 23:24:42] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:24:42] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:24:42] [INFO ] Input system was already deterministic with 348 transitions.
[2024-06-02 23:24:42] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:24:42] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:24:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality7157923896506110685.gal : 2 ms
[2024-06-02 23:24:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality5114309734903413864.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/CTLCardinality7157923896506110685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5114309734903413864.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.
Detected timeout of ITS tools.
[2024-06-02 23:25:12] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:25:12] [INFO ] Applying decomposition
[2024-06-02 23:25:12] [INFO ] Flatten gal took : 8 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/graph18165910725147609965.txt' '-o' '/tmp/graph18165910725147609965.bin' '-w' '/tmp/graph18165910725147609965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18165910725147609965.bin' '-l' '-1' '-v' '-w' '/tmp/graph18165910725147609965.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:25:12] [INFO ] Decomposing Gal with order
[2024-06-02 23:25:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:25:12] [INFO ] Removed a total of 435 redundant transitions.
[2024-06-02 23:25:12] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:25:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 4 ms.
[2024-06-02 23:25:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality4875480731286301430.gal : 2 ms
[2024-06-02 23:25:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality3985397101827296238.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/CTLCardinality4875480731286301430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3985397101827296238.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.09933e+09,7.42023,201100,1535,66,248097,1027,783,1.14319e+06,79,3688,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(((i7.u36.p272==0)&&(i0.i0.u21.p149==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U ((i7.u36.p272==0)&&(i0.i0.u21.p149==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t70, t84, t88, t92, t93, t96, t97, t125, t134, t135, t173, t196, t208, t209, t210, t211, t212...962
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 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
(forward)formula 0,1,14.6538,255220,1,0,313211,1568,4989,1.52516e+06,392,5569,945452
FORMULA FireWire-PT-18-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 639/639 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 361 transition count 639
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 48 place count 317 transition count 572
Iterating global reduction 1 with 44 rules applied. Total rules applied 92 place count 317 transition count 572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 93 place count 317 transition count 571
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 109 place count 301 transition count 513
Iterating global reduction 2 with 16 rules applied. Total rules applied 125 place count 301 transition count 513
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 301 transition count 511
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 133 place count 295 transition count 500
Iterating global reduction 3 with 6 rules applied. Total rules applied 139 place count 295 transition count 500
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 295 transition count 499
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 142 place count 293 transition count 494
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 293 transition count 494
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 291 transition count 489
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 291 transition count 489
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 150 place count 289 transition count 484
Iterating global reduction 4 with 2 rules applied. Total rules applied 152 place count 289 transition count 484
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 153 place count 288 transition count 482
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 288 transition count 482
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 287 transition count 479
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 287 transition count 479
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 286 transition count 477
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 286 transition count 477
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 159 place count 285 transition count 474
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 285 transition count 474
Applied a total of 160 rules in 28 ms. Remains 285 /365 variables (removed 80) and now considering 474/639 (removed 165) transitions.
// Phase 1: matrix 474 rows 285 cols
[2024-06-02 23:25:27] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:25:27] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 23:25:27] [INFO ] Invariant cache hit.
[2024-06-02 23:25:27] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-06-02 23:25:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:25:32] [INFO ] Deduced a trap composed of 198 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:25:32] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:25:32] [INFO ] Deduced a trap composed of 78 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:25:32] [INFO ] Deduced a trap composed of 90 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:25:33] [INFO ] Deduced a trap composed of 161 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:25:33] [INFO ] Deduced a trap composed of 120 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:25:33] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:25:33] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:25:33] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:25:33] [INFO ] Deduced a trap composed of 78 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:25:33] [INFO ] Deduced a trap composed of 92 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:25:34] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:25:34] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 474/759 variables, 285/305 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:25:41] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:25:43] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/759 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 759/759 variables, and 307 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 474/759 variables, 285/307 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/759 variables, 473/780 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:26:06] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 1/781 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 759/759 variables, and 781 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 16/16 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 285/365 places, 474/639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60534 ms. Remains : 285/365 places, 474/639 transitions.
[2024-06-02 23:26:28] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:26:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:26:28] [INFO ] Input system was already deterministic with 474 transitions.
[2024-06-02 23:26:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:26:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:26:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality9271949452732016210.gal : 2 ms
[2024-06-02 23:26:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality5295707699929285309.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/CTLCardinality9271949452732016210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5295707699929285309.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.
Detected timeout of ITS tools.
[2024-06-02 23:26:58] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:26:58] [INFO ] Applying decomposition
[2024-06-02 23:26:58] [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/graph11012399117058954591.txt' '-o' '/tmp/graph11012399117058954591.bin' '-w' '/tmp/graph11012399117058954591.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11012399117058954591.bin' '-l' '-1' '-v' '-w' '/tmp/graph11012399117058954591.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:26:58] [INFO ] Decomposing Gal with order
[2024-06-02 23:26:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:26:58] [INFO ] Removed a total of 514 redundant transitions.
[2024-06-02 23:26:58] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:26:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 4 ms.
[2024-06-02 23:26:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality1067175129010273864.gal : 3 ms
[2024-06-02 23:26:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality5883120299590754048.ctl : 37 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/CTLCardinality1067175129010273864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5883120299590754048.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.6705e+10,8.23978,226180,2715,67,322738,646,1080,1.21189e+06,86,2561,0


Converting to forward existential form...Done !
original formula: A((A((i1.u10.p5==1) U AF(AX((i5.i1.u30.p142==0)))) * (((!(AG(((((i9.i1.u85.p361==0)||(i4.i1.u23.p115==0))||(i8.i0.u61.p275==1)) * A((i9.i...448
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!((EG((i4.i1.u44.p182==1)) + E((i0.i1.u47.p202!=1) U ((i3.u18.p92==1)||(i9.i2.u90.p372==...1648
Reverse transition relation is NOT exact ! Due to transitions t67, t156, t192, t198, t216, t221, t222, t224, t229, t234, t239, t244, t248, t253, t255, t256...1159
Using 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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 639/639 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 361 transition count 639
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 51 place count 314 transition count 569
Iterating global reduction 1 with 47 rules applied. Total rules applied 98 place count 314 transition count 569
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 314 transition count 568
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 118 place count 295 transition count 504
Iterating global reduction 2 with 19 rules applied. Total rules applied 137 place count 295 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 139 place count 295 transition count 502
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 145 place count 289 transition count 491
Iterating global reduction 3 with 6 rules applied. Total rules applied 151 place count 289 transition count 491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 289 transition count 490
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 154 place count 287 transition count 485
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 287 transition count 485
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 158 place count 285 transition count 480
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 285 transition count 480
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 162 place count 283 transition count 475
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 283 transition count 475
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 166 place count 281 transition count 470
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 281 transition count 470
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 170 place count 279 transition count 465
Iterating global reduction 4 with 2 rules applied. Total rules applied 172 place count 279 transition count 465
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 277 transition count 460
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 277 transition count 460
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 178 place count 275 transition count 455
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 275 transition count 455
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 182 place count 273 transition count 450
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 273 transition count 450
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 186 place count 271 transition count 445
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 271 transition count 445
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 190 place count 269 transition count 441
Iterating global reduction 4 with 2 rules applied. Total rules applied 192 place count 269 transition count 441
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 194 place count 267 transition count 437
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 267 transition count 437
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 198 place count 265 transition count 434
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 265 transition count 434
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 264 transition count 433
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 264 transition count 433
Applied a total of 202 rules in 28 ms. Remains 264 /365 variables (removed 101) and now considering 433/639 (removed 206) transitions.
// Phase 1: matrix 433 rows 264 cols
[2024-06-02 23:27:28] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:27:28] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 23:27:28] [INFO ] Invariant cache hit.
[2024-06-02 23:27:28] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2024-06-02 23:27:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 23:27:32] [INFO ] Deduced a trap composed of 152 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:27:32] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:27:33] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:27:33] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
[2024-06-02 23:27:33] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:27:33] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:27:33] [INFO ] Deduced a trap composed of 76 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:27:34] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:27:34] [INFO ] Deduced a trap composed of 76 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 433/697 variables, 264/280 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 23:27:44] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-06-02 23:27:44] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-06-02 23:27:44] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:27:45] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/697 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 23:27:53] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 697/697 variables, and 285 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 433/697 variables, 264/285 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 432/717 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 23:28:06] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 23:28:16] [INFO ] Deduced a trap composed of 117 places in 96 ms of which 1 ms to minimize.
[2024-06-02 23:28:21] [INFO ] Deduced a trap composed of 163 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/697 variables, and 720 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 17/17 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 264/365 places, 433/639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60484 ms. Remains : 264/365 places, 433/639 transitions.
[2024-06-02 23:28:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:28:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:28:28] [INFO ] Input system was already deterministic with 433 transitions.
[2024-06-02 23:28:28] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:28:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:28:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality13099998009196050393.gal : 2 ms
[2024-06-02 23:28:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality6441647035602182764.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/CTLCardinality13099998009196050393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6441647035602182764.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.43768e+10,26.1417,654380,2,23395,5,1.37668e+06,6,0,1489,3.04343e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.43768e+10,13.4688,416284,3036,97,622516,983,952,2.71359e+06,110,3780,0


Converting to forward existential form...Done !
original formula: AG(EF(EX(EX(((i1.i1.u9.p54==0)||(i6.u23.p169==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX(EX(((i1.i1.u9.p54==0)||(i6.u23.p169==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t56, t63, t140, t147, t186, t187, t189, t198, t200, t207, t212, t213, t215, t234, t238, t246,...1197
(forward)formula 0,0,16.7536,416284,1,0,622516,2363,5522,2.71359e+06,524,8218,814622
FORMULA FireWire-PT-18-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 639/639 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 362 transition count 639
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 43 place count 322 transition count 595
Iterating global reduction 1 with 40 rules applied. Total rules applied 83 place count 322 transition count 595
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 322 transition count 594
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 95 place count 311 transition count 559
Iterating global reduction 2 with 11 rules applied. Total rules applied 106 place count 311 transition count 559
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 111 place count 306 transition count 550
Iterating global reduction 2 with 5 rules applied. Total rules applied 116 place count 306 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 306 transition count 549
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 304 transition count 544
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 304 transition count 544
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 302 transition count 539
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 302 transition count 539
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 300 transition count 534
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 300 transition count 534
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 299 transition count 531
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 299 transition count 531
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 298 transition count 529
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 298 transition count 529
Applied a total of 133 rules in 27 ms. Remains 298 /365 variables (removed 67) and now considering 529/639 (removed 110) transitions.
// Phase 1: matrix 529 rows 298 cols
[2024-06-02 23:29:15] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:29:16] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 23:29:16] [INFO ] Invariant cache hit.
[2024-06-02 23:29:16] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 528 sub problems to find dead transitions.
[2024-06-02 23:29:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-06-02 23:29:21] [INFO ] Deduced a trap composed of 163 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:29:21] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:29:22] [INFO ] Deduced a trap composed of 92 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:29:22] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:29:23] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:29:23] [INFO ] Deduced a trap composed of 79 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:29:24] [INFO ] Deduced a trap composed of 191 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:29:24] [INFO ] Deduced a trap composed of 83 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-06-02 23:29:25] [INFO ] Deduced a trap composed of 162 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:29:25] [INFO ] Deduced a trap composed of 172 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:29:25] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:29:26] [INFO ] Deduced a trap composed of 96 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:29:27] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-06-02 23:29:32] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:29:32] [INFO ] Deduced a trap composed of 170 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:29:32] [INFO ] Deduced a trap composed of 158 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:29:32] [INFO ] Deduced a trap composed of 176 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:29:33] [INFO ] Deduced a trap composed of 170 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-06-02 23:29:37] [INFO ] Deduced a trap composed of 177 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:29:37] [INFO ] Deduced a trap composed of 168 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:29:37] [INFO ] Deduced a trap composed of 171 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:29:38] [INFO ] Deduced a trap composed of 169 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:29:38] [INFO ] Deduced a trap composed of 169 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:29:38] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-06-02 23:29:42] [INFO ] Deduced a trap composed of 140 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 528 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/827 variables, and 32 constraints, problems are : Problem set: 0 solved, 528 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/298 constraints, PredecessorRefiner: 528/528 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 528 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-06-02 23:29:49] [INFO ] Deduced a trap composed of 172 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:29:50] [INFO ] Deduced a trap composed of 187 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:29:50] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:29:50] [INFO ] Deduced a trap composed of 103 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-06-02 23:29:54] [INFO ] Deduced a trap composed of 170 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 6 (OVERLAPS) 529/826 variables, 297/334 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/826 variables, 525/859 constraints. Problems are: Problem set: 0 solved, 528 unsolved
[2024-06-02 23:30:08] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:30:12] [INFO ] Deduced a trap composed of 100 places in 55 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/827 variables, and 861 constraints, problems are : Problem set: 0 solved, 528 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/298 constraints, PredecessorRefiner: 525/528 constraints, Known Traps: 32/32 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 528 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Starting structural reductions in LTL mode, iteration 1 : 298/365 places, 529/639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60603 ms. Remains : 298/365 places, 529/639 transitions.
[2024-06-02 23:30:16] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:30:16] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:30:16] [INFO ] Input system was already deterministic with 529 transitions.
[2024-06-02 23:30:16] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:30:16] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:30:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality2479922478923854147.gal : 2 ms
[2024-06-02 23:30:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15564632213386613919.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/CTLCardinality2479922478923854147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15564632213386613919.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.
Detected timeout of ITS tools.
[2024-06-02 23:30:46] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:30:46] [INFO ] Applying decomposition
[2024-06-02 23:30:46] [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/graph8682131507484597159.txt' '-o' '/tmp/graph8682131507484597159.bin' '-w' '/tmp/graph8682131507484597159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8682131507484597159.bin' '-l' '-1' '-v' '-w' '/tmp/graph8682131507484597159.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:30:46] [INFO ] Decomposing Gal with order
[2024-06-02 23:30:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:30:46] [INFO ] Removed a total of 581 redundant transitions.
[2024-06-02 23:30:46] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:30:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 4 ms.
[2024-06-02 23:30:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality11495141028071727285.gal : 3 ms
[2024-06-02 23:30:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality3656934403490176435.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/CTLCardinality11495141028071727285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3656934403490176435.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,4.53488e+10,19.7915,631124,3801,79,812454,2943,1109,4.83335e+06,97,14350,0


Converting to forward existential form...Done !
original formula: (EF((i10.u92.p306==1)) + ((AX((A(((i4.i0.u22.p95==0)||(i0.u34.p142==1)) U (i12.i1.u105.p382==1)) * EX((i12.i1.u105.p435==1)))) * EX(((i4....512
=> equivalent forward existential formula: (((([(FwdU(EY((Init * !(E(TRUE U (i10.u92.p306==1))))),!((i12.i1.u105.p382==1))) * (!(((i4.i0.u22.p95==0)||(i0.u...1037
Reverse transition relation is NOT exact ! Due to transitions t59, t66, t115, t152, t159, t199, t201, t202, t204, t213, t222, t227, t228, t230, t235, t240,...1256
Using 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 1
Fast SCC detection found a local 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
Detected timeout of ITS tools.
[2024-06-02 23:31:16] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:31:16] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:31:16] [INFO ] Applying decomposition
[2024-06-02 23:31:16] [INFO ] Flatten gal took : 14 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/graph8459995952107682193.txt' '-o' '/tmp/graph8459995952107682193.bin' '-w' '/tmp/graph8459995952107682193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8459995952107682193.bin' '-l' '-1' '-v' '-w' '/tmp/graph8459995952107682193.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:31:16] [INFO ] Decomposing Gal with order
[2024-06-02 23:31:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:31:16] [INFO ] Removed a total of 661 redundant transitions.
[2024-06-02 23:31:16] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:31:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 6 ms.
[2024-06-02 23:31:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality572758177440167826.gal : 3 ms
[2024-06-02 23:31:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality10716581276083716742.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/CTLCardinality572758177440167826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10716581276083716742.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 9 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.01801e+11,72.6562,2131580,5959,196,1.51211e+06,13841,1369,2.16853e+07,138,83263,0


Converting to forward existential form...Done !
original formula: AX(AG(((i2.u32.p115==0)||(i10.i0.u109.p385==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(((i2.u32.p115==0)||(i10.i0.u109.p385==1))))] = FALSE
(forward)formula 0,0,104.429,2131580,1,0,1.51211e+06,13841,3146,2.16853e+07,255,83263,3612995
FORMULA FireWire-PT-18-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(EF(((A((((i10.i2.u114.p383==0)||(i1.i0.u25.p98==1))&&(i4.i0.u12.p44==1)) U (((i6.u104.p367==0)||(i8.i0.u45.p153==1))&&((i5.i3.u71.p255=...409
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((!((E(!((((i6.u104.p367==0)||(i8.i0.u45.p153==1))&&((i5.i3.u71.p255==0)||(i8.i0.u43.p148==...686
Reverse transition relation is NOT exact ! Due to transitions t75, t83, t173, t191, t225, t235, t244, t245, t252, t268, t276, t307, t370, t371, t373, t375,...1910
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-06-02 23:33:32] [INFO ] Applying decomposition
[2024-06-02 23:33:32] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:33:32] [INFO ] Decomposing Gal with order
[2024-06-02 23:33:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:33:32] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-02 23:33:32] [INFO ] Flatten gal took : 30 ms
[2024-06-02 23:33:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 376 labels/synchronizations in 3 ms.
[2024-06-02 23:33:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality10862589020794991998.gal : 2 ms
[2024-06-02 23:33:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality9075304751115385816.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/CTLCardinality10862589020794991998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9075304751115385816.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 8 CTL formulae.
ITS-tools command line returned an error code 137
[2024-06-02 23:45:19] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:45:19] [INFO ] Input system was already deterministic with 639 transitions.
[2024-06-02 23:45:19] [INFO ] Transformed 365 places.
[2024-06-02 23:45:19] [INFO ] Transformed 639 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-06-02 23:45:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality13329441631080625318.gal : 7 ms
[2024-06-02 23:45:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17140827954547865098.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/CTLCardinality13329441631080625318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17140827954547865098.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 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.01801e+11,278.333,5069328,2,62103,5,1.10962e+07,6,0,2089,2.78182e+07,0


Converting to forward existential form...Done !
original formula: E(EF(((A((((p383==0)||(p98==1))&&(p44==1)) U (((p367==0)||(p153==1))&&((p255==0)||(p148==1)))) + EF(((p203==0)||(p378==1)))) + ((p137==0)...255
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((!((E(!((((p367==0)||(p153==1))&&((p255==0)||(p148==1)))) U (!((((p383==0)||(p98==1))&&(p4...456
Reverse transition relation is NOT exact ! Due to transitions t4, t10, t12, t13, t19, t28, t30, t34, t41, t50, t53, t58, t59, t65, t71, t75, t76, t80, t83,...1131

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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="FireWire-PT-18"
export BK_EXAMINATION="CTLCardinality"
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 FireWire-PT-18, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734899000305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-18.tgz
mv FireWire-PT-18 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;