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

About the Execution of ITS-Tools for FireWire-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3256.027 1083574.00 1222187.00 2825.20 TFTTTFTFTFTTTTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K 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 100K 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-09-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717361675196

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 20:54:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:54:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:54:36] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-06-02 20:54:36] [INFO ] Transformed 130 places.
[2024-06-02 20:54:36] [INFO ] Transformed 408 transitions.
[2024-06-02 20:54:36] [INFO ] Found NUPN structural information;
[2024-06-02 20:54:36] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Support contains 85 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 352/352 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 130 transition count 346
Applied a total of 6 rules in 23 ms. Remains 130 /130 variables (removed 0) and now considering 346/352 (removed 6) transitions.
[2024-06-02 20:54:36] [INFO ] Flow matrix only has 320 transitions (discarded 26 similar events)
// Phase 1: matrix 320 rows 130 cols
[2024-06-02 20:54:36] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 20:54:36] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-06-02 20:54:36] [INFO ] Flow matrix only has 320 transitions (discarded 26 similar events)
[2024-06-02 20:54:36] [INFO ] Invariant cache hit.
[2024-06-02 20:54:37] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:54:37] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-06-02 20:54:37] [INFO ] Flow matrix only has 320 transitions (discarded 26 similar events)
[2024-06-02 20:54:37] [INFO ] Invariant cache hit.
[2024-06-02 20:54:37] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-06-02 20:54:40] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 8 ms to minimize.
[2024-06-02 20:54:40] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-06-02 20:54:40] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2024-06-02 20:54:41] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:54:41] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-06-02 20:54:41] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-02 20:54:42] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 7/145 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-06-02 20:54:42] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:54:43] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 319/449 variables, 130/277 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 44/321 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 10 (OVERLAPS) 1/450 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 12 (OVERLAPS) 0/450 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 322 constraints, problems are : Problem set: 0 solved, 345 unsolved in 18327 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 9/147 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 319/449 variables, 130/277 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 44/321 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 345/666 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-06-02 20:55:02] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:55:03] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 2/668 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 11 (OVERLAPS) 1/450 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 669 constraints, problems are : Problem set: 0 solved, 345 unsolved in 30036 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 11/11 constraints]
After SMT, in 48731ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 48747ms
Starting structural reductions in LTL mode, iteration 1 : 130/130 places, 346/352 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49276 ms. Remains : 130/130 places, 346/352 transitions.
Support contains 85 out of 130 places after structural reductions.
[2024-06-02 20:55:26] [INFO ] Flatten gal took : 51 ms
[2024-06-02 20:55:26] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:55:26] [INFO ] Input system was already deterministic with 346 transitions.
Support contains 83 out of 130 places (down from 85) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 89 to 87
RANDOM walk for 40000 steps (2167 resets) in 1962 ms. (20 steps per ms) remains 41/87 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (51 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (114 resets) in 44 ms. (88 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (67 resets) in 48 ms. (81 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (69 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (107 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (57 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (105 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (17 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (52 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (58 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (14 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (56 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (51 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (37 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (77 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (57 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (71 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (51 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (52 resets) in 27 ms. (143 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (66 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (58 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (115 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (62 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (115 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
[2024-06-02 20:55:27] [INFO ] Flow matrix only has 320 transitions (discarded 26 similar events)
[2024-06-02 20:55:27] [INFO ] Invariant cache hit.
[2024-06-02 20:55:27] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 2 (OVERLAPS) 78/126 variables, 7/55 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 78/133 constraints. Problems are: Problem set: 3 solved, 35 unsolved
[2024-06-02 20:55:27] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:55:27] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:55:27] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/136 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/136 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 2/128 variables, 1/137 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 2/139 constraints. Problems are: Problem set: 3 solved, 35 unsolved
[2024-06-02 20:55:27] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 1/140 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/140 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 319/447 variables, 128/268 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 44/312 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 0/312 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 2/449 variables, 2/314 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/449 variables, 2/316 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 0/316 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 16 (OVERLAPS) 1/450 variables, 1/317 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 0/317 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 18 (OVERLAPS) 0/450 variables, 0/317 constraints. Problems are: Problem set: 3 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 317 constraints, problems are : Problem set: 3 solved, 35 unsolved in 2199 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 81/126 variables, 7/52 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 81/133 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/136 constraints. Problems are: Problem set: 3 solved, 35 unsolved
[2024-06-02 20:55:29] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/137 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/137 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 2/128 variables, 1/138 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 2/140 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/141 constraints. Problems are: Problem set: 3 solved, 35 unsolved
[2024-06-02 20:55:29] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 4 ms to minimize.
[2024-06-02 20:55:29] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 2/143 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/143 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 319/447 variables, 128/271 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 44/315 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 34/349 constraints. Problems are: Problem set: 3 solved, 35 unsolved
[2024-06-02 20:55:30] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 1/350 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/447 variables, 0/350 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 17 (OVERLAPS) 2/449 variables, 2/352 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/449 variables, 2/354 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/449 variables, 1/355 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/449 variables, 0/355 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 21 (OVERLAPS) 1/450 variables, 1/356 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/450 variables, 0/356 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 23 (OVERLAPS) 0/450 variables, 0/356 constraints. Problems are: Problem set: 3 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 356 constraints, problems are : Problem set: 3 solved, 35 unsolved in 5010 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 35/38 constraints, Known Traps: 8/8 constraints]
After SMT, in 7260ms problems are : Problem set: 3 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 346/346 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 343
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 128 transition count 339
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 128 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 128 transition count 338
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 10 place count 127 transition count 337
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 125 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 18 place count 125 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 125 transition count 335
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 124 transition count 334
Applied a total of 21 rules in 75 ms. Remains 124 /130 variables (removed 6) and now considering 334/346 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 124/130 places, 334/346 transitions.
RANDOM walk for 40000 steps (2311 resets) in 769 ms. (51 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (54 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (108 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (60 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4004 steps (46 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (111 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (27 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (50 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (61 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (18 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (64 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (67 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (42 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (56 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (58 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (65 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (73 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (55 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (102 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (23 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (65 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (113 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 476120 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :20 out of 33
Probabilistic random walk after 476120 steps, saw 112815 distinct states, run finished after 3014 ms. (steps per millisecond=157 ) properties seen :20
[2024-06-02 20:55:37] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
// Phase 1: matrix 308 rows 124 cols
[2024-06-02 20:55:37] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:55:37] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 78/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 20:55:38] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:55:38] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 285/383 variables, 98/106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 33/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 47/430 variables, 24/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 12/176 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 2/432 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/432 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 179 constraints, problems are : Problem set: 0 solved, 13 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 78/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 285/383 variables, 98/106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 33/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 47/430 variables, 24/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 12/176 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 13/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 2/432 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/432 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 192 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
After SMT, in 1641ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 6046 ms.
Support contains 20 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 334/334 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 122 transition count 330
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 122 transition count 328
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 121 transition count 330
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 121 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 121 transition count 327
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 121 transition count 329
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 120 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 120 transition count 325
Applied a total of 17 rules in 56 ms. Remains 120 /124 variables (removed 4) and now considering 325/334 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 120/124 places, 325/334 transitions.
RANDOM walk for 40000 steps (2302 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (69 resets) in 221 ms. (180 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (75 resets) in 330 ms. (120 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (67 resets) in 288 ms. (138 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (613 resets) in 54 ms. (727 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1139 resets) in 49 ms. (800 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (569 resets) in 57 ms. (689 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (568 resets) in 44 ms. (888 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (473 resets) in 40 ms. (975 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (557 resets) in 42 ms. (930 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (534 resets) in 41 ms. (952 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (61 resets) in 36 ms. (1081 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (555 resets) in 43 ms. (909 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1121 resets) in 45 ms. (869 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 486401 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 13
Probabilistic random walk after 486401 steps, saw 104722 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2024-06-02 20:55:49] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
// Phase 1: matrix 296 rows 120 cols
[2024-06-02 20:55:49] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 20:55:49] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 74/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 20:55:49] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:55:49] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 273/367 variables, 94/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 33/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 47/414 variables, 24/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 2/416 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/416 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 175 constraints, problems are : Problem set: 0 solved, 13 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 74/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 273/367 variables, 94/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 33/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 47/414 variables, 24/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 13/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 2/416 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 20:55:50] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/416 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 189 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1392 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
After SMT, in 2017ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 20233 ms.
Support contains 20 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 325/325 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 120/120 places, 325/325 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 325/325 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-06-02 20:56:11] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
[2024-06-02 20:56:11] [INFO ] Invariant cache hit.
[2024-06-02 20:56:11] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:56:11] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
[2024-06-02 20:56:11] [INFO ] Invariant cache hit.
[2024-06-02 20:56:11] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:56:11] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 223 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 119/120 places, 325/325 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 119 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 324
Applied a total of 2 rules in 17 ms. Remains 118 /119 variables (removed 1) and now considering 324/325 (removed 1) transitions.
[2024-06-02 20:56:11] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
// Phase 1: matrix 295 rows 118 cols
[2024-06-02 20:56:11] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:56:11] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 20:56:11] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
[2024-06-02 20:56:11] [INFO ] Invariant cache hit.
[2024-06-02 20:56:11] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:56:11] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 118/120 places, 324/325 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 456 ms. Remains : 118/120 places, 324/325 transitions.
RANDOM walk for 40000 steps (2272 resets) in 199 ms. (200 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (80 resets) in 74 ms. (533 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (64 resets) in 39 ms. (1000 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (69 resets) in 39 ms. (1000 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (591 resets) in 42 ms. (930 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1107 resets) in 47 ms. (833 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (595 resets) in 46 ms. (851 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (553 resets) in 43 ms. (909 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (473 resets) in 41 ms. (952 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (593 resets) in 51 ms. (769 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (601 resets) in 42 ms. (930 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (64 resets) in 38 ms. (1025 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (569 resets) in 42 ms. (930 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1104 resets) in 46 ms. (851 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 511463 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 13
Probabilistic random walk after 511463 steps, saw 109979 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-06-02 20:56:15] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
[2024-06-02 20:56:15] [INFO ] Invariant cache hit.
[2024-06-02 20:56:15] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 74/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 20:56:15] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:56:15] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 273/367 variables, 94/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 33/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 46/413 variables, 24/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/413 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 172 constraints, problems are : Problem set: 0 solved, 13 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 74/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 273/367 variables, 94/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 33/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 46/413 variables, 24/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 13/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/413 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 185 constraints, problems are : Problem set: 0 solved, 13 unsolved in 865 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
After SMT, in 1434ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 1 properties in 21912 ms.
Support contains 17 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 324/324 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 118/118 places, 324/324 transitions.
RANDOM walk for 40000 steps (2203 resets) in 191 ms. (208 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (76 resets) in 58 ms. (678 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (67 resets) in 39 ms. (1000 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (68 resets) in 43 ms. (909 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (550 resets) in 44 ms. (888 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1097 resets) in 43 ms. (909 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (532 resets) in 43 ms. (909 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (530 resets) in 54 ms. (727 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (544 resets) in 53 ms. (740 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (561 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (63 resets) in 44 ms. (888 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (587 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1096 resets) in 44 ms. (888 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 519710 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 12
Probabilistic random walk after 519710 steps, saw 111733 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-06-02 20:56:41] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
[2024-06-02 20:56:41] [INFO ] Invariant cache hit.
[2024-06-02 20:56:41] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 74/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 273/364 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 33/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 49/413 variables, 27/156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 170 constraints, problems are : Problem set: 0 solved, 12 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 74/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 273/364 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 33/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 49/413 variables, 27/156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 12/182 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/413 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 182 constraints, problems are : Problem set: 0 solved, 12 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 1241ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 6072 ms.
Support contains 17 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 324/324 transitions.
Applied a total of 0 rules in 5 ms. Remains 118 /118 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 118/118 places, 324/324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 324/324 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 324/324 (removed 0) transitions.
[2024-06-02 20:56:49] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
[2024-06-02 20:56:49] [INFO ] Invariant cache hit.
[2024-06-02 20:56:49] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:56:49] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
[2024-06-02 20:56:49] [INFO ] Invariant cache hit.
[2024-06-02 20:56:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:56:49] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-06-02 20:56:49] [INFO ] Redundant transitions in 20 ms returned []
Running 322 sub problems to find dead transitions.
[2024-06-02 20:56:49] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
[2024-06-02 20:56:49] [INFO ] Invariant cache hit.
[2024-06-02 20:56:49] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-02 20:56:50] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:56:50] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:56:50] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-02 20:56:50] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:56:50] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:56:51] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:56:51] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:56:51] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:56:51] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-02 20:56:51] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 295/412 variables, 117/134 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 45/179 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/413 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-02 20:56:58] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 181 constraints, problems are : Problem set: 0 solved, 322 unsolved in 16274 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 295/412 variables, 117/135 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 45/180 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 322/502 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-02 20:57:08] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-02 20:57:11] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 1/413 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 505 constraints, problems are : Problem set: 0 solved, 322 unsolved in 25157 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 13/13 constraints]
After SMT, in 41640ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 41644ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41878 ms. Remains : 118/118 places, 324/324 transitions.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-06-02 20:57:30] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:57:31] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:57:31] [INFO ] Input system was already deterministic with 346 transitions.
Computed a total of 22 stabilizing places and 47 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 340
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 127 transition count 337
Applied a total of 9 rules in 9 ms. Remains 127 /130 variables (removed 3) and now considering 337/346 (removed 9) transitions.
[2024-06-02 20:57:31] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
// Phase 1: matrix 311 rows 127 cols
[2024-06-02 20:57:31] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:57:31] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-02 20:57:31] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2024-06-02 20:57:31] [INFO ] Invariant cache hit.
[2024-06-02 20:57:31] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:57:31] [INFO ] Implicit Places using invariants and state equation in 199 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 418 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 337/346 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 337/337 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 429 ms. Remains : 125/130 places, 337/346 transitions.
[2024-06-02 20:57:31] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:57:31] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:57:31] [INFO ] Input system was already deterministic with 337 transitions.
[2024-06-02 20:57:31] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:57:31] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:57:31] [INFO ] Time to serialize gal into /tmp/CTLFireability5509017665021410532.gal : 10 ms
[2024-06-02 20:57:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15150399084824271289.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/CTLFireability5509017665021410532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15150399084824271289.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (((EF(((p9==1)&&(p108==1))) * AX(((p3==0)||(p45==0)))) * (EX(EF(((p10==1)&&(p51==1)))) * (EF(((((p7==0)||(p56==0))&&((p6==0)||(p38==0)))|...659
=> equivalent forward existential formula: ((([(Init * !(E(TRUE U ((p9==1)&&(p108==1)))))] = FALSE * [(EY(Init) * !(((p3==0)||(p45==0))))] = FALSE) * ([(In...1681
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t12, t13, t15, t16, t18, t20, t24, t25, t27, t28, t30, t32, t36, t37,...705
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 20:58:01] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:58:01] [INFO ] Applying decomposition
[2024-06-02 20:58:01] [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/graph11828518631111841055.txt' '-o' '/tmp/graph11828518631111841055.bin' '-w' '/tmp/graph11828518631111841055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11828518631111841055.bin' '-l' '-1' '-v' '-w' '/tmp/graph11828518631111841055.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:58:01] [INFO ] Decomposing Gal with order
[2024-06-02 20:58:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:58:01] [INFO ] Removed a total of 540 redundant transitions.
[2024-06-02 20:58:02] [INFO ] Flatten gal took : 86 ms
[2024-06-02 20:58:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 37 ms.
[2024-06-02 20:58:02] [INFO ] Time to serialize gal into /tmp/CTLFireability15839242924515602323.gal : 10 ms
[2024-06-02 20:58:02] [INFO ] Time to serialize properties into /tmp/CTLFireability4920592131139421587.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/CTLFireability15839242924515602323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4920592131139421587.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,6.47696e+06,17.5664,395380,3336,192,494683,2379,672,1.84466e+06,85,26178,0


Converting to forward existential form...Done !
original formula: (((EF(((i3.i0.u3.p9==1)&&(i5.u37.p108==1))) * AX(((i0.u0.p3==0)||(i4.u20.p45==0)))) * (EX(EF(((i3.i0.u3.p10==1)&&(i3.i2.u17.p51==1)))) * ...994
=> equivalent forward existential formula: ((([(Init * !(E(TRUE U ((i3.i0.u3.p9==1)&&(i5.u37.p108==1)))))] = FALSE * [(EY(Init) * !(((i0.u0.p3==0)||(i4.u20...2318
Reverse transition relation is NOT exact ! Due to transitions t40, t42, t43, t46, t47, t49, t55, t57, t62, t67, t72, t77, t89, t90, t91, t92, t95, t138, t1...824
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 325
Applied a total of 19 rules in 19 ms. Remains 122 /130 variables (removed 8) and now considering 325/346 (removed 21) transitions.
[2024-06-02 20:58:32] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
// Phase 1: matrix 299 rows 122 cols
[2024-06-02 20:58:32] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:58:32] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:58:32] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
[2024-06-02 20:58:32] [INFO ] Invariant cache hit.
[2024-06-02 20:58:32] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:58:32] [INFO ] Implicit Places using invariants and state equation in 167 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 245 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/130 places, 325/346 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 266 ms. Remains : 120/130 places, 325/346 transitions.
[2024-06-02 20:58:32] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:58:32] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:58:32] [INFO ] Input system was already deterministic with 325 transitions.
[2024-06-02 20:58:32] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:58:32] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:58:32] [INFO ] Time to serialize gal into /tmp/CTLFireability15065214144960416923.gal : 2 ms
[2024-06-02 20:58:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14173717238565483888.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/CTLFireability15065214144960416923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14173717238565483888.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,6.42548e+06,1.33745,45680,2,3037,5,117473,6,0,804,124000,0


Converting to forward existential form...Done !
original formula: AG(E(!(AG(!(EG((p58==1))))) U ((AX(!(AG(((p8==1)&&(p38==1))))) * (p3==1)) * (p120==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(!(E(TRUE U !(!(EG((p58==1))))))) U ((!(EX(!(!(!(E(TRUE U !(((p8==1)&&(p38==1))))))))) ...190
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...681
(forward)formula 0,0,21.1493,582220,1,0,994,3.29011e+06,681,562,6793,2.74199e+06,1043
FORMULA FireWire-PT-09-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 126 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 125 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 120 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 115 transition count 309
Applied a total of 32 rules in 13 ms. Remains 115 /130 variables (removed 15) and now considering 309/346 (removed 37) transitions.
[2024-06-02 20:58:53] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
// Phase 1: matrix 283 rows 115 cols
[2024-06-02 20:58:53] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:58:53] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 20:58:53] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2024-06-02 20:58:53] [INFO ] Invariant cache hit.
[2024-06-02 20:58:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:58:54] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [13, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 229 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/130 places, 309/346 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 113/130 places, 309/346 transitions.
[2024-06-02 20:58:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:58:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:58:54] [INFO ] Input system was already deterministic with 309 transitions.
[2024-06-02 20:58:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:58:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:58:54] [INFO ] Time to serialize gal into /tmp/CTLFireability5692830346386049523.gal : 1 ms
[2024-06-02 20:58:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16079586867095103377.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/CTLFireability5692830346386049523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16079586867095103377.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AF((((p11==0)||(p26==0)) * EF(((p8==1)&&(p113==1))))) + (EX(EG(((p9!=1)||(p108!=1)))) * AF(EX(AX(((p31==1)||(p57==1)))))))
=> equivalent forward existential formula: ([((Init * !(!(EG(!((((p11==0)||(p26==0)) * E(TRUE U ((p8==1)&&(p113==1))))))))) * !(EX(EG(((p9!=1)||(p108!=1)))...302
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...639
Detected timeout of ITS tools.
[2024-06-02 20:59:24] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:59:24] [INFO ] Applying decomposition
[2024-06-02 20:59:24] [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/graph11657792390539001022.txt' '-o' '/tmp/graph11657792390539001022.bin' '-w' '/tmp/graph11657792390539001022.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11657792390539001022.bin' '-l' '-1' '-v' '-w' '/tmp/graph11657792390539001022.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:59:24] [INFO ] Decomposing Gal with order
[2024-06-02 20:59:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:59:24] [INFO ] Removed a total of 481 redundant transitions.
[2024-06-02 20:59:24] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:59:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 8 ms.
[2024-06-02 20:59:24] [INFO ] Time to serialize gal into /tmp/CTLFireability16439887414306587553.gal : 12 ms
[2024-06-02 20:59:24] [INFO ] Time to serialize properties into /tmp/CTLFireability5195191461750698523.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/CTLFireability16439887414306587553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5195191461750698523.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,6.52156e+06,2.76659,98052,1394,179,134307,3783,612,564381,87,28873,0


Converting to forward existential form...Done !
original formula: (AF((((i4.u3.p11==0)||(i0.i0.u4.p26==0)) * EF(((i3.u2.p8==1)&&(i6.i1.u37.p113==1))))) + (EX(EG(((i4.u3.p9!=1)||(i6.i2.u38.p108!=1)))) * A...202
=> equivalent forward existential formula: ([((Init * !(!(EG(!((((i4.u3.p11==0)||(i0.i0.u4.p26==0)) * E(TRUE U ((i3.u2.p8==1)&&(i6.i1.u37.p113==1))))))))) ...394
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t79, t91, t96, t133, t134, t135, t...782
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,14.1144,299164,1,0,336399,5347,3174,1.81667e+06,370,29912,742065
FORMULA FireWire-PT-09-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 126 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 125 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 121 transition count 323
Applied a total of 20 rules in 7 ms. Remains 121 /130 variables (removed 9) and now considering 323/346 (removed 23) transitions.
[2024-06-02 20:59:38] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
// Phase 1: matrix 297 rows 121 cols
[2024-06-02 20:59:38] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 20:59:38] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:59:38] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
[2024-06-02 20:59:38] [INFO ] Invariant cache hit.
[2024-06-02 20:59:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:59:38] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 214 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/130 places, 323/346 transitions.
Applied a total of 0 rules in 0 ms. Remains 119 /119 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 222 ms. Remains : 119/130 places, 323/346 transitions.
[2024-06-02 20:59:38] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:59:38] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:59:38] [INFO ] Input system was already deterministic with 323 transitions.
[2024-06-02 20:59:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:59:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:59:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6085948134948318412.gal : 2 ms
[2024-06-02 20:59:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9384745569675580280.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/CTLFireability6085948134948318412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9384745569675580280.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,6.58402e+06,7.50739,218500,2,9748,5,576611,6,0,798,751068,0


Converting to forward existential form...Done !
original formula: A(!(AF(EX(((p3==1)&&(p60==1))))) U EF((AG((((p8==1)&&(p54==1))||(!((p8==1)&&(p64==1))))) * (!((AG(((p5==1)&&(p41==1))) * AF(((p3==1)&&(p8...232
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!(E(TRUE U !((((p8==1)&&(p54==1))||(!((p8==1)&&(p64==1))))))) * (!((!(E(TRUE U !(((p5...932
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...675
Detected timeout of ITS tools.
[2024-06-02 21:00:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:00:08] [INFO ] Applying decomposition
[2024-06-02 21:00:08] [INFO ] Flatten gal took : 17 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/graph17906844194269915720.txt' '-o' '/tmp/graph17906844194269915720.bin' '-w' '/tmp/graph17906844194269915720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17906844194269915720.bin' '-l' '-1' '-v' '-w' '/tmp/graph17906844194269915720.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:00:08] [INFO ] Decomposing Gal with order
[2024-06-02 21:00:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:00:08] [INFO ] Removed a total of 480 redundant transitions.
[2024-06-02 21:00:08] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:00:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 7 ms.
[2024-06-02 21:00:08] [INFO ] Time to serialize gal into /tmp/CTLFireability11814482537187943581.gal : 2 ms
[2024-06-02 21:00:08] [INFO ] Time to serialize properties into /tmp/CTLFireability1233544861299234173.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/CTLFireability11814482537187943581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1233544861299234173.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,6.58402e+06,1.96341,69808,2023,286,96329,3733,582,309998,139,26902,0


Converting to forward existential form...Done !
original formula: A(!(AF(EX(((i6.u0.p3==1)&&(i3.u17.p60==1))))) U EF((AG((((i3.u2.p8==1)&&(i3.u14.p54==1))||(!((i3.u2.p8==1)&&(i3.u17.p64==1))))) * (!((AG(...326
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!(E(TRUE U !((((i3.u2.p8==1)&&(i3.u14.p54==1))||(!((i3.u2.p8==1)&&(i3.u17.p64==1)))))...1230
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t84, t91, t94, t96, t133, t134, t1...758
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,23.2172,696640,1,0,1.11335e+06,20763,3300,2.19917e+06,688,139671,3125462
FORMULA FireWire-PT-09-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 121 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 121 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 120 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 117 transition count 312
Applied a total of 29 rules in 7 ms. Remains 117 /130 variables (removed 13) and now considering 312/346 (removed 34) transitions.
[2024-06-02 21:00:32] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
// Phase 1: matrix 286 rows 117 cols
[2024-06-02 21:00:32] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 21:00:32] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 21:00:32] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
[2024-06-02 21:00:32] [INFO ] Invariant cache hit.
[2024-06-02 21:00:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:00:32] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 251 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/130 places, 312/346 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 259 ms. Remains : 115/130 places, 312/346 transitions.
[2024-06-02 21:00:32] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:00:32] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:00:32] [INFO ] Input system was already deterministic with 312 transitions.
[2024-06-02 21:00:32] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:00:32] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:00:32] [INFO ] Time to serialize gal into /tmp/CTLFireability6627981601653765398.gal : 1 ms
[2024-06-02 21:00:32] [INFO ] Time to serialize properties into /tmp/CTLFireability5606836095404083590.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/CTLFireability6627981601653765398.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5606836095404083590.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,6.37433e+06,7.5519,216680,2,7772,5,579471,6,0,771,751104,0


Converting to forward existential form...Done !
original formula: EX(((EF(((p10==1)&&(p87==1))) + ((p8==1)&&(p29==1))) + (EX(((p8==0)||(p33==0))) * (p8==1))))
=> equivalent forward existential formula: (([(FwdU(EY(Init),TRUE) * ((p10==1)&&(p87==1)))] != FALSE + [(EY(Init) * ((p8==1)&&(p29==1)))] != FALSE) + [(EY(...210
(forward)formula 0,1,12.1436,216680,1,0,9,579868,9,1,1608,751414,4
FORMULA FireWire-PT-09-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 337
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 113 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 112 transition count 304
Applied a total of 37 rules in 41 ms. Remains 112 /130 variables (removed 18) and now considering 304/346 (removed 42) transitions.
[2024-06-02 21:00:44] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 112 cols
[2024-06-02 21:00:44] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:00:44] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 21:00:44] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 21:00:44] [INFO ] Invariant cache hit.
[2024-06-02 21:00:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:00:45] [INFO ] Implicit Places using invariants and state equation in 196 ms returned [12, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 272 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/130 places, 304/346 transitions.
Applied a total of 0 rules in 7 ms. Remains 110 /110 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 321 ms. Remains : 110/130 places, 304/346 transitions.
[2024-06-02 21:00:45] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:00:45] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:00:45] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 21:00:45] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:00:45] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:00:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15586978252964183912.gal : 2 ms
[2024-06-02 21:00:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3432907765374891690.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/CTLFireability15586978252964183912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3432907765374891690.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(E(((p6==1)&&(p101==1)) U AF((!(EF(((p9==1)&&(p96==1)))) + ((p8==1)&&(p103==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p6==1)&&(p101==1)) U !(EG(!((!(E(TRUE U ((p9==1)&&(p96==1)))) + ((p8==1)&&(p103==1))))...169
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...627
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,28.0353,706388,1,0,668,3.61269e+06,639,362,6639,2.56042e+06,798
FORMULA FireWire-PT-09-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 337
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 321
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 119 transition count 320
Applied a total of 23 rules in 27 ms. Remains 119 /130 variables (removed 11) and now considering 320/346 (removed 26) transitions.
[2024-06-02 21:01:13] [INFO ] Flow matrix only has 294 transitions (discarded 26 similar events)
// Phase 1: matrix 294 rows 119 cols
[2024-06-02 21:01:13] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:01:13] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 21:01:13] [INFO ] Flow matrix only has 294 transitions (discarded 26 similar events)
[2024-06-02 21:01:13] [INFO ] Invariant cache hit.
[2024-06-02 21:01:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:01:13] [INFO ] Implicit Places using invariants and state equation in 153 ms returned [12, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 231 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 117/130 places, 320/346 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 267 ms. Remains : 117/130 places, 320/346 transitions.
[2024-06-02 21:01:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:01:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:01:13] [INFO ] Input system was already deterministic with 320 transitions.
[2024-06-02 21:01:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:01:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:01:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13976087554002586903.gal : 2 ms
[2024-06-02 21:01:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17717342842132497817.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/CTLFireability13976087554002586903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17717342842132497817.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,5.35018e+06,4.8941,155020,2,8398,5,417703,6,0,787,534362,0


Converting to forward existential form...Done !
original formula: EG((AG(((EG(((p9==1)&&(p94==1))) + AF(((p9==0)||(p16==0)))) + ((p4==1)&&(p121==1)))) * ((p11==0)||(p111==0))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(((EG(((p9==1)&&(p94==1))) + !(EG(!(((p9==0)||(p16==0)))))) + ((p4==1)&&(p121==1)))))) *...189
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...664
Detected timeout of ITS tools.
[2024-06-02 21:01:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:01:43] [INFO ] Applying decomposition
[2024-06-02 21:01:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7349054862173815974.txt' '-o' '/tmp/graph7349054862173815974.bin' '-w' '/tmp/graph7349054862173815974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7349054862173815974.bin' '-l' '-1' '-v' '-w' '/tmp/graph7349054862173815974.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:01:43] [INFO ] Decomposing Gal with order
[2024-06-02 21:01:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:01:43] [INFO ] Removed a total of 506 redundant transitions.
[2024-06-02 21:01:43] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:01:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 6 ms.
[2024-06-02 21:01:43] [INFO ] Time to serialize gal into /tmp/CTLFireability11911495364578201534.gal : 2 ms
[2024-06-02 21:01:43] [INFO ] Time to serialize properties into /tmp/CTLFireability875835779699331844.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/CTLFireability11911495364578201534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability875835779699331844.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,5.35018e+06,3.23243,102332,2134,164,161616,2011,613,406898,84,16613,0


Converting to forward existential form...Done !
original formula: EG((AG(((EG(((i1.u3.p9==1)&&(i4.u32.p94==1))) + AF(((i1.u3.p9==0)||(i2.i1.u8.p16==0)))) + ((i2.i2.u1.p4==1)&&(i0.u40.p121==1)))) * ((i1.u...188
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(((EG(((i1.u3.p9==1)&&(i4.u32.p94==1))) + !(EG(!(((i1.u3.p9==0)||(i2.i1.u8.p16==0)))))) ...249
Reverse transition relation is NOT exact ! Due to transitions t5, t38, t40, t41, t44, t45, t47, t55, t60, t65, t66, t70, t75, t87, t88, t89, t90, t93, t95,...791
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,28.86,602188,1,0,975386,3923,2958,2.23601e+06,351,28670,2134423
FORMULA FireWire-PT-09-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 337
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 123 transition count 330
Applied a total of 15 rules in 11 ms. Remains 123 /130 variables (removed 7) and now considering 330/346 (removed 16) transitions.
[2024-06-02 21:02:12] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
// Phase 1: matrix 304 rows 123 cols
[2024-06-02 21:02:12] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:02:12] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 21:02:13] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
[2024-06-02 21:02:13] [INFO ] Invariant cache hit.
[2024-06-02 21:02:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 21:02:13] [INFO ] Implicit Places using invariants and state equation in 170 ms returned [12, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 234 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 121/130 places, 330/346 transitions.
Applied a total of 0 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 250 ms. Remains : 121/130 places, 330/346 transitions.
[2024-06-02 21:02:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:02:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:02:13] [INFO ] Input system was already deterministic with 330 transitions.
[2024-06-02 21:02:13] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:02:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:02:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9242261044532393160.gal : 2 ms
[2024-06-02 21:02:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16012166295401046382.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/ReachabilityCardinality9242261044532393160.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16012166295401046382.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (2332 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31027 steps (430 resets) in 41 ms. (738 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-09-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_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 : 130/130 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 126 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 125 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 121 transition count 323
Applied a total of 20 rules in 6 ms. Remains 121 /130 variables (removed 9) and now considering 323/346 (removed 23) transitions.
[2024-06-02 21:02:13] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
// Phase 1: matrix 297 rows 121 cols
[2024-06-02 21:02:13] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:02:13] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 21:02:13] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
[2024-06-02 21:02:13] [INFO ] Invariant cache hit.
[2024-06-02 21:02:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 21:02:13] [INFO ] Implicit Places using invariants and state equation in 172 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 250 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/130 places, 323/346 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 259 ms. Remains : 119/130 places, 323/346 transitions.
[2024-06-02 21:02:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:02:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:02:13] [INFO ] Input system was already deterministic with 323 transitions.
[2024-06-02 21:02:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:02:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:02:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16996650242065301660.gal : 2 ms
[2024-06-02 21:02:13] [INFO ] Time to serialize properties into /tmp/CTLFireability10873141190468646230.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/CTLFireability16996650242065301660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10873141190468646230.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,6.58402e+06,7.506,219580,2,9748,5,576611,6,0,798,751068,0


Converting to forward existential form...Done !
original formula: EG(EF((EF(((E(((p8==1)&&(p56==1)) U ((p5==1)&&(p41==1))) + ((p8==1)&&(p64==1))) + ((p3==1)&&(p84==1)))) * A(EF(((p8==1)&&(p54==1))) U (AX...205
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (E(TRUE U ((E(((p8==1)&&(p56==1)) U ((p5==1)&&(p41==1))) + ((p8==1)&&(p64==1))) + ((p3==1)&&...411
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...675
Detected timeout of ITS tools.
[2024-06-02 21:02:43] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:02:43] [INFO ] Applying decomposition
[2024-06-02 21:02:43] [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/graph5832708261940222513.txt' '-o' '/tmp/graph5832708261940222513.bin' '-w' '/tmp/graph5832708261940222513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5832708261940222513.bin' '-l' '-1' '-v' '-w' '/tmp/graph5832708261940222513.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:02:43] [INFO ] Decomposing Gal with order
[2024-06-02 21:02:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:02:43] [INFO ] Removed a total of 508 redundant transitions.
[2024-06-02 21:02:43] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:02:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 6 ms.
[2024-06-02 21:02:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17200880181434744462.gal : 3 ms
[2024-06-02 21:02:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17469023189213346423.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/CTLFireability17200880181434744462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17469023189213346423.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.58402e+06,3.22512,104460,2221,195,134875,2077,641,552512,88,17054,0


Converting to forward existential form...Done !
original formula: EG(EF((EF(((E(((i3.u2.p8==1)&&(i4.u18.p56==1)) U ((i1.i0.u1.p5==1)&&(i1.i0.u13.p41==1))) + ((i3.u2.p8==1)&&(i4.u19.p64==1))) + ((i0.u0.p3...308
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (E(TRUE U ((E(((i3.u2.p8==1)&&(i4.u18.p56==1)) U ((i1.i0.u1.p5==1)&&(i1.i0.u13.p41==1))) + (...578
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t55, t56, t61, t66, t71, t76, t91, t94, t96, t133, t134, t1...814
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 126 transition count 339
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 126 transition count 339
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 126 transition count 337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 125 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 124 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 114 transition count 308
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 113 transition count 307
Applied a total of 34 rules in 27 ms. Remains 113 /130 variables (removed 17) and now considering 307/346 (removed 39) transitions.
[2024-06-02 21:03:13] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 113 cols
[2024-06-02 21:03:13] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:03:13] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-02 21:03:13] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:03:13] [INFO ] Invariant cache hit.
[2024-06-02 21:03:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:03:14] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 279 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 112/130 places, 307/346 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 311 ms. Remains : 112/130 places, 307/346 transitions.
[2024-06-02 21:03:14] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:03:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:03:14] [INFO ] Input system was already deterministic with 307 transitions.
[2024-06-02 21:03:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:03:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:03:14] [INFO ] Time to serialize gal into /tmp/CTLFireability3897453001372921867.gal : 2 ms
[2024-06-02 21:03:14] [INFO ] Time to serialize properties into /tmp/CTLFireability6765435824974137152.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/CTLFireability3897453001372921867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6765435824974137152.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,5.42662e+06,3.78586,120776,2,6057,5,307922,6,0,754,389692,0


Converting to forward existential form...Done !
original formula: EF(AG((((EG(((p5==1)&&(p26==1))) * AF(((p7==1)&&(p58==1)))) * ((p13==1)&&(p25==1))) * (((p70==1)&&(p107==1))||((p3==1)&&(p34==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((EG(((p5==1)&&(p26==1))) * !(EG(!(((p7==1)&&(p58==1)))))) * ((p13==1)&&(p25==...221
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...633
Detected timeout of ITS tools.
[2024-06-02 21:03:44] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:03:44] [INFO ] Applying decomposition
[2024-06-02 21:03:44] [INFO ] Flatten gal took : 6 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/graph4990876354454554384.txt' '-o' '/tmp/graph4990876354454554384.bin' '-w' '/tmp/graph4990876354454554384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4990876354454554384.bin' '-l' '-1' '-v' '-w' '/tmp/graph4990876354454554384.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:03:44] [INFO ] Decomposing Gal with order
[2024-06-02 21:03:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:03:44] [INFO ] Removed a total of 479 redundant transitions.
[2024-06-02 21:03:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:03:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 3 ms.
[2024-06-02 21:03:44] [INFO ] Time to serialize gal into /tmp/CTLFireability2452716812104018516.gal : 2 ms
[2024-06-02 21:03:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15396277298864427037.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/CTLFireability2452716812104018516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15396277298864427037.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,5.42662e+06,2.82538,86684,2017,191,111143,2085,612,433374,86,16891,0


Converting to forward existential form...Done !
original formula: EF(AG((((EG(((i1.u1.p5==1)&&(i1.u5.p26==1))) * AF(((i3.u2.p7==1)&&(i4.u21.p58==1)))) * ((i1.u4.p13==1)&&(i1.u5.p25==1))) * (((i6.i0.u24.p...221
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((EG(((i1.u1.p5==1)&&(i1.u5.p26==1))) * !(EG(!(((i3.u2.p7==1)&&(i4.u21.p58==1)...291
Reverse transition relation is NOT exact ! Due to transitions t5, t38, t40, t41, t44, t45, t47, t55, t60, t65, t70, t75, t78, t90, t95, t132, t133, t134, t...769
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,12.822,324144,1,0,390037,7159,3082,1.82088e+06,354,44236,979780
FORMULA FireWire-PT-09-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 126 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 126 transition count 335
Applied a total of 10 rules in 2 ms. Remains 126 /130 variables (removed 4) and now considering 335/346 (removed 11) transitions.
[2024-06-02 21:03:57] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
// Phase 1: matrix 309 rows 126 cols
[2024-06-02 21:03:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:03:57] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 21:03:57] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
[2024-06-02 21:03:57] [INFO ] Invariant cache hit.
[2024-06-02 21:03:57] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 21:03:57] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 247 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 335/346 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 252 ms. Remains : 124/130 places, 335/346 transitions.
[2024-06-02 21:03:57] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:03:57] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:03:57] [INFO ] Input system was already deterministic with 335 transitions.
[2024-06-02 21:03:57] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:03:57] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:03:57] [INFO ] Time to serialize gal into /tmp/CTLFireability9996494236486142883.gal : 2 ms
[2024-06-02 21:03:57] [INFO ] Time to serialize properties into /tmp/CTLFireability7251421372885706150.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/CTLFireability9996494236486142883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7251421372885706150.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,6.53529e+06,8.07846,237380,2,10437,5,615367,6,0,830,803133,0


Converting to forward existential form...Done !
original formula: (E((!(((p8==1)&&(p64==1))) * !(((EX(((p8==1)&&(p101==1))) * !(((p6==1)&&(p55==1)))) * !((((p7==1)&&(p129==1))||((p14==1)&&(p27==1))))))) ...406
=> equivalent forward existential formula: (([((Init * !(E((!(((p8==1)&&(p64==1))) * !(((EX(((p8==1)&&(p101==1))) * !(((p6==1)&&(p55==1)))) * !((((p7==1)&&...1495
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...700
Detected timeout of ITS tools.
[2024-06-02 21:04:27] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:04:27] [INFO ] Applying decomposition
[2024-06-02 21:04:27] [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/graph10485530678686466106.txt' '-o' '/tmp/graph10485530678686466106.bin' '-w' '/tmp/graph10485530678686466106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10485530678686466106.bin' '-l' '-1' '-v' '-w' '/tmp/graph10485530678686466106.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:04:27] [INFO ] Decomposing Gal with order
[2024-06-02 21:04:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:04:27] [INFO ] Removed a total of 536 redundant transitions.
[2024-06-02 21:04:27] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:04:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 3 ms.
[2024-06-02 21:04:27] [INFO ] Time to serialize gal into /tmp/CTLFireability15121211042190788350.gal : 2 ms
[2024-06-02 21:04:27] [INFO ] Time to serialize properties into /tmp/CTLFireability15686468446908395483.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/CTLFireability15121211042190788350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15686468446908395483.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.53529e+06,13.9043,333220,2802,212,436756,2451,666,1.69291e+06,87,23224,0


Converting to forward existential form...Done !
original formula: (E((!(((i4.u2.p8==1)&&(i4.u21.p64==1))) * !(((EX(((i4.u2.p8==1)&&(i5.u35.p101==1))) * !(((i5.u38.p6==1)&&(i4.u19.p55==1)))) * !((((i4.u2....614
=> equivalent forward existential formula: (([((Init * !(E((!(((i4.u2.p8==1)&&(i4.u21.p64==1))) * !(((EX(((i4.u2.p8==1)&&(i5.u35.p101==1))) * !(((i5.u38.p6...2149
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t61, t66, t71, t76, t84, t88, t89, t90, t91, t94, t103, t139, t1...824
Using saturation style SCC detection
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 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 338
Applied a total of 8 rules in 6 ms. Remains 127 /130 variables (removed 3) and now considering 338/346 (removed 8) transitions.
[2024-06-02 21:04:57] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
// Phase 1: matrix 312 rows 127 cols
[2024-06-02 21:04:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:04:57] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 21:04:57] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2024-06-02 21:04:57] [INFO ] Invariant cache hit.
[2024-06-02 21:04:57] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:04:57] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [13, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 248 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 338/346 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 256 ms. Remains : 125/130 places, 338/346 transitions.
[2024-06-02 21:04:57] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:04:57] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:04:57] [INFO ] Input system was already deterministic with 338 transitions.
[2024-06-02 21:04:57] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:04:57] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:04:57] [INFO ] Time to serialize gal into /tmp/CTLFireability8775345054970983918.gal : 2 ms
[2024-06-02 21:04:57] [INFO ] Time to serialize properties into /tmp/CTLFireability6538212997192540198.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/CTLFireability8775345054970983918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6538212997192540198.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,6.64736e+06,2.27609,77420,2,2974,5,227017,6,0,837,236488,0


Converting to forward existential form...Done !
original formula: EF((((!(A(A(((p8==1)&&(p106==1)) U ((p3==1)&&(p108==1))) U EF(((p3==1)&&(p45==1))))) * EG(((p11==0)||(p15==0)))) * (((p9==0)||(p86==0))&&...394
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,TRUE) * (((p9==0)||(p86==0))&&((p8==0)||(p55==0)))) * !(!((E(!(E(TRUE U ((p3==1)&&(p45==1))))...1248
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...712
Detected timeout of ITS tools.
[2024-06-02 21:05:28] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:05:28] [INFO ] Applying decomposition
[2024-06-02 21:05:28] [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/graph13798100557401303658.txt' '-o' '/tmp/graph13798100557401303658.bin' '-w' '/tmp/graph13798100557401303658.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13798100557401303658.bin' '-l' '-1' '-v' '-w' '/tmp/graph13798100557401303658.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:05:28] [INFO ] Decomposing Gal with order
[2024-06-02 21:05:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:05:28] [INFO ] Removed a total of 525 redundant transitions.
[2024-06-02 21:05:28] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:05:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 4 ms.
[2024-06-02 21:05:28] [INFO ] Time to serialize gal into /tmp/CTLFireability7093294958445953499.gal : 2 ms
[2024-06-02 21:05:28] [INFO ] Time to serialize properties into /tmp/CTLFireability14112630369628013384.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/CTLFireability7093294958445953499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14112630369628013384.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,6.64736e+06,2.51073,90296,2287,228,130239,3413,685,478102,97,26583,0


Converting to forward existential form...Done !
original formula: EF((((!(A(A(((i3.u2.p8==1)&&(i6.i2.u41.p106==1)) U ((i5.u0.p3==1)&&(i6.i2.u41.p108==1))) U EF(((i5.u0.p3==1)&&(i3.u20.p45==1))))) * EG(((...597
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,TRUE) * (((i2.i0.u3.p9==0)||(i5.u27.p86==0))&&((i3.u2.p8==0)||(i3.u18.p55==0)))) * !(!((E(!(E...1751
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t60, t61, t66, t71, t76, t88, t89, t90, t91, t94, t96,...875
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,17.5444,512064,1,0,648593,7053,3786,3.2633e+06,467,45182,1479024
FORMULA FireWire-PT-09-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 337
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 113 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 112 transition count 304
Applied a total of 37 rules in 26 ms. Remains 112 /130 variables (removed 18) and now considering 304/346 (removed 42) transitions.
[2024-06-02 21:05:45] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 112 cols
[2024-06-02 21:05:45] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:05:45] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 21:05:45] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 21:05:45] [INFO ] Invariant cache hit.
[2024-06-02 21:05:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:05:45] [INFO ] Implicit Places using invariants and state equation in 170 ms returned [12, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 229 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/130 places, 304/346 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 258 ms. Remains : 110/130 places, 304/346 transitions.
[2024-06-02 21:05:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:05:46] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:05:46] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 21:05:46] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:05:46] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:05:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality176449097415127857.gal : 1 ms
[2024-06-02 21:05:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9485053092780002880.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality176449097415127857.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9485053092780002880.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
RANDOM walk for 40000 steps (2373 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality9485053092780002880.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 12
BEST_FIRST walk for 40002 steps (1099 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 22
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :22 after 36
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :36 after 57
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :57 after 353
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :353 after 774
Finished probabilistic random walk after 94611 steps, run visited all 1 properties in 135 ms. (steps per millisecond=700 )
Probabilistic random walk after 94611 steps, saw 19864 distinct states, run finished after 139 ms. (steps per millisecond=680 ) properties seen :1
FORMULA FireWire-PT-09-CTLFireability-2024-12 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 SI_CTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 337
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 113 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 112 transition count 304
Applied a total of 37 rules in 19 ms. Remains 112 /130 variables (removed 18) and now considering 304/346 (removed 42) transitions.
[2024-06-02 21:05:46] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 21:05:46] [INFO ] Invariant cache hit.
[2024-06-02 21:05:46] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 21:05:46] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 21:05:46] [INFO ] Invariant cache hit.
[2024-06-02 21:05:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:05:46] [INFO ] Implicit Places using invariants and state equation in 171 ms returned [12, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 235 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/130 places, 304/346 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 258 ms. Remains : 110/130 places, 304/346 transitions.
[2024-06-02 21:05:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:05:46] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:05:46] [INFO ] Input system was already deterministic with 304 transitions.
RANDOM walk for 40000 steps (2374 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
[2024-06-02 21:05:46] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:05:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:05:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8183679371468915581.gal : 1 ms
BEST_FIRST walk for 40004 steps (593 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2024-06-02 21:05:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2876709889372277469.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/ReachabilityCardinality8183679371468915581.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2876709889372277469.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2876709889372277469.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 22
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :22 after 36
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :36 after 57
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :57 after 353
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :353 after 774
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :774 after 7236
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7236 after 22663
Finished probabilistic random walk after 373265 steps, run visited all 1 properties in 515 ms. (steps per millisecond=724 )
Probabilistic random walk after 373265 steps, saw 79490 distinct states, run finished after 515 ms. (steps per millisecond=724 ) properties seen :1
FORMULA FireWire-PT-09-CTLFireability-2024-13 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 : 130/130 places, 346/346 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 121 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 121 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 120 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 114 transition count 306
Applied a total of 35 rules in 9 ms. Remains 114 /130 variables (removed 16) and now considering 306/346 (removed 40) transitions.
[2024-06-02 21:05:47] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 114 cols
[2024-06-02 21:05:47] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:05:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 21:05:47] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 21:05:47] [INFO ] Invariant cache hit.
[2024-06-02 21:05:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:05:47] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 210 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/130 places, 306/346 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 112/130 places, 306/346 transitions.
[2024-06-02 21:05:47] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:05:47] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:05:47] [INFO ] Input system was already deterministic with 306 transitions.
[2024-06-02 21:05:47] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:05:47] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:05:47] [INFO ] Time to serialize gal into /tmp/CTLFireability12669761023349842598.gal : 1 ms
[2024-06-02 21:05:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3217203047657398705.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/CTLFireability12669761023349842598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3217203047657398705.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(!(((p8==1)&&(p31==1))) U (AG(!(((EF((p8==1)) * (p8==1)) * (p111==1)))) + A(((A(((p7==1)&&(p101==1)) U ((p8==1)&&(p129==1))) + ((p8==1)&...285
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !(!(((E(TRUE U (p8==1)) * (p8==1)) * (p111==1)))))) + !((E(!(!(EX(!(E(((p10==1)&&(p...1755
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...633
Detected timeout of ITS tools.
[2024-06-02 21:06:17] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:06:17] [INFO ] Applying decomposition
[2024-06-02 21:06:17] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3217371110141989458.txt' '-o' '/tmp/graph3217371110141989458.bin' '-w' '/tmp/graph3217371110141989458.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3217371110141989458.bin' '-l' '-1' '-v' '-w' '/tmp/graph3217371110141989458.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:06:17] [INFO ] Decomposing Gal with order
[2024-06-02 21:06:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:06:17] [INFO ] Removed a total of 479 redundant transitions.
[2024-06-02 21:06:17] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:06:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 3 ms.
[2024-06-02 21:06:17] [INFO ] Time to serialize gal into /tmp/CTLFireability962528340665356155.gal : 2 ms
[2024-06-02 21:06:17] [INFO ] Time to serialize properties into /tmp/CTLFireability5452052731646172469.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/CTLFireability962528340665356155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5452052731646172469.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.34422e+06,3.48539,109628,1884,188,186813,1555,591,358857,85,14129,0


Converting to forward existential form...Done !
original formula: A(!(((i3.u2.p8==1)&&(i3.u12.p31==1))) U (AG(!(((EF((i3.u2.p8==1)) * (i3.u2.p8==1)) * (i7.u37.p111==1)))) + A(((A(((i3.u2.p7==1)&&(i7.u34....417
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !(!(((E(TRUE U (i3.u2.p8==1)) * (i3.u2.p8==1)) * (i7.u37.p111==1)))))) + !((E(!(!(E...2437
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t79, t80, t88, t89, t90, t91, t96,...748
Using saturation style SCC detection
Using 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,29.0206,799516,1,0,1.283e+06,6946,3298,2.4655e+06,374,54328,3218877
FORMULA FireWire-PT-09-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 332
Applied a total of 13 rules in 7 ms. Remains 125 /130 variables (removed 5) and now considering 332/346 (removed 14) transitions.
[2024-06-02 21:06:46] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
// Phase 1: matrix 306 rows 125 cols
[2024-06-02 21:06:46] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 21:06:46] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 21:06:46] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
[2024-06-02 21:06:46] [INFO ] Invariant cache hit.
[2024-06-02 21:06:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 21:06:46] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 275 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/130 places, 332/346 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 283 ms. Remains : 123/130 places, 332/346 transitions.
[2024-06-02 21:06:46] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:06:46] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:06:46] [INFO ] Input system was already deterministic with 332 transitions.
[2024-06-02 21:06:46] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:06:46] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:06:46] [INFO ] Time to serialize gal into /tmp/CTLFireability4872296837539274326.gal : 1 ms
[2024-06-02 21:06:46] [INFO ] Time to serialize properties into /tmp/CTLFireability9992475412135915225.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/CTLFireability4872296837539274326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9992475412135915225.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,6.45644e+06,1.55747,48904,2,2951,5,127377,6,0,823,132790,0


Converting to forward existential form...Done !
original formula: AX(E((((p3==1)&&(p126==1))||((p7==1)&&(p105==1))) U (AG(EF(((p3==1)&&(p86==1)))) + AX((AX(((p10==1)&&(p79==1))) * AF(((p4==1)&&(p119==1))...161
=> equivalent forward existential formula: [(EY(Init) * !(E((((p3==1)&&(p126==1))||((p7==1)&&(p105==1))) U (!(E(TRUE U !(E(TRUE U ((p3==1)&&(p86==1)))))) +...244
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...694
Detected timeout of ITS tools.
[2024-06-02 21:07:17] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:07:17] [INFO ] Applying decomposition
[2024-06-02 21:07:17] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7620401978749561429.txt' '-o' '/tmp/graph7620401978749561429.bin' '-w' '/tmp/graph7620401978749561429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7620401978749561429.bin' '-l' '-1' '-v' '-w' '/tmp/graph7620401978749561429.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:07:17] [INFO ] Decomposing Gal with order
[2024-06-02 21:07:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:07:17] [INFO ] Removed a total of 531 redundant transitions.
[2024-06-02 21:07:17] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:07:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 3 ms.
[2024-06-02 21:07:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9021172430246642237.gal : 3 ms
[2024-06-02 21:07:17] [INFO ] Time to serialize properties into /tmp/CTLFireability6440222809093185891.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/CTLFireability9021172430246642237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6440222809093185891.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,6.45644e+06,4.42645,140700,2545,193,197949,2170,718,764300,85,16989,0


Converting to forward existential form...Done !
original formula: AX(E((((i0.u0.p3==1)&&(i1.i1.u3.p126==1))||((i2.u2.p7==1)&&(i5.i1.u37.p105==1))) U (AG(EF(((i0.u0.p3==1)&&(i0.u29.p86==1)))) + AX((AX(((i...237
=> equivalent forward existential formula: [(EY(Init) * !(E((((i0.u0.p3==1)&&(i1.i1.u3.p126==1))||((i2.u2.p7==1)&&(i5.i1.u37.p105==1))) U (!(E(TRUE U !(E(T...320
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t61, t66, t71, t76, t80, t88, t89, t90, t91, t94, t137, t13...856
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 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 a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,0,15.8579,413188,1,0,537631,4962,3719,2.33644e+06,366,36842,1460902
FORMULA FireWire-PT-09-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-06-02 21:07:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:07:33] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:07:33] [INFO ] Applying decomposition
[2024-06-02 21:07:33] [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/graph10792112511373134278.txt' '-o' '/tmp/graph10792112511373134278.bin' '-w' '/tmp/graph10792112511373134278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10792112511373134278.bin' '-l' '-1' '-v' '-w' '/tmp/graph10792112511373134278.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:07:33] [INFO ] Decomposing Gal with order
[2024-06-02 21:07:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:07:33] [INFO ] Removed a total of 554 redundant transitions.
[2024-06-02 21:07:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:07:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 3 ms.
[2024-06-02 21:07:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17353222308459682865.gal : 1 ms
[2024-06-02 21:07:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1380966575219011811.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/CTLFireability17353222308459682865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1380966575219011811.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.92725e+06,11.1209,279516,3284,164,424852,2250,645,1.0697e+06,87,17596,0


Converting to forward existential form...Done !
original formula: (((EF(((i1.u3.p9==1)&&(i7.u45.p108==1))) * AX(((i3.u0.p3==0)||(i4.u20.p45==0)))) * (EX(EF(((i1.u3.p10==1)&&(i5.i2.u17.p51==1)))) * (EF(((...970
=> equivalent forward existential formula: ((([(Init * !(E(TRUE U ((i1.u3.p9==1)&&(i7.u45.p108==1)))))] = FALSE * [(EY(Init) * !(((i3.u0.p3==0)||(i4.u20.p4...2273
Reverse transition relation is NOT exact ! Due to transitions t40, t42, t43, t46, t47, t57, t62, t67, t72, t77, t81, t89, t90, t91, t92, t95, t97, t104, t1...813
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,102.091,1963376,1,0,2.94295e+06,5594,3582,7.28912e+06,371,42885,7364492
FORMULA FireWire-PT-09-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EF((EF(((E(((i2.u2.p8==1)&&(i4.u19.p56==1)) U ((i5.i0.u1.p5==1)&&(i5.i2.u17.p41==1))) + ((i2.u2.p8==1)&&(i4.u20.p64==1))) + ((i3.u0.p3...302
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (E(TRUE U ((E(((i2.u2.p8==1)&&(i4.u19.p56==1)) U ((i5.i0.u1.p5==1)&&(i5.i2.u17.p41==1))) + (...560
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 1,1,234.525,2212592,1,0,3.29464e+06,5699,2187,8.47773e+06,229,47661,6665192
FORMULA FireWire-PT-09-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (E((!(((i2.u2.p8==1)&&(i4.u20.p64==1))) * !(((EX(((i2.u2.p8==1)&&(i7.u35.p101==1))) * !(((i7.u38.p6==1)&&(i4.u19.p55==1)))) * !((((i2.u2....596
=> equivalent forward existential formula: (([((Init * !(E((!(((i2.u2.p8==1)&&(i4.u20.p64==1))) * !(((EX(((i2.u2.p8==1)&&(i7.u35.p101==1))) * !(((i7.u38.p6...2101
(forward)formula 2,1,305,2469464,1,0,3.62429e+06,5699,2109,9.41155e+06,232,55605,3794033
FORMULA FireWire-PT-09-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1082413 ms.

BK_STOP 1717362758770

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-09"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-09, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898900234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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