Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898700161.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CO4-PT-21, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898700161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 344K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717356481154

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 19:28:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 19:28:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:28:02] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-06-02 19:28:02] [INFO ] Transformed 1400 places.
[2024-06-02 19:28:02] [INFO ] Transformed 1583 transitions.
[2024-06-02 19:28:02] [INFO ] Found NUPN structural information;
[2024-06-02 19:28:02] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 307 places in 17 ms
Reduce places removed 307 places and 347 transitions.
FORMULA CO4-PT-21-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1070 transition count 1231
Discarding 159 places :
Symmetric choice reduction at 1 with 159 rule applications. Total rules 187 place count 911 transition count 1072
Iterating global reduction 1 with 159 rules applied. Total rules applied 346 place count 911 transition count 1072
Discarding 141 places :
Symmetric choice reduction at 1 with 141 rule applications. Total rules 487 place count 770 transition count 931
Iterating global reduction 1 with 141 rules applied. Total rules applied 628 place count 770 transition count 931
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 630 place count 770 transition count 929
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 696 place count 704 transition count 863
Iterating global reduction 2 with 66 rules applied. Total rules applied 762 place count 704 transition count 863
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 808 place count 658 transition count 817
Iterating global reduction 2 with 46 rules applied. Total rules applied 854 place count 658 transition count 817
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 855 place count 658 transition count 816
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 876 place count 637 transition count 795
Iterating global reduction 3 with 21 rules applied. Total rules applied 897 place count 637 transition count 795
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 904 place count 630 transition count 788
Iterating global reduction 3 with 7 rules applied. Total rules applied 911 place count 630 transition count 788
Applied a total of 911 rules in 353 ms. Remains 630 /1093 variables (removed 463) and now considering 788/1236 (removed 448) transitions.
// Phase 1: matrix 788 rows 630 cols
[2024-06-02 19:28:03] [INFO ] Computed 5 invariants in 26 ms
[2024-06-02 19:28:03] [INFO ] Implicit Places using invariants in 358 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 407 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 629/1093 places, 788/1236 transitions.
Applied a total of 0 rules in 26 ms. Remains 629 /629 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 801 ms. Remains : 629/1093 places, 788/1236 transitions.
Support contains 37 out of 629 places after structural reductions.
[2024-06-02 19:28:03] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-02 19:28:03] [INFO ] Flatten gal took : 125 ms
FORMULA CO4-PT-21-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:28:03] [INFO ] Flatten gal took : 37 ms
[2024-06-02 19:28:03] [INFO ] Input system was already deterministic with 788 transitions.
Support contains 31 out of 629 places (down from 37) after GAL structural reductions.
RANDOM walk for 40000 steps (60 resets) in 1987 ms. (20 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4003 steps (15 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 36 ms. (108 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (17 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (18 resets) in 33 ms. (117 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4002 steps (18 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (16 resets) in 33 ms. (117 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (19 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (17 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (13 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (16 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (18 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (14 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (17 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (17 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (19 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
// Phase 1: matrix 788 rows 629 cols
[2024-06-02 19:28:04] [INFO ] Computed 4 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 54/79 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 205/284 variables, 51/76 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 12/296 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 17/313 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 431/744 variables, 179/260 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/744 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 414/1158 variables, 220/480 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1158 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 180/1338 variables, 103/583 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1338 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 54/1392 variables, 35/618 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1392 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 18/1410 variables, 10/628 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1410 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 7/1417 variables, 5/633 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1417 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 0/1417 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1417/1417 variables, and 633 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2317 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 629/629 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 54/79 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 205/284 variables, 51/76 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 12/296 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 17/313 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 431/744 variables, 179/275 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/744 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 414/1158 variables, 220/495 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1158 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 180/1338 variables, 103/598 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1338 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 54/1392 variables, 35/633 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1392 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 18/1410 variables, 10/643 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1410 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (OVERLAPS) 7/1417 variables, 5/648 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1417 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (OVERLAPS) 0/1417 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1417/1417 variables, and 648 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3434 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 629/629 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 5808ms problems are : Problem set: 0 solved, 15 unsolved
Finished Parikh walk after 729 steps, including 5 resets, run visited all 2 properties in 3 ms. (steps per millisecond=243 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 15 properties in 3086 ms.
[2024-06-02 19:28:13] [INFO ] Flatten gal took : 36 ms
[2024-06-02 19:28:13] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:28:13] [INFO ] Input system was already deterministic with 788 transitions.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 983 edges and 629 vertex of which 621 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 788/788 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 609 transition count 767
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 609 transition count 767
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 609 transition count 765
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 53 place count 598 transition count 754
Iterating global reduction 1 with 11 rules applied. Total rules applied 64 place count 598 transition count 754
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 593 transition count 749
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 593 transition count 749
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 592 transition count 748
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 592 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 592 transition count 747
Applied a total of 77 rules in 61 ms. Remains 592 /629 variables (removed 37) and now considering 747/788 (removed 41) transitions.
// Phase 1: matrix 747 rows 592 cols
[2024-06-02 19:28:13] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 19:28:14] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-02 19:28:14] [INFO ] Invariant cache hit.
[2024-06-02 19:28:14] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 746 sub problems to find dead transitions.
[2024-06-02 19:28:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 3 (OVERLAPS) 747/1339 variables, 592/596 constraints. Problems are: Problem set: 0 solved, 746 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1339/1339 variables, and 596 constraints, problems are : Problem set: 0 solved, 746 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 746/746 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 746 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 3 (OVERLAPS) 747/1339 variables, 592/596 constraints. Problems are: Problem set: 0 solved, 746 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1339 variables, 746/1342 constraints. Problems are: Problem set: 0 solved, 746 unsolved
[2024-06-02 19:29:02] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1339/1339 variables, and 1343 constraints, problems are : Problem set: 0 solved, 746 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 746/746 constraints, Known Traps: 1/1 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 746 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Starting structural reductions in LTL mode, iteration 1 : 592/629 places, 747/788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60901 ms. Remains : 592/629 places, 747/788 transitions.
[2024-06-02 19:29:14] [INFO ] Flatten gal took : 30 ms
[2024-06-02 19:29:14] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:29:14] [INFO ] Input system was already deterministic with 747 transitions.
[2024-06-02 19:29:14] [INFO ] Flatten gal took : 38 ms
[2024-06-02 19:29:14] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:29:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality16542758855058618694.gal : 31 ms
[2024-06-02 19:29:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality9805397796600117369.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16542758855058618694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9805397796600117369.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.02582e+11,3.08729,93828,2,11466,5,281651,6,0,3113,498068,0


Converting to forward existential form...Done !
original formula: EX(E((!(EF((p1173==1))) + EX(A((p1305==1) U (p315==1)))) U (((p153==0)||(p1190==0)) + ((p1259==1) + !(AF((p1144==0)))))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),(!(E(TRUE U (p1173==1))) + EX(!((E(!((p315==1)) U (!((p1305==1)) * !((p315==1)))) + EG(!((p315=...506
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t26, t27, t28, t33, t35, t40, t49, t51, t52, t53, t54, t55, t58, t60, t62...550
Detected timeout of ITS tools.
[2024-06-02 19:29:45] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:29:45] [INFO ] Applying decomposition
[2024-06-02 19:29:45] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10757810176415073.txt' '-o' '/tmp/graph10757810176415073.bin' '-w' '/tmp/graph10757810176415073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10757810176415073.bin' '-l' '-1' '-v' '-w' '/tmp/graph10757810176415073.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:29:45] [INFO ] Decomposing Gal with order
[2024-06-02 19:29:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:29:45] [INFO ] Removed a total of 223 redundant transitions.
[2024-06-02 19:29:45] [INFO ] Flatten gal took : 72 ms
[2024-06-02 19:29:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 14 ms.
[2024-06-02 19:29:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17514630739768123607.gal : 11 ms
[2024-06-02 19:29:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality3745408673034987467.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/CTLCardinality17514630739768123607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3745408673034987467.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.02582e+11,0.366763,18696,1110,106,26099,4481,1224,52897,99,18560,0


Converting to forward existential form...Done !
original formula: EX(E((!(EF((i18.i1.i0.u189.p1173==1))) + EX(A((i22.u217.p1305==1) U (i6.u35.p315==1)))) U (((i3.u12.p153==0)||(i19.i0.i0.u152.p1190==0)) ...210
=> equivalent forward existential formula: ([(FwdU(EY(Init),(!(E(TRUE U (i18.i1.i0.u189.p1173==1))) + EX(!((E(!((i6.u35.p315==1)) U (!((i22.u217.p1305==1))...681
Reverse transition relation is NOT exact ! Due to transitions t23, t51, t65, t110, t279, t291, t311, t350, t384, t463, t504, t559, t561, t581, t630, t657, ...878
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 788/788 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 613 transition count 771
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 613 transition count 771
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 613 transition count 770
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 605 transition count 762
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 605 transition count 762
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 605 transition count 761
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 602 transition count 758
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 602 transition count 758
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 601 transition count 757
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 601 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 601 transition count 756
Applied a total of 59 rules in 55 ms. Remains 601 /629 variables (removed 28) and now considering 756/788 (removed 32) transitions.
// Phase 1: matrix 756 rows 601 cols
[2024-06-02 19:30:15] [INFO ] Computed 4 invariants in 8 ms
[2024-06-02 19:30:15] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 19:30:15] [INFO ] Invariant cache hit.
[2024-06-02 19:30:15] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 755 sub problems to find dead transitions.
[2024-06-02 19:30:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 1 (OVERLAPS) 1/601 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/601 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 3 (OVERLAPS) 756/1357 variables, 601/605 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1357/1357 variables, and 605 constraints, problems are : Problem set: 0 solved, 755 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 755/755 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 755 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 1 (OVERLAPS) 1/601 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/601 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 3 (OVERLAPS) 756/1357 variables, 601/605 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 755/1360 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1357/1357 variables, and 1360 constraints, problems are : Problem set: 0 solved, 755 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 755/755 constraints, Known Traps: 0/0 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 755 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Starting structural reductions in LTL mode, iteration 1 : 601/629 places, 756/788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60714 ms. Remains : 601/629 places, 756/788 transitions.
[2024-06-02 19:31:16] [INFO ] Flatten gal took : 32 ms
[2024-06-02 19:31:16] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:31:16] [INFO ] Input system was already deterministic with 756 transitions.
[2024-06-02 19:31:16] [INFO ] Flatten gal took : 31 ms
[2024-06-02 19:31:16] [INFO ] Flatten gal took : 30 ms
[2024-06-02 19:31:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality4325059353494040642.gal : 30 ms
[2024-06-02 19:31:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality10165846204911715417.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/CTLCardinality4325059353494040642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10165846204911715417.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,9.80685e+10,3.18888,101588,2,11841,5,302823,6,0,3158,545669,0


Converting to forward existential form...Done !
original formula: EF((EF(EX((p1225==1))) + ((AG(((((p1317==0)&&(p981==1))||((p122==1)&&(p615==1))) + EG((p1117==0)))) * (p1119==0)) * ((p956==1) * AX(((p80...177
=> equivalent forward existential formula: ([(EY(FwdU(FwdU(Init,TRUE),TRUE)) * (p1225==1))] != FALSE + [(((FwdU(Init,TRUE) * (!(E(TRUE U !(((((p1317==0)&&(...285
(forward)formula 0,1,3.82854,101588,1,0,8,302823,9,1,6123,545669,4
FORMULA CO4-PT-21-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 788/788 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 605 transition count 763
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 605 transition count 763
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 605 transition count 761
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 592 transition count 748
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 592 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 592 transition count 747
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 84 place count 585 transition count 740
Iterating global reduction 2 with 7 rules applied. Total rules applied 91 place count 585 transition count 740
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 583 transition count 738
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 583 transition count 738
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 583 transition count 736
Applied a total of 97 rules in 50 ms. Remains 583 /629 variables (removed 46) and now considering 736/788 (removed 52) transitions.
// Phase 1: matrix 736 rows 583 cols
[2024-06-02 19:31:20] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 19:31:20] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 19:31:20] [INFO ] Invariant cache hit.
[2024-06-02 19:31:20] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2024-06-02 19:31:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-02 19:31:49] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 3 ms to minimize.
[2024-06-02 19:31:49] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 11 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 589 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (OVERLAPS) 736/1319 variables, 583/589 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1319 variables, 735/1324 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 1324 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 2/2 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in LTL mode, iteration 1 : 583/629 places, 736/788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60638 ms. Remains : 583/629 places, 736/788 transitions.
[2024-06-02 19:32:20] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:32:21] [INFO ] Flatten gal took : 38 ms
[2024-06-02 19:32:21] [INFO ] Input system was already deterministic with 736 transitions.
[2024-06-02 19:32:21] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:32:21] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:32:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality3934422356065700125.gal : 3 ms
[2024-06-02 19:32:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality9893930741048767266.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/CTLCardinality3934422356065700125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9893930741048767266.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,8.66365e+10,3.05478,93232,2,11501,5,278103,6,0,3066,489052,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,3.17759,93232,1,0,6,278103,7,1,3708,489052,1
FORMULA CO4-PT-21-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 788/788 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 607 transition count 766
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 607 transition count 766
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 607 transition count 764
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 57 place count 596 transition count 753
Iterating global reduction 1 with 11 rules applied. Total rules applied 68 place count 596 transition count 753
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 596 transition count 752
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 75 place count 590 transition count 746
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 590 transition count 746
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 588 transition count 744
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 588 transition count 744
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 588 transition count 742
Applied a total of 87 rules in 54 ms. Remains 588 /629 variables (removed 41) and now considering 742/788 (removed 46) transitions.
// Phase 1: matrix 742 rows 588 cols
[2024-06-02 19:32:24] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 19:32:24] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-02 19:32:24] [INFO ] Invariant cache hit.
[2024-06-02 19:32:24] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 741 sub problems to find dead transitions.
[2024-06-02 19:32:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 3 (OVERLAPS) 742/1330 variables, 588/592 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-02 19:32:54] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 4 ms to minimize.
[2024-06-02 19:32:54] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1330/1330 variables, and 594 constraints, problems are : Problem set: 0 solved, 741 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 741/741 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 741 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 4 (OVERLAPS) 742/1330 variables, 588/594 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1330 variables, 741/1335 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1330/1330 variables, and 1335 constraints, problems are : Problem set: 0 solved, 741 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 741/741 constraints, Known Traps: 2/2 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 741 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in LTL mode, iteration 1 : 588/629 places, 742/788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60674 ms. Remains : 588/629 places, 742/788 transitions.
[2024-06-02 19:33:25] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:33:25] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:33:25] [INFO ] Input system was already deterministic with 742 transitions.
[2024-06-02 19:33:25] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:33:25] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:33:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality613415903196745186.gal : 4 ms
[2024-06-02 19:33:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality11243557185892129025.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/CTLCardinality613415903196745186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11243557185892129025.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,8.74517e+10,2.82308,86356,2,11103,5,263627,6,0,3091,449658,0


Converting to forward existential form...Done !
original formula: EF((AX(FALSE) + ((EF(AX((p1235==0))) * EX(EG((p1079==0)))) * ((p696==0)||(p376==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE + [FwdG(EY(((FwdU(Init,TRUE) * ((p696==0)||(p376==1))) * E(TRUE ...203
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t26, t27, t28, t33, t35, t40, t49, t51, t52, t53, t54, t55, t57, t60, t10...540
(forward)formula 0,1,28.267,755892,1,0,926,2.77325e+06,1499,632,16474,2.95981e+06,1490
FORMULA CO4-PT-21-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 788/788 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 605 transition count 763
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 605 transition count 763
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 605 transition count 761
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 592 transition count 748
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 592 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 592 transition count 747
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 84 place count 585 transition count 740
Iterating global reduction 2 with 7 rules applied. Total rules applied 91 place count 585 transition count 740
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 583 transition count 738
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 583 transition count 738
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 583 transition count 736
Applied a total of 97 rules in 43 ms. Remains 583 /629 variables (removed 46) and now considering 736/788 (removed 52) transitions.
// Phase 1: matrix 736 rows 583 cols
[2024-06-02 19:33:53] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 19:33:53] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 19:33:53] [INFO ] Invariant cache hit.
[2024-06-02 19:33:54] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2024-06-02 19:33:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-02 19:34:22] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-06-02 19:34:23] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 589 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (OVERLAPS) 736/1319 variables, 583/589 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1319 variables, 735/1324 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 1324 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 2/2 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 583/629 places, 736/788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60651 ms. Remains : 583/629 places, 736/788 transitions.
[2024-06-02 19:34:54] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:34:54] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:34:54] [INFO ] Input system was already deterministic with 736 transitions.
[2024-06-02 19:34:54] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:34:54] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:34:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality6714670620859965629.gal : 3 ms
[2024-06-02 19:34:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality10316706911272585129.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/CTLCardinality6714670620859965629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10316706911272585129.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,8.66365e+10,3.02091,93508,2,11501,5,278103,6,0,3066,489052,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,3.14108,93508,1,0,6,278103,7,1,3708,489052,1
FORMULA CO4-PT-21-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 : 629/629 places, 788/788 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 607 transition count 765
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 607 transition count 765
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 607 transition count 764
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 57 place count 595 transition count 752
Iterating global reduction 1 with 12 rules applied. Total rules applied 69 place count 595 transition count 752
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 595 transition count 751
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 77 place count 588 transition count 744
Iterating global reduction 2 with 7 rules applied. Total rules applied 84 place count 588 transition count 744
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 586 transition count 742
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 586 transition count 742
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 586 transition count 740
Applied a total of 90 rules in 50 ms. Remains 586 /629 variables (removed 43) and now considering 740/788 (removed 48) transitions.
// Phase 1: matrix 740 rows 586 cols
[2024-06-02 19:34:57] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:34:57] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 19:34:57] [INFO ] Invariant cache hit.
[2024-06-02 19:34:58] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 739 sub problems to find dead transitions.
[2024-06-02 19:34:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 3 (OVERLAPS) 740/1326 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 739 unsolved
[2024-06-02 19:35:27] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 3 ms to minimize.
[2024-06-02 19:35:28] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 592 constraints, problems are : Problem set: 0 solved, 739 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 739 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 4 (OVERLAPS) 740/1326 variables, 586/592 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1326 variables, 739/1331 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 1331 constraints, problems are : Problem set: 0 solved, 739 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 2/2 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 739 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 586/629 places, 740/788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60648 ms. Remains : 586/629 places, 740/788 transitions.
[2024-06-02 19:35:58] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:35:58] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:35:58] [INFO ] Input system was already deterministic with 740 transitions.
[2024-06-02 19:35:58] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:35:58] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:35:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality9441994267954484263.gal : 3 ms
[2024-06-02 19:35:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality15617580213627824226.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/CTLCardinality9441994267954484263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15617580213627824226.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,8.81334e+10,3.06288,91656,2,11239,5,271103,6,0,3082,475196,0


Converting to forward existential form...Done !
original formula: AG((AG(AX((p342==0))) * (((p1117==0)||(p224==0))||(p1338==1))))
=> equivalent forward existential formula: ([(EY(FwdU(FwdU(Init,TRUE),TRUE)) * !((p342==0)))] = FALSE * [(FwdU(Init,TRUE) * !((((p1117==0)||(p224==0))||(p1...175
(forward)formula 0,0,3.08537,91656,1,0,8,271103,9,2,3099,475196,1
FORMULA CO4-PT-21-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 788/788 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 607 transition count 765
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 607 transition count 765
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 607 transition count 763
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 58 place count 595 transition count 751
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 595 transition count 751
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 595 transition count 750
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 78 place count 588 transition count 743
Iterating global reduction 2 with 7 rules applied. Total rules applied 85 place count 588 transition count 743
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 586 transition count 741
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 586 transition count 741
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 586 transition count 739
Applied a total of 91 rules in 39 ms. Remains 586 /629 variables (removed 43) and now considering 739/788 (removed 49) transitions.
// Phase 1: matrix 739 rows 586 cols
[2024-06-02 19:36:01] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 19:36:01] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 19:36:01] [INFO ] Invariant cache hit.
[2024-06-02 19:36:01] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 738 sub problems to find dead transitions.
[2024-06-02 19:36:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (OVERLAPS) 739/1325 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 590 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 738 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (OVERLAPS) 739/1325 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1325 variables, 738/1328 constraints. Problems are: Problem set: 0 solved, 738 unsolved
[2024-06-02 19:36:48] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1329 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 1/1 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 738 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in LTL mode, iteration 1 : 586/629 places, 739/788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60657 ms. Remains : 586/629 places, 739/788 transitions.
[2024-06-02 19:37:02] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:37:02] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:37:02] [INFO ] Input system was already deterministic with 739 transitions.
[2024-06-02 19:37:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:37:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:37:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality1659495239255699252.gal : 3 ms
[2024-06-02 19:37:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality8092376980276771917.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/CTLCardinality1659495239255699252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8092376980276771917.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,8.81334e+10,3.16453,90156,2,11380,5,272669,6,0,3081,473358,0


Converting to forward existential form...Done !
original formula: AX((AF((p703==1)) + AG(((p927==0)||(p653==1)))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(!(EG(!((p703==1)))))),TRUE) * !(((p927==0)||(p653==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t32, t34, t39, t48, t50, t51, t52, t53, t54, t56, t59, t10...546
Detected timeout of ITS tools.
[2024-06-02 19:37:32] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:37:32] [INFO ] Applying decomposition
[2024-06-02 19:37:32] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7624674393134247154.txt' '-o' '/tmp/graph7624674393134247154.bin' '-w' '/tmp/graph7624674393134247154.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7624674393134247154.bin' '-l' '-1' '-v' '-w' '/tmp/graph7624674393134247154.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:37:32] [INFO ] Decomposing Gal with order
[2024-06-02 19:37:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:37:32] [INFO ] Removed a total of 223 redundant transitions.
[2024-06-02 19:37:32] [INFO ] Flatten gal took : 40 ms
[2024-06-02 19:37:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 19 ms.
[2024-06-02 19:37:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality11039135610603093778.gal : 8 ms
[2024-06-02 19:37:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality2810073080554097858.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/CTLCardinality11039135610603093778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2810073080554097858.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.81334e+10,0.392169,18360,1142,109,26059,2226,1165,59535,94,8255,0


Converting to forward existential form...Done !
original formula: AX((AF((i1.u88.p703==1)) + AG(((i15.u125.p927==0)||(i9.u84.p653==1)))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(!(EG(!((i1.u88.p703==1)))))),TRUE) * !(((i15.u125.p927==0)||(i9.u84.p653==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t59, t103, t187, t273, t285, t305, t344, t378, t390, t399, t500, t534, t546, t557, t577, t653...862
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 788/788 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 607 transition count 765
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 607 transition count 765
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 607 transition count 763
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 58 place count 595 transition count 751
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 595 transition count 751
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 595 transition count 750
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 78 place count 588 transition count 743
Iterating global reduction 2 with 7 rules applied. Total rules applied 85 place count 588 transition count 743
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 586 transition count 741
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 586 transition count 741
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 586 transition count 739
Applied a total of 91 rules in 57 ms. Remains 586 /629 variables (removed 43) and now considering 739/788 (removed 49) transitions.
// Phase 1: matrix 739 rows 586 cols
[2024-06-02 19:38:02] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:38:02] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 19:38:02] [INFO ] Invariant cache hit.
[2024-06-02 19:38:03] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 738 sub problems to find dead transitions.
[2024-06-02 19:38:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (OVERLAPS) 739/1325 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 738 unsolved
[2024-06-02 19:38:32] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 4 ms to minimize.
[2024-06-02 19:38:33] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 592 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 738 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 4 (OVERLAPS) 739/1325 variables, 586/592 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1325 variables, 738/1330 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)timeout

(s82 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1330 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 2/2 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 738 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in LTL mode, iteration 1 : 586/629 places, 739/788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60758 ms. Remains : 586/629 places, 739/788 transitions.
[2024-06-02 19:39:03] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:39:03] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:39:03] [INFO ] Input system was already deterministic with 739 transitions.
[2024-06-02 19:39:03] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:39:03] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:39:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15095465787382105039.gal : 3 ms
[2024-06-02 19:39:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality17614701874856497409.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/CTLCardinality15095465787382105039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17614701874856497409.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,8.81334e+10,2.87132,92564,2,11528,5,276669,6,0,3081,478942,0


Converting to forward existential form...Done !
original formula: A(E(!(AX(FALSE)) U ((p773==0)||(p1208==1))) U (p886!=0))
=> equivalent forward existential formula: [((Init * !(EG(!((p886!=0))))) * !(E(!((p886!=0)) U (!(E(!(!(EX(!(FALSE)))) U ((p773==0)||(p1208==1)))) * !((p88...175
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t32, t34, t39, t48, t50, t51, t52, t53, t54, t56, t59, t10...546
Detected timeout of ITS tools.
[2024-06-02 19:39:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:39:33] [INFO ] Applying decomposition
[2024-06-02 19:39:33] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7106363656311839571.txt' '-o' '/tmp/graph7106363656311839571.bin' '-w' '/tmp/graph7106363656311839571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7106363656311839571.bin' '-l' '-1' '-v' '-w' '/tmp/graph7106363656311839571.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:39:33] [INFO ] Decomposing Gal with order
[2024-06-02 19:39:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:39:33] [INFO ] Removed a total of 241 redundant transitions.
[2024-06-02 19:39:33] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:39:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-06-02 19:39:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality159438003304055475.gal : 4 ms
[2024-06-02 19:39:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality15367974984602208382.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/CTLCardinality159438003304055475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15367974984602208382.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.81334e+10,0.321493,15428,994,105,19639,2051,1270,42822,94,7231,0


Converting to forward existential form...Done !
original formula: A(E(!(AX(FALSE)) U ((i11.u108.p773==0)||(i22.i0.i1.u204.p1208==1))) U (i14.u135.p886!=0))
=> equivalent forward existential formula: [((Init * !(EG(!((i14.u135.p886!=0))))) * !(E(!((i14.u135.p886!=0)) U (!(E(!(!(EX(!(FALSE)))) U ((i11.u108.p773=...226
Reverse transition relation is NOT exact ! Due to transitions t59, t103, t187, t272, t305, t344, t380, t400, t401, t421, t432, t459, t500, t546, t577, t617...887
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 788/788 transitions.
Graph (trivial) has 683 edges and 629 vertex of which 3 / 629 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 981 edges and 627 vertex of which 619 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 287 transitions
Trivial Post-agglo rules discarded 287 transitions
Performed 287 trivial Post agglomeration. Transition count delta: 287
Iterating post reduction 0 with 288 rules applied. Total rules applied 290 place count 618 transition count 487
Reduce places removed 287 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 291 rules applied. Total rules applied 581 place count 331 transition count 483
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 583 place count 329 transition count 483
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 583 place count 329 transition count 424
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 701 place count 270 transition count 424
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 706 place count 265 transition count 419
Iterating global reduction 3 with 5 rules applied. Total rules applied 711 place count 265 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 712 place count 265 transition count 418
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 712 place count 265 transition count 417
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 714 place count 264 transition count 417
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 715 place count 263 transition count 416
Iterating global reduction 4 with 1 rules applied. Total rules applied 716 place count 263 transition count 416
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 786 place count 228 transition count 381
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 7 rules applied. Total rules applied 793 place count 228 transition count 374
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 796 place count 226 transition count 373
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 805 place count 217 transition count 364
Iterating global reduction 6 with 9 rules applied. Total rules applied 814 place count 217 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 816 place count 217 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 817 place count 216 transition count 362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 819 place count 215 transition count 361
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 820 place count 214 transition count 360
Iterating global reduction 8 with 1 rules applied. Total rules applied 821 place count 214 transition count 360
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 822 place count 213 transition count 358
Iterating global reduction 8 with 1 rules applied. Total rules applied 823 place count 213 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 824 place count 213 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 843 place count 213 transition count 338
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 9 with 11 rules applied. Total rules applied 854 place count 213 transition count 327
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 865 place count 202 transition count 327
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 865 place count 202 transition count 326
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 867 place count 201 transition count 326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 869 place count 200 transition count 325
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 871 place count 198 transition count 323
Applied a total of 871 rules in 211 ms. Remains 198 /629 variables (removed 431) and now considering 323/788 (removed 465) transitions.
// Phase 1: matrix 323 rows 198 cols
[2024-06-02 19:40:03] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:40:03] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 19:40:03] [INFO ] Invariant cache hit.
[2024-06-02 19:40:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:40:04] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-06-02 19:40:04] [INFO ] Redundant transitions in 16 ms returned []
Running 310 sub problems to find dead transitions.
[2024-06-02 19:40:04] [INFO ] Invariant cache hit.
[2024-06-02 19:40:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 1/521 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 203 constraints, problems are : Problem set: 0 solved, 310 unsolved in 11116 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 310/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 1/521 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 0/521 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 521/521 variables, and 513 constraints, problems are : Problem set: 0 solved, 310 unsolved in 17026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints]
After SMT, in 28225ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 28229ms
Starting structural reductions in SI_CTL mode, iteration 1 : 198/629 places, 323/788 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28691 ms. Remains : 198/629 places, 323/788 transitions.
[2024-06-02 19:40:32] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:40:32] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:40:32] [INFO ] Input system was already deterministic with 323 transitions.
[2024-06-02 19:40:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:40:32] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:40:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality12656907458337477073.gal : 1 ms
[2024-06-02 19:40:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality7926458223988679370.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/CTLCardinality12656907458337477073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7926458223988679370.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22612e+08,0.204991,10784,2,1289,5,27160,6,0,1101,28209,0


Converting to forward existential form...Done !
original formula: AF(EG((p1091==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((p1091==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t18, t38, t63, t78, t83, t96, t111, t116, t154, t176, t321, Intersection with reachable ...226
(forward)formula 0,0,8.35481,239896,1,0,605,1.05366e+06,671,380,6723,1.59433e+06,947
FORMULA CO4-PT-21-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-02 19:40:40] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:40:40] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:40:40] [INFO ] Applying decomposition
[2024-06-02 19:40:40] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2246149575433890196.txt' '-o' '/tmp/graph2246149575433890196.bin' '-w' '/tmp/graph2246149575433890196.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2246149575433890196.bin' '-l' '-1' '-v' '-w' '/tmp/graph2246149575433890196.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:40:40] [INFO ] Decomposing Gal with order
[2024-06-02 19:40:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:40:40] [INFO ] Removed a total of 232 redundant transitions.
[2024-06-02 19:40:40] [INFO ] Flatten gal took : 27 ms
[2024-06-02 19:40:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2024-06-02 19:40:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality12901658707071132979.gal : 5 ms
[2024-06-02 19:40:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality2126484421337724842.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/CTLCardinality12901658707071132979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2126484421337724842.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29136e+11,0.432616,19244,1093,89,30893,1832,1310,50759,102,6290,0


Converting to forward existential form...Done !
original formula: EX(E((!(EF((i18.u195.p1173==1))) + EX(A((i21.u226.p1305==1) U (i4.i0.i0.u36.p315==1)))) U (((i1.u11.p153==0)||(i1.u200.p1190==0)) + ((i19...203
=> equivalent forward existential formula: ([(FwdU(EY(Init),(!(E(TRUE U (i18.u195.p1173==1))) + EX(!((E(!((i4.i0.i0.u36.p315==1)) U (!((i21.u226.p1305==1))...710
Reverse transition relation is NOT exact ! Due to transitions t38, t71, t117, t326, t332, t373, t421, t454, t467, t495, t537, t692, t693, t787, i0.t647, i1...948
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,1,36.6444,1068248,1,0,1.76088e+06,4674,9528,5.91792e+06,552,24780,1050170
FORMULA CO4-PT-21-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX((AF((i1.u92.p703==1)) + AG(((i16.u140.p927==0)||(i5.i0.i3.u87.p653==1)))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(!(EG(!((i1.u92.p703==1)))))),TRUE) * !(((i16.u140.p927==0)||(i5.i0.i3.u87.p653==1))))] = FA...158
(forward)formula 1,0,64.773,1783364,1,0,2.96321e+06,5861,11100,8.9873e+06,608,30343,1671269
FORMULA CO4-PT-21-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(E(!(AX(FALSE)) U ((i5.i1.i3.u109.p773==0)||(i13.u205.p1208==1))) U (i16.u134.p886!=0))
=> equivalent forward existential formula: [((Init * !(EG(!((i16.u134.p886!=0))))) * !(E(!((i16.u134.p886!=0)) U (!(E(!(!(EX(!(FALSE)))) U ((i5.i1.i3.u109....225
(forward)formula 2,0,105.24,2200220,1,0,3.5596e+06,5956,2877,1.04806e+07,215,30878,297679
FORMULA CO4-PT-21-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 864288 ms.

BK_STOP 1717357346589

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-21"
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 CO4-PT-21, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898700161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-21.tgz
mv CO4-PT-21 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 ;