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.r004-smll-171620118300313.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 Anderson-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118300313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 15:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 15:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716422285244

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 23:58:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:58:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:58:07] [INFO ] Load time of PNML (sax parser for PT used): 284 ms
[2024-05-22 23:58:08] [INFO ] Transformed 105 places.
[2024-05-22 23:58:08] [INFO ] Transformed 200 transitions.
[2024-05-22 23:58:08] [INFO ] Found NUPN structural information;
[2024-05-22 23:58:08] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 501 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 158 ms.
FORMULA Anderson-PT-04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 200/200 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 99 transition count 176
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 99 transition count 176
Applied a total of 12 rules in 61 ms. Remains 99 /105 variables (removed 6) and now considering 176/200 (removed 24) transitions.
// Phase 1: matrix 176 rows 99 cols
[2024-05-22 23:58:08] [INFO ] Computed 11 invariants in 35 ms
[2024-05-22 23:58:09] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-05-22 23:58:09] [INFO ] Invariant cache hit.
[2024-05-22 23:58:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 23:58:09] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-22 23:58:09] [INFO ] Invariant cache hit.
[2024-05-22 23:58:09] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 23:58:11] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 31 ms to minimize.
[2024-05-22 23:58:11] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-22 23:58:11] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 3 ms to minimize.
[2024-05-22 23:58:11] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 3 ms to minimize.
[2024-05-22 23:58:12] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 3 ms to minimize.
[2024-05-22 23:58:12] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-05-22 23:58:12] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 3 ms to minimize.
[2024-05-22 23:58:12] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2024-05-22 23:58:12] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2024-05-22 23:58:12] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 3 ms to minimize.
[2024-05-22 23:58:12] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 3 ms to minimize.
[2024-05-22 23:58:12] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 2 ms to minimize.
[2024-05-22 23:58:13] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-05-22 23:58:13] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-22 23:58:13] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 2 ms to minimize.
[2024-05-22 23:58:13] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-05-22 23:58:13] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2024-05-22 23:58:13] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-05-22 23:58:13] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2024-05-22 23:58:13] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 23:58:14] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-22 23:58:14] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-22 23:58:14] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-22 23:58:14] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-22 23:58:14] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 2 ms to minimize.
[2024-05-22 23:58:14] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-22 23:58:14] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2024-05-22 23:58:14] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 2 ms to minimize.
[2024-05-22 23:58:14] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-22 23:58:15] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-22 23:58:15] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2024-05-22 23:58:15] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-22 23:58:15] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 23:58:16] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 23:58:17] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-05-22 23:58:17] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-05-22 23:58:17] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-22 23:58:17] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-22 23:58:17] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-05-22 23:58:18] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-05-22 23:58:18] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 2 ms to minimize.
[2024-05-22 23:58:18] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 2 ms to minimize.
[2024-05-22 23:58:18] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-22 23:58:18] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 176/275 variables, 99/154 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 12/166 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 23:58:21] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/275 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 167 constraints, problems are : Problem set: 0 solved, 172 unsolved in 19597 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 23:58:29] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-05-22 23:58:30] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-22 23:58:30] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-05-22 23:58:30] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-05-22 23:58:30] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-05-22 23:58:30] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-22 23:58:30] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-22 23:58:31] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-22 23:58:31] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-22 23:58:31] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-05-22 23:58:31] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 3 ms to minimize.
[2024-05-22 23:58:31] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 23:58:32] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-22 23:58:32] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2024-05-22 23:58:32] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2024-05-22 23:58:33] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-22 23:58:33] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-22 23:58:33] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 23:58:34] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 3 ms to minimize.
[2024-05-22 23:58:34] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-05-22 23:58:35] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-22 23:58:35] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 23:58:35] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 3 ms to minimize.
[2024-05-22 23:58:36] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-05-22 23:58:36] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 3 ms to minimize.
[2024-05-22 23:58:37] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-22 23:58:37] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-22 23:58:37] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-05-22 23:58:37] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 176/275 variables, 99/184 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 12/196 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 172/368 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 23:58:46] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 23:58:54] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 2 ms to minimize.
[2024-05-22 23:58:54] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-22 23:58:55] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-22 23:58:58] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-22 23:58:58] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-22 23:58:58] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-22 23:58:59] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 376 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 82/82 constraints]
After SMT, in 50043ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 50076ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 176/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51194 ms. Remains : 99/105 places, 176/200 transitions.
Support contains 58 out of 99 places after structural reductions.
[2024-05-22 23:58:59] [INFO ] Flatten gal took : 89 ms
[2024-05-22 23:58:59] [INFO ] Flatten gal took : 40 ms
[2024-05-22 23:59:00] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 50 out of 99 places (down from 58) after GAL structural reductions.
FORMULA Anderson-PT-04-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1898 ms. (21 steps per ms) remains 2/41 properties
BEST_FIRST walk for 40001 steps (8 resets) in 491 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/2 properties
[2024-05-22 23:59:00] [INFO ] Invariant cache hit.
[2024-05-22 23:59:00] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/99 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 23:59:01] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-22 23:59:01] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 176/275 variables, 99/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/275 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 124 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/99 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 176/275 variables, 99/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/275 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 404ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 99 transition count 164
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 87 transition count 164
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 42 place count 69 transition count 92
Iterating global reduction 0 with 18 rules applied. Total rules applied 60 place count 69 transition count 92
Applied a total of 60 rules in 30 ms. Remains 69 /99 variables (removed 30) and now considering 92/176 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 69/99 places, 92/176 transitions.
RANDOM walk for 40000 steps (8 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Probably explored full state space saw : 1232 states, properties seen :0
Probabilistic random walk after 3868 steps, saw 1232 distinct states, run finished after 32 ms. (steps per millisecond=120 ) properties seen :0
Explored full state space saw : 1232 states, properties seen :0
Exhaustive walk after 3868 steps, saw 1232 distinct states, run finished after 16 ms. (steps per millisecond=241 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA Anderson-PT-04-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 23:59:01] [INFO ] Flatten gal took : 23 ms
[2024-05-22 23:59:01] [INFO ] Flatten gal took : 25 ms
[2024-05-22 23:59:01] [INFO ] Input system was already deterministic with 176 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 176/176 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 81 transition count 104
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 81 transition count 104
Applied a total of 36 rules in 12 ms. Remains 81 /99 variables (removed 18) and now considering 104/176 (removed 72) transitions.
// Phase 1: matrix 104 rows 81 cols
[2024-05-22 23:59:01] [INFO ] Computed 11 invariants in 10 ms
[2024-05-22 23:59:01] [INFO ] Implicit Places using invariants in 157 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 159 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/99 places, 104/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 80/99 places, 104/176 transitions.
[2024-05-22 23:59:01] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:59:01] [INFO ] Flatten gal took : 15 ms
[2024-05-22 23:59:01] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-22 23:59:01] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:59:01] [INFO ] Flatten gal took : 10 ms
[2024-05-22 23:59:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality17138824198389502070.gal : 6 ms
[2024-05-22 23:59:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality11828581675716844213.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/CTLCardinality17138824198389502070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11828581675716844213.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,5060,0.108362,6236,2,2324,5,10347,6,0,427,7030,0


Converting to forward existential form...Done !
original formula: E(AF(EX(!(EX((p3_1_1==1))))) U EG(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EG(!(EX(!(EX((p3_1_1==1)))))))),!(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t88, t89, t90, t91, t92, t93, t94, t95, t96, t97, t98, t99, t100, t101, t102, t103, Intersec...245
Using saturation style SCC detection
(forward)formula 0,0,0.958233,31220,1,0,244,142263,237,130,3129,78345,258
FORMULA Anderson-PT-04-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 176/176 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 84 transition count 119
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 84 transition count 119
Applied a total of 30 rules in 7 ms. Remains 84 /99 variables (removed 15) and now considering 119/176 (removed 57) transitions.
// Phase 1: matrix 119 rows 84 cols
[2024-05-22 23:59:03] [INFO ] Computed 11 invariants in 3 ms
[2024-05-22 23:59:03] [INFO ] Implicit Places using invariants in 101 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/99 places, 119/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 83/99 places, 119/176 transitions.
[2024-05-22 23:59:03] [INFO ] Flatten gal took : 9 ms
[2024-05-22 23:59:03] [INFO ] Flatten gal took : 10 ms
[2024-05-22 23:59:03] [INFO ] Input system was already deterministic with 119 transitions.
[2024-05-22 23:59:03] [INFO ] Flatten gal took : 10 ms
[2024-05-22 23:59:03] [INFO ] Flatten gal took : 10 ms
[2024-05-22 23:59:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality17402454312389525518.gal : 3 ms
[2024-05-22 23:59:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality17880079910786762055.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/CTLCardinality17402454312389525518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17880079910786762055.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,6856,0.175508,8788,2,2820,5,17321,6,0,454,12988,0


Converting to forward existential form...Done !
original formula: AF(AX((((AG((p2_1_2==1)) + E((p2_3_3==1) U (p1_2_5==1))) + (ncs_2_3==0)) * (EG(((cs_1_3==0)&&(p2_2_0==1))) + AX(((ncs_3_0==0)&&(p2_2_0==1...162
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((!(E(TRUE U !((p2_1_2==1)))) + E((p2_3_3==1) U (p1_2_5==1))) + (ncs_2_3==0)) * (EG(((cs_1_...231
Reverse transition relation is NOT exact ! Due to transitions t44, t45, t48, t49, t56, t57, t65, t103, t104, t105, t106, t107, t108, t109, t110, t111, t112...292
(forward)formula 0,0,2.57784,75516,1,0,436,359209,279,257,3318,248320,493
FORMULA Anderson-PT-04-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 176/176 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 99 transition count 165
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 88 transition count 165
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 40 place count 70 transition count 93
Iterating global reduction 0 with 18 rules applied. Total rules applied 58 place count 70 transition count 93
Applied a total of 58 rules in 14 ms. Remains 70 /99 variables (removed 29) and now considering 93/176 (removed 83) transitions.
// Phase 1: matrix 93 rows 70 cols
[2024-05-22 23:59:05] [INFO ] Computed 11 invariants in 2 ms
[2024-05-22 23:59:05] [INFO ] Implicit Places using invariants in 108 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 69/99 places, 93/176 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 69 transition count 78
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 54 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 53 transition count 77
Applied a total of 32 rules in 8 ms. Remains 53 /69 variables (removed 16) and now considering 77/93 (removed 16) transitions.
// Phase 1: matrix 77 rows 53 cols
[2024-05-22 23:59:05] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 23:59:06] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-22 23:59:06] [INFO ] Invariant cache hit.
[2024-05-22 23:59:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 23:59:06] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 53/99 places, 77/176 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 413 ms. Remains : 53/99 places, 77/176 transitions.
[2024-05-22 23:59:06] [INFO ] Flatten gal took : 10 ms
[2024-05-22 23:59:06] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:59:06] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-22 23:59:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 23:59:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 23:59:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality1832568137824282945.gal : 2 ms
[2024-05-22 23:59:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality5108688452333058266.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/CTLCardinality1832568137824282945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5108688452333058266.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,983,0.052752,5092,2,1452,5,6068,6,0,292,3817,0


Converting to forward existential form...Done !
original formula: AG(AF(((p3_0_0==1)&&(p2_3_2==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p3_0_0==1)&&(p2_3_2==1))))] = FALSE
Hit Full ! (commute/partial/dont) 73/0/4
(forward)formula 0,0,0.284961,12220,1,0,7,40438,20,1,1691,14108,8
FORMULA Anderson-PT-04-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 99 transition count 164
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 87 transition count 164
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 41 place count 70 transition count 99
Iterating global reduction 0 with 17 rules applied. Total rules applied 58 place count 70 transition count 99
Applied a total of 58 rules in 14 ms. Remains 70 /99 variables (removed 29) and now considering 99/176 (removed 77) transitions.
// Phase 1: matrix 99 rows 70 cols
[2024-05-22 23:59:06] [INFO ] Computed 11 invariants in 2 ms
[2024-05-22 23:59:06] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 23:59:06] [INFO ] Invariant cache hit.
[2024-05-22 23:59:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 23:59:06] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-05-22 23:59:06] [INFO ] Redundant transitions in 3 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-22 23:59:06] [INFO ] Invariant cache hit.
[2024-05-22 23:59:06] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-22 23:59:07] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-22 23:59:07] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-22 23:59:07] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-22 23:59:07] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
[2024-05-22 23:59:07] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-22 23:59:08] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-22 23:59:08] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-22 23:59:08] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-22 23:59:08] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-22 23:59:08] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 99/169 variables, 70/91 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 95 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 103 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5351 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-22 23:59:12] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-22 23:59:13] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-22 23:59:13] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-22 23:59:13] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-05-22 23:59:13] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-05-22 23:59:13] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-22 23:59:13] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-22 23:59:14] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-22 23:59:14] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 99/169 variables, 70/100 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 95/207 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-22 23:59:18] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-22 23:59:18] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-22 23:59:18] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-22 23:59:22] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/169 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-22 23:59:26] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-22 23:59:29] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-22 23:59:34] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/169 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 18 (OVERLAPS) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 214 constraints, problems are : Problem set: 0 solved, 95 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 26/26 constraints]
After SMT, in 35440ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 35443ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/99 places, 99/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35815 ms. Remains : 70/99 places, 99/176 transitions.
[2024-05-22 23:59:42] [INFO ] Flatten gal took : 9 ms
[2024-05-22 23:59:42] [INFO ] Flatten gal took : 10 ms
[2024-05-22 23:59:42] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-22 23:59:42] [INFO ] Flatten gal took : 9 ms
[2024-05-22 23:59:42] [INFO ] Flatten gal took : 9 ms
[2024-05-22 23:59:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality11015106834409721720.gal : 3 ms
[2024-05-22 23:59:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality325387289007174293.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/CTLCardinality11015106834409721720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality325387289007174293.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,1485,0.198316,10080,2,3625,5,21333,6,0,382,13437,0


Converting to forward existential form...Done !
original formula: AF(AG(((slot_F.F.F.F==0)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((slot_F.F.F.F==0)&&(ncs_0_2==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t71, t72, t73, t74, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, Intersection...240
(forward)formula 0,0,1.13077,39496,1,0,197,144210,224,103,3081,64233,213
FORMULA Anderson-PT-04-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 176/176 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 83 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 83 transition count 112
Applied a total of 32 rules in 7 ms. Remains 83 /99 variables (removed 16) and now considering 112/176 (removed 64) transitions.
// Phase 1: matrix 112 rows 83 cols
[2024-05-22 23:59:43] [INFO ] Computed 11 invariants in 2 ms
[2024-05-22 23:59:43] [INFO ] Implicit Places using invariants in 103 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/99 places, 112/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 82/99 places, 112/176 transitions.
[2024-05-22 23:59:43] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:59:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:59:43] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-22 23:59:43] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:59:43] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:59:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality1010614391292833367.gal : 1 ms
[2024-05-22 23:59:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality8362016243943758599.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/CTLCardinality1010614391292833367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8362016243943758599.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,6079,0.111262,7148,2,2611,5,13457,6,0,443,9609,0


Converting to forward existential form...Done !
original formula: EG((!(A(A(AG(((slot_F.T.F.F==0)||(p1_3_1==1))) U !(((next_4==0)||(p3_3_1==1)))) U AG(AX((cs_1_1==1))))) + AG((((slot_F.F.F.T==0)||(slot_T...199
=> equivalent forward existential formula: [FwdG(Init,(!(!((E(!(!(E(TRUE U !(!(EX(!((cs_1_1==1)))))))) U (!(!((E(!(!(((next_4==0)||(p3_3_1==1)))) U (!(!(E(...474
Reverse transition relation is NOT exact ! Due to transitions t37, t38, t41, t42, t45, t46, t61, t96, t97, t98, t99, t100, t101, t102, t103, t104, t105, t1...288
(forward)formula 0,1,2.14544,62544,1,0,370,348889,260,181,3305,186293,435
FORMULA Anderson-PT-04-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 176/176 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 99 transition count 165
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 88 transition count 165
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 39 place count 71 transition count 94
Iterating global reduction 0 with 17 rules applied. Total rules applied 56 place count 71 transition count 94
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 0 with 2 rules applied. Total rules applied 58 place count 70 transition count 93
Applied a total of 58 rules in 13 ms. Remains 70 /99 variables (removed 29) and now considering 93/176 (removed 83) transitions.
// Phase 1: matrix 93 rows 70 cols
[2024-05-22 23:59:45] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 23:59:46] [INFO ] Implicit Places using invariants in 125 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 128 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 69/99 places, 93/176 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 69 transition count 78
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 54 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 53 transition count 77
Applied a total of 32 rules in 8 ms. Remains 53 /69 variables (removed 16) and now considering 77/93 (removed 16) transitions.
// Phase 1: matrix 77 rows 53 cols
[2024-05-22 23:59:46] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 23:59:46] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 23:59:46] [INFO ] Invariant cache hit.
[2024-05-22 23:59:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 23:59:46] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 53/99 places, 77/176 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 337 ms. Remains : 53/99 places, 77/176 transitions.
[2024-05-22 23:59:46] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:59:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 23:59:46] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-22 23:59:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 23:59:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 23:59:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality10208920419553874354.gal : 1 ms
[2024-05-22 23:59:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality16023094860333937495.ctl : 9 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/CTLCardinality10208920419553874354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16023094860333937495.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,977,0.073972,5092,2,1468,5,6117,6,0,292,3939,0


Converting to forward existential form...Done !
original formula: EG(AF(E((((p1_3_2==0)||(next_5==0))||(p3_0_1==1)) U AF((p1_0_3==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E((((p1_3_2==0)||(next_5==0))||(p3_0_1==1)) U !(EG(!((p1_0_3==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t30, t34, t38, t43, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63...260
Using saturation style SCC detection
(forward)formula 0,1,0.900674,25992,1,0,268,125995,189,132,2373,75328,274
FORMULA Anderson-PT-04-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 176/176 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 83 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 83 transition count 112
Applied a total of 32 rules in 3 ms. Remains 83 /99 variables (removed 16) and now considering 112/176 (removed 64) transitions.
// Phase 1: matrix 112 rows 83 cols
[2024-05-22 23:59:47] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 23:59:47] [INFO ] Implicit Places using invariants in 108 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/99 places, 112/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 82/99 places, 112/176 transitions.
[2024-05-22 23:59:47] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:59:47] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:59:47] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-22 23:59:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 23:59:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 23:59:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality11066983694011774104.gal : 2 ms
[2024-05-22 23:59:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality7032968712542734854.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/CTLCardinality11066983694011774104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7032968712542734854.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,6176,0.131601,7408,2,2542,5,14253,6,0,443,10118,0


Converting to forward existential form...Done !
original formula: EF(AX(!(A(!(A((ncs_2_3==1) U ((p1_0_3==0)||(p3_2_2==1)))) U (((cs_2_3==0)&&(p2_2_1==0)) + AF(((slot_T.F.F.F==0)||(p1_0_6==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(!((E(!((((cs_2_3==0)&&(p2_2_1==0)) + !(EG(!(((slot_T.F.F.F==0)||(p1_0_6==1))))))) U...469
Reverse transition relation is NOT exact ! Due to transitions t17, t42, t46, t50, t53, t54, t96, t97, t98, t99, t100, t101, t102, t103, t104, t105, t106, t...283
(forward)formula 0,0,1.16574,35512,1,0,269,163047,259,136,3097,84686,295
FORMULA Anderson-PT-04-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 176/176 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 86 transition count 121
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 86 transition count 121
Applied a total of 26 rules in 2 ms. Remains 86 /99 variables (removed 13) and now considering 121/176 (removed 55) transitions.
// Phase 1: matrix 121 rows 86 cols
[2024-05-22 23:59:48] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 23:59:48] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 23:59:48] [INFO ] Invariant cache hit.
[2024-05-22 23:59:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 23:59:48] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-22 23:59:48] [INFO ] Invariant cache hit.
[2024-05-22 23:59:48] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-22 23:59:49] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-22 23:59:49] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-22 23:59:49] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-05-22 23:59:49] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 2 ms to minimize.
[2024-05-22 23:59:50] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2024-05-22 23:59:50] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-22 23:59:50] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-22 23:59:50] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-22 23:59:50] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-22 23:59:50] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-22 23:59:50] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-22 23:59:51] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-22 23:59:51] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-05-22 23:59:51] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-22 23:59:51] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-22 23:59:51] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-22 23:59:51] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-05-22 23:59:51] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-22 23:59:52] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-05-22 23:59:52] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-05-22 23:59:52] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-05-22 23:59:52] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-05-22 23:59:52] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 2 ms to minimize.
[2024-05-22 23:59:52] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-22 23:59:53] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-22 23:59:53] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 2 ms to minimize.
[2024-05-22 23:59:53] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-22 23:59:53] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-22 23:59:54] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-22 23:59:54] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-22 23:59:54] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-22 23:59:54] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
[2024-05-22 23:59:55] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 2 ms to minimize.
[2024-05-22 23:59:55] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-22 23:59:56] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-22 23:59:56] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-22 23:59:56] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-22 23:59:56] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 121/207 variables, 86/135 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 12/147 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 147 constraints, problems are : Problem set: 0 solved, 117 unsolved in 14027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 86/86 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-23 00:00:03] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:00:04] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:00:04] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:00:04] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-23 00:00:04] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 121/207 variables, 86/140 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 117/269 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 269 constraints, problems are : Problem set: 0 solved, 117 unsolved in 18705 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 86/86 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 43/43 constraints]
After SMT, in 32794ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 32796ms
Starting structural reductions in LTL mode, iteration 1 : 86/99 places, 121/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33077 ms. Remains : 86/99 places, 121/176 transitions.
[2024-05-23 00:00:21] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:00:21] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:00:21] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-23 00:00:21] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:00:21] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:00:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality15816390300786778796.gal : 5 ms
[2024-05-23 00:00:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality14283802447395925781.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/CTLCardinality15816390300786778796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14283802447395925781.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,7615,0.47349,15224,2,4340,5,44646,6,0,468,26801,0


Converting to forward existential form...Done !
original formula: E(((EF((((ncs_3_0==0)||(next_7==1))||(((((p1_0_0==0)||(slot_F.F.F.F==1))||((ncs_0_0==1)||(p2_2_2==0)))||(p1_1_0==1))&&(cs_3_3==1)))) + !(...268
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U (((ncs_3_0==0)||(next_7==1))||(((((p1_0_0==0)||(slot_F.F.F.F==1))||((ncs_0_0==1)||(p2_2_2...440
Reverse transition relation is NOT exact ! Due to transitions t43, t44, t45, t47, t48, t49, t51, t52, t53, t55, t56, t57, t58, t59, t62, t63, t105, t106, t...337
(forward)formula 0,0,3.71372,97956,1,0,369,562966,274,180,3521,262424,410
FORMULA Anderson-PT-04-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 99 transition count 164
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 87 transition count 164
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 41 place count 70 transition count 99
Iterating global reduction 0 with 17 rules applied. Total rules applied 58 place count 70 transition count 99
Applied a total of 58 rules in 10 ms. Remains 70 /99 variables (removed 29) and now considering 99/176 (removed 77) transitions.
// Phase 1: matrix 99 rows 70 cols
[2024-05-23 00:00:25] [INFO ] Computed 11 invariants in 2 ms
[2024-05-23 00:00:25] [INFO ] Implicit Places using invariants in 100 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 69/99 places, 99/176 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 69 transition count 85
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 55 transition count 85
Applied a total of 28 rules in 5 ms. Remains 55 /69 variables (removed 14) and now considering 85/99 (removed 14) transitions.
// Phase 1: matrix 85 rows 55 cols
[2024-05-23 00:00:25] [INFO ] Computed 10 invariants in 1 ms
[2024-05-23 00:00:25] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-23 00:00:25] [INFO ] Invariant cache hit.
[2024-05-23 00:00:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:00:25] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 55/99 places, 85/176 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 316 ms. Remains : 55/99 places, 85/176 transitions.
[2024-05-23 00:00:25] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:00:25] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:00:25] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-23 00:00:25] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:00:25] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:00:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality17095831493147403145.gal : 2 ms
[2024-05-23 00:00:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality6691815762789189914.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/CTLCardinality17095831493147403145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6691815762789189914.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,1062,0.078839,6216,2,1582,5,8692,6,0,308,6277,0


Converting to forward existential form...Done !
original formula: EG(((ncs_1_3==0)||(cs_0_0==1)))
=> equivalent forward existential formula: [FwdG(Init,((ncs_1_3==0)||(cs_0_0==1)))] != FALSE
Hit Full ! (commute/partial/dont) 75/0/10
(forward)formula 0,1,0.331117,13872,1,0,8,48079,19,2,1806,18170,8
FORMULA Anderson-PT-04-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 176/176 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 81 transition count 104
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 81 transition count 104
Applied a total of 36 rules in 2 ms. Remains 81 /99 variables (removed 18) and now considering 104/176 (removed 72) transitions.
// Phase 1: matrix 104 rows 81 cols
[2024-05-23 00:00:26] [INFO ] Computed 11 invariants in 1 ms
[2024-05-23 00:00:26] [INFO ] Implicit Places using invariants in 108 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/99 places, 104/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 80/99 places, 104/176 transitions.
[2024-05-23 00:00:26] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:00:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:00:26] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-23 00:00:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:00:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:00:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality8425795990710700843.gal : 1 ms
[2024-05-23 00:00:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality10535183822220505398.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/CTLCardinality8425795990710700843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10535183822220505398.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,5060,0.085475,6296,2,2324,5,10347,6,0,427,7030,0


Converting to forward existential form...Done !
original formula: EX(EF((p3_0_2==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (p3_0_2==1))] != FALSE
(forward)formula 0,1,0.125937,6560,1,0,7,10424,9,1,882,7030,4
FORMULA Anderson-PT-04-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 176/176 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 99 transition count 165
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 88 transition count 165
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 40 place count 70 transition count 93
Iterating global reduction 0 with 18 rules applied. Total rules applied 58 place count 70 transition count 93
Applied a total of 58 rules in 7 ms. Remains 70 /99 variables (removed 29) and now considering 93/176 (removed 83) transitions.
// Phase 1: matrix 93 rows 70 cols
[2024-05-23 00:00:26] [INFO ] Computed 11 invariants in 7 ms
[2024-05-23 00:00:26] [INFO ] Implicit Places using invariants in 100 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 69/99 places, 93/176 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 69 transition count 78
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 54 transition count 78
Applied a total of 30 rules in 7 ms. Remains 54 /69 variables (removed 15) and now considering 78/93 (removed 15) transitions.
// Phase 1: matrix 78 rows 54 cols
[2024-05-23 00:00:26] [INFO ] Computed 10 invariants in 2 ms
[2024-05-23 00:00:26] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-23 00:00:26] [INFO ] Invariant cache hit.
[2024-05-23 00:00:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:00:26] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 54/99 places, 78/176 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 400 ms. Remains : 54/99 places, 78/176 transitions.
[2024-05-23 00:00:26] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:00:26] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:00:26] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-23 00:00:26] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:00:26] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:00:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality4024055135514011196.gal : 1 ms
[2024-05-23 00:00:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality1222179943735262763.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/CTLCardinality4024055135514011196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1222179943735262763.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,1014,0.08447,5104,2,1458,5,6210,6,0,297,3902,0


Converting to forward existential form...Done !
original formula: EF(EG((EF((AF(((p3_0_2==0)||(p2_3_3==1))) * AF((cs_0_2==1)))) * (p2_3_2==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(E(TRUE U (!(EG(!(((p3_0_2==0)||(p2_3_3==1))))) * !(EG(!((cs_0_2==1)))))) * (p2_3_2==0)))]...164
Reverse transition relation is NOT exact ! Due to transitions t50, t51, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, Intersection...240
(forward)formula 0,1,0.511406,20480,1,0,260,88870,195,119,2315,44995,307
FORMULA Anderson-PT-04-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 176/176 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 84 transition count 119
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 84 transition count 119
Applied a total of 30 rules in 4 ms. Remains 84 /99 variables (removed 15) and now considering 119/176 (removed 57) transitions.
// Phase 1: matrix 119 rows 84 cols
[2024-05-23 00:00:27] [INFO ] Computed 11 invariants in 2 ms
[2024-05-23 00:00:27] [INFO ] Implicit Places using invariants in 116 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/99 places, 119/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 83/99 places, 119/176 transitions.
[2024-05-23 00:00:27] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:00:27] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:00:27] [INFO ] Input system was already deterministic with 119 transitions.
[2024-05-23 00:00:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:00:27] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:00:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality114012770110254950.gal : 1 ms
[2024-05-23 00:00:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality10231772587004521648.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/CTLCardinality114012770110254950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10231772587004521648.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,6856,0.191663,9056,2,2855,5,19489,6,0,454,15697,0


Converting to forward existential form...Done !
original formula: AG(((!(A(EX((ncs_0_2==0)) U AG((p2_2_1==1)))) + (ncs_3_2==1)) + ((p2_2_2==0)&&(p1_3_1==1))))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * !(((p2_2_2==0)&&(p1_3_1==1)))) * !((ncs_3_2==1))) * !(EG(!(!(E(TRUE U !((p2_2_1==1)))))))...262
Reverse transition relation is NOT exact ! Due to transitions t44, t45, t48, t49, t52, t53, t68, t103, t104, t105, t106, t107, t108, t109, t110, t111, t112...292
(forward)formula 0,1,1.47629,46444,1,0,279,227859,261,148,3279,115881,311
FORMULA Anderson-PT-04-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-23 00:00:28] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:00:29] [INFO ] Flatten gal took : 5 ms
Total runtime 141525 ms.

BK_STOP 1716422429086

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Anderson-PT-04, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r004-smll-171620118300313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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