Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399700537.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399700537
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 146K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716334960051

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:42:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:42:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:42:41] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-21 23:42:41] [INFO ] Transformed 586 places.
[2024-05-21 23:42:41] [INFO ] Transformed 525 transitions.
[2024-05-21 23:42:41] [INFO ] Found NUPN structural information;
[2024-05-21 23:42:41] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 93 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 71 place count 511 transition count 453
Iterating global reduction 1 with 68 rules applied. Total rules applied 139 place count 511 transition count 453
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 167 place count 483 transition count 425
Iterating global reduction 1 with 28 rules applied. Total rules applied 195 place count 483 transition count 425
Applied a total of 195 rules in 106 ms. Remains 483 /582 variables (removed 99) and now considering 425/521 (removed 96) transitions.
// Phase 1: matrix 425 rows 483 cols
[2024-05-21 23:42:41] [INFO ] Computed 95 invariants in 26 ms
[2024-05-21 23:42:42] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-21 23:42:42] [INFO ] Invariant cache hit.
[2024-05-21 23:42:42] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2024-05-21 23:42:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 77 places in 201 ms of which 38 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 117 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 5 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:42:53] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:42:54] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:42:55] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 118 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 4 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 4 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 119 places in 165 ms of which 4 ms to minimize.
Problem TDEAD390 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 20/135 constraints. Problems are: Problem set: 5 solved, 419 unsolved
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 105 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 20/155 constraints. Problems are: Problem set: 5 solved, 419 unsolved
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 121 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 4 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 4 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:43:04] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:43:05] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:43:05] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:43:05] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:43:05] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:43:05] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:43:05] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:43:05] [INFO ] Deduced a trap composed of 101 places in 185 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 20/175 constraints. Problems are: Problem set: 5 solved, 419 unsolved
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 115 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 118 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 20/195 constraints. Problems are: Problem set: 5 solved, 419 unsolved
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 110 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 120 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 123 places in 157 ms of which 6 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 3 ms to minimize.
Problem TDEAD398 is UNSAT
Problem TDEAD403 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 20/215 constraints. Problems are: Problem set: 7 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/908 variables, and 215 constraints, problems are : Problem set: 7 solved, 417 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/483 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 7 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 39/39 constraints. Problems are: Problem set: 7 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/39 constraints. Problems are: Problem set: 7 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 52/91 constraints. Problems are: Problem set: 7 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 4/95 constraints. Problems are: Problem set: 7 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 120/215 constraints. Problems are: Problem set: 7 solved, 417 unsolved
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 109 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 109 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 100 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 20/235 constraints. Problems are: Problem set: 7 solved, 417 unsolved
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 4 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 110 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 101 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 100 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 20/255 constraints. Problems are: Problem set: 7 solved, 417 unsolved
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 5 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 119 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 120 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 120 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 120 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 120 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 129 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:43:23] [INFO ] Deduced a trap composed of 118 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:43:24] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:43:24] [INFO ] Deduced a trap composed of 110 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:43:24] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:43:24] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:43:24] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:43:24] [INFO ] Deduced a trap composed of 124 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:43:24] [INFO ] Deduced a trap composed of 136 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 20/275 constraints. Problems are: Problem set: 7 solved, 417 unsolved
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 103 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 105 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 2 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 20/295 constraints. Problems are: Problem set: 14 solved, 410 unsolved
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 78 places in 170 ms of which 2 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 6 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 4 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 101 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 110 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 86 places in 155 ms of which 4 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 20/315 constraints. Problems are: Problem set: 14 solved, 410 unsolved
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:43:34] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:43:34] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:43:34] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:43:34] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:43:34] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:43:34] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:43:34] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:43:34] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 4 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 20/335 constraints. Problems are: Problem set: 14 solved, 410 unsolved
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 100 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 118 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 114 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 124 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
Problem TDEAD357 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 20/355 constraints. Problems are: Problem set: 15 solved, 409 unsolved
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 118 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 121 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 105 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/908 variables, and 372 constraints, problems are : Problem set: 15 solved, 409 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/483 constraints, PredecessorRefiner: 0/424 constraints, Known Traps: 277/277 constraints]
After SMT, in 60202ms problems are : Problem set: 15 solved, 409 unsolved
Search for dead transitions found 15 dead transitions in 60234ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 483/582 places, 410/521 transitions.
Applied a total of 0 rules in 44 ms. Remains 483 /483 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61301 ms. Remains : 483/582 places, 410/521 transitions.
Support contains 93 out of 483 places after structural reductions.
[2024-05-21 23:43:43] [INFO ] Flatten gal took : 68 ms
[2024-05-21 23:43:43] [INFO ] Flatten gal took : 33 ms
[2024-05-21 23:43:43] [INFO ] Input system was already deterministic with 410 transitions.
Support contains 88 out of 483 places (down from 93) after GAL structural reductions.
RANDOM walk for 40000 steps (291 resets) in 2364 ms. (16 steps per ms) remains 30/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
// Phase 1: matrix 410 rows 483 cols
[2024-05-21 23:43:44] [INFO ] Computed 95 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 311/363 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 113/476 variables, 41/94 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 1/477 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 406/883 variables, 477/572 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 9/892 variables, 5/577 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/892 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 1/893 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/893 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (OVERLAPS) 0/893 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 893/893 variables, and 578 constraints, problems are : Problem set: 0 solved, 30 unsolved in 2892 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp45 is UNSAT
At refinement iteration 1 (OVERLAPS) 311/363 variables, 52/52 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 29 unsolved
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 3 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/73 constraints. Problems are: Problem set: 1 solved, 29 unsolved
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 20/93 constraints. Problems are: Problem set: 1 solved, 29 unsolved
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/893 variables, and 110 constraints, problems are : Problem set: 1 solved, 29 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 1/43 constraints, State Equation: 0/483 constraints, PredecessorRefiner: 0/30 constraints, Known Traps: 57/57 constraints]
After SMT, in 7923ms problems are : Problem set: 1 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 410/410 transitions.
Graph (trivial) has 197 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1037 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 477 transition count 360
Reduce places removed 42 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 435 transition count 357
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 432 transition count 357
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 92 place count 432 transition count 271
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 278 place count 332 transition count 271
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 285 place count 325 transition count 264
Iterating global reduction 3 with 7 rules applied. Total rules applied 292 place count 325 transition count 264
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 502 place count 220 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 504 place count 219 transition count 163
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 506 place count 219 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 508 place count 217 transition count 161
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 511 place count 217 transition count 161
Applied a total of 511 rules in 92 ms. Remains 217 /483 variables (removed 266) and now considering 161/410 (removed 249) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 217/483 places, 161/410 transitions.
RANDOM walk for 40000 steps (766 resets) in 1285 ms. (31 steps per ms) remains 5/29 properties
BEST_FIRST walk for 40004 steps (345 resets) in 236 ms. (168 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (246 resets) in 129 ms. (307 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (313 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (327 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (217 resets) in 58 ms. (677 steps per ms) remains 3/4 properties
// Phase 1: matrix 161 rows 217 cols
[2024-05-21 23:43:52] [INFO ] Computed 81 invariants in 3 ms
[2024-05-21 23:43:52] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 89/149 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/212 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/215 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 161/376 variables, 215/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 11/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/378 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/378 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 309 constraints, problems are : Problem set: 0 solved, 3 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 217/217 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 89/149 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 2 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 9 (OVERLAPS) 63/212 variables, 26/124 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/124 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/215 variables, 3/127 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 161/376 variables, 215/342 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/376 variables, 11/353 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/376 variables, 2/355 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 1/356 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/376 variables, 0/356 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/378 variables, 2/358 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/378 variables, 0/358 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/378 variables, 0/358 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 358 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2526 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 217/217 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 47/47 constraints]
After SMT, in 2705ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 4235 steps, including 71 resets, run visited all 1 properties in 13 ms. (steps per millisecond=325 )
Parikh walk visited 2 properties in 67 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2024-05-21 23:43:55] [INFO ] Flatten gal took : 46 ms
[2024-05-21 23:43:55] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:43:55] [INFO ] Input system was already deterministic with 410 transitions.
Computed a total of 468 stabilizing places and 395 stable transitions
Graph (complete) has 1044 edges and 483 vertex of which 482 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 463 transition count 390
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 463 transition count 390
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 454 transition count 381
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 454 transition count 381
Applied a total of 58 rules in 28 ms. Remains 454 /483 variables (removed 29) and now considering 381/410 (removed 29) transitions.
// Phase 1: matrix 381 rows 454 cols
[2024-05-21 23:43:55] [INFO ] Computed 95 invariants in 8 ms
[2024-05-21 23:43:56] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 23:43:56] [INFO ] Invariant cache hit.
[2024-05-21 23:43:56] [INFO ] Implicit Places using invariants and state equation in 458 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 636 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/483 places, 381/410 transitions.
Applied a total of 0 rules in 7 ms. Remains 453 /453 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 671 ms. Remains : 453/483 places, 381/410 transitions.
[2024-05-21 23:43:56] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:43:56] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:43:56] [INFO ] Input system was already deterministic with 381 transitions.
[2024-05-21 23:43:56] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:43:56] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:43:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality9299157831047450496.gal : 10 ms
[2024-05-21 23:43:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality3493392256207960502.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9299157831047450496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3493392256207960502.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:44:26] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:44:26] [INFO ] Applying decomposition
[2024-05-21 23:44:26] [INFO ] Flatten gal took : 26 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/graph12734278268860592217.txt' '-o' '/tmp/graph12734278268860592217.bin' '-w' '/tmp/graph12734278268860592217.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12734278268860592217.bin' '-l' '-1' '-v' '-w' '/tmp/graph12734278268860592217.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:44:26] [INFO ] Decomposing Gal with order
[2024-05-21 23:44:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:44:27] [INFO ] Removed a total of 189 redundant transitions.
[2024-05-21 23:44:27] [INFO ] Flatten gal took : 76 ms
[2024-05-21 23:44:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 17 ms.
[2024-05-21 23:44:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality16843286100954158442.gal : 12 ms
[2024-05-21 23:44:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality859446333322950817.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/CTLCardinality16843286100954158442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality859446333322950817.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,3.40929e+23,1.361,42028,6699,52,62120,652,1013,148511,64,1527,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,1.36646,42028,1,0,62120,652,1438,148511,73,1527,1406
FORMULA BusinessProcesses-PT-12-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 464 transition count 391
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 464 transition count 391
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 455 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 455 transition count 382
Applied a total of 56 rules in 16 ms. Remains 455 /483 variables (removed 28) and now considering 382/410 (removed 28) transitions.
// Phase 1: matrix 382 rows 455 cols
[2024-05-21 23:44:28] [INFO ] Computed 95 invariants in 10 ms
[2024-05-21 23:44:28] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-21 23:44:28] [INFO ] Invariant cache hit.
[2024-05-21 23:44:29] [INFO ] Implicit Places using invariants and state equation in 490 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 712 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/483 places, 382/410 transitions.
Applied a total of 0 rules in 6 ms. Remains 454 /454 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 735 ms. Remains : 454/483 places, 382/410 transitions.
[2024-05-21 23:44:29] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:44:29] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:44:29] [INFO ] Input system was already deterministic with 382 transitions.
[2024-05-21 23:44:29] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:44:29] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:44:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality1461732142285303255.gal : 3 ms
[2024-05-21 23:44:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality3829240115068035976.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/CTLCardinality1461732142285303255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3829240115068035976.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:44:59] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:44:59] [INFO ] Applying decomposition
[2024-05-21 23:44:59] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13052084562455742395.txt' '-o' '/tmp/graph13052084562455742395.bin' '-w' '/tmp/graph13052084562455742395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13052084562455742395.bin' '-l' '-1' '-v' '-w' '/tmp/graph13052084562455742395.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:44:59] [INFO ] Decomposing Gal with order
[2024-05-21 23:44:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:44:59] [INFO ] Removed a total of 188 redundant transitions.
[2024-05-21 23:44:59] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:44:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:44:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality8077405109050931510.gal : 4 ms
[2024-05-21 23:44:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality14577882066855754401.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/CTLCardinality8077405109050931510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14577882066855754401.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,3.40929e+23,2.11467,73556,4993,43,106442,604,1035,441694,51,1676,0


Converting to forward existential form...Done !
original formula: A(!(EG((i17.u141.p520==1))) U ((i15.u91.p265!=1) * EX(((i17.u124.p426!=1) * AF((i8.i0.u101.p473!=0))))))
=> equivalent forward existential formula: [((Init * !(EG(!(((i15.u91.p265!=1) * EX(((i17.u124.p426!=1) * !(EG(!((i8.i0.u101.p473!=0))))))))))) * !(E(!(((i...363
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t164, t176, t254, t370, t371, t372, t374, t375, i0.i0.u120.t71, i0.i0.u121.t68, i...1188
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Graph (trivial) has 233 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1038 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 476 transition count 345
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 419 transition count 344
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 418 transition count 344
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 118 place count 418 transition count 247
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 330 place count 303 transition count 247
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 347 place count 286 transition count 230
Iterating global reduction 3 with 17 rules applied. Total rules applied 364 place count 286 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 364 place count 286 transition count 228
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 369 place count 283 transition count 228
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 229 rules applied. Total rules applied 598 place count 167 transition count 115
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 3 with 2 rules applied. Total rules applied 600 place count 166 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 601 place count 165 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 602 place count 164 transition count 113
Applied a total of 602 rules in 57 ms. Remains 164 /483 variables (removed 319) and now considering 113/410 (removed 297) transitions.
// Phase 1: matrix 113 rows 164 cols
[2024-05-21 23:45:29] [INFO ] Computed 72 invariants in 1 ms
[2024-05-21 23:45:29] [INFO ] Implicit Places using invariants in 122 ms returned [51, 52, 55]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 124 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 161/483 places, 113/410 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 188 ms. Remains : 161/483 places, 113/410 transitions.
[2024-05-21 23:45:29] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:45:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:45:29] [INFO ] Input system was already deterministic with 113 transitions.
[2024-05-21 23:45:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:45:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:45:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality6530353074911069733.gal : 1 ms
[2024-05-21 23:45:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality9607561353069998835.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/CTLCardinality6530353074911069733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9607561353069998835.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,25258,0.079035,7272,2,2471,5,12989,6,0,756,9623,0


Converting to forward existential form...Done !
original formula: EG((AG(EF((p378==1))) * ((p220==0) + AG((p10==0)))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(E(TRUE U (p378==1))))) * ((p220==0) + !(E(TRUE U !((p10==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t26, t27, t28, t29, t30, t55, t56, t57, t58, t59, t67, t76, t77, t78, t89, t93, t94...268
(forward)formula 0,0,0.86982,38952,1,0,195,129525,234,101,5483,82519,244
FORMULA BusinessProcesses-PT-12-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 469 transition count 396
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 469 transition count 396
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 463 transition count 390
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 463 transition count 390
Applied a total of 40 rules in 17 ms. Remains 463 /483 variables (removed 20) and now considering 390/410 (removed 20) transitions.
// Phase 1: matrix 390 rows 463 cols
[2024-05-21 23:45:30] [INFO ] Computed 95 invariants in 6 ms
[2024-05-21 23:45:30] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-21 23:45:30] [INFO ] Invariant cache hit.
[2024-05-21 23:45:31] [INFO ] Implicit Places using invariants and state equation in 535 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 765 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 462/483 places, 390/410 transitions.
Applied a total of 0 rules in 7 ms. Remains 462 /462 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 790 ms. Remains : 462/483 places, 390/410 transitions.
[2024-05-21 23:45:31] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:45:31] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:45:31] [INFO ] Input system was already deterministic with 390 transitions.
[2024-05-21 23:45:31] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:45:31] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:45:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality6120207941040256914.gal : 5 ms
[2024-05-21 23:45:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality13277798207993900699.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/CTLCardinality6120207941040256914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13277798207993900699.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:46:01] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:46:01] [INFO ] Applying decomposition
[2024-05-21 23:46:01] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9843736304237034296.txt' '-o' '/tmp/graph9843736304237034296.bin' '-w' '/tmp/graph9843736304237034296.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9843736304237034296.bin' '-l' '-1' '-v' '-w' '/tmp/graph9843736304237034296.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:46:01] [INFO ] Decomposing Gal with order
[2024-05-21 23:46:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:46:01] [INFO ] Removed a total of 186 redundant transitions.
[2024-05-21 23:46:01] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:46:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-21 23:46:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality9818057231601358900.gal : 4 ms
[2024-05-21 23:46:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality13008421424931053445.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/CTLCardinality9818057231601358900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13008421424931053445.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,3.63081e+23,0.699527,31240,3706,85,48826,600,1094,101464,73,1925,0


Converting to forward existential form...Done !
original formula: EF((EG(AG(((i15.u159.p571==0)&&(i8.i4.u118.p400==1)))) + (!(E(AX((i10.i0.u59.p176==1)) U A((i13.i1.u31.p98==0) U ((i2.u55.p165==0)||(i10....476
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(E(TRUE U !(((i15.u159.p571==0)&&(i8.i4.u118.p400==1))))))] != FALSE + (([((FwdU(Init,TR...1536
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t6, t7, t9, t37, t66, t162, t174, t262, t270, t379, t380, t383, i0.i0.u120.t73, i0.i0...1246
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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 465 transition count 392
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 465 transition count 392
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 456 transition count 383
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 456 transition count 383
Applied a total of 54 rules in 16 ms. Remains 456 /483 variables (removed 27) and now considering 383/410 (removed 27) transitions.
// Phase 1: matrix 383 rows 456 cols
[2024-05-21 23:46:31] [INFO ] Computed 95 invariants in 6 ms
[2024-05-21 23:46:32] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-21 23:46:32] [INFO ] Invariant cache hit.
[2024-05-21 23:46:32] [INFO ] Implicit Places using invariants and state equation in 592 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 830 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 455/483 places, 383/410 transitions.
Applied a total of 0 rules in 5 ms. Remains 455 /455 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 851 ms. Remains : 455/483 places, 383/410 transitions.
[2024-05-21 23:46:32] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:46:32] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:46:32] [INFO ] Input system was already deterministic with 383 transitions.
[2024-05-21 23:46:32] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:46:32] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:46:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality7163160002378081031.gal : 2 ms
[2024-05-21 23:46:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality9177647065290626267.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/CTLCardinality7163160002378081031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9177647065290626267.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:47:02] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:47:02] [INFO ] Applying decomposition
[2024-05-21 23:47:02] [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/graph9812467776384336933.txt' '-o' '/tmp/graph9812467776384336933.bin' '-w' '/tmp/graph9812467776384336933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9812467776384336933.bin' '-l' '-1' '-v' '-w' '/tmp/graph9812467776384336933.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:47:02] [INFO ] Decomposing Gal with order
[2024-05-21 23:47:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:47:02] [INFO ] Removed a total of 187 redundant transitions.
[2024-05-21 23:47:02] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:47:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2024-05-21 23:47:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality12591351499311470996.gal : 7 ms
[2024-05-21 23:47:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality18274365045829910627.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/CTLCardinality12591351499311470996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18274365045829910627.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.52907e+23,0.792759,28400,3753,69,46518,1282,1013,101541,68,2944,0


Converting to forward existential form...Done !
original formula: (AF(((i18.i0.u149.p551==0)||(i12.u56.p170==1))) * E(AG((AG((i0.i1.u77.p228==1)) + AX(((i18.i0.u100.p301==1)&&(i18.i0.u23.p76==0))))) U EX...208
=> equivalent forward existential formula: ([FwdG(Init,!(((i18.i0.u149.p551==0)||(i12.u56.p170==1))))] = FALSE * [(Init * !(E(!(E(TRUE U !((!(E(TRUE U !((i...323
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t155, t167, t255, t263, t372, t373, t375, t376, i0.i0.u80.t150, i0.i0.u122.t64, i...1202
(forward)formula 0,0,10.7768,377408,1,0,668291,1817,6492,1.37894e+06,313,5008,1384813
FORMULA BusinessProcesses-PT-12-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Graph (trivial) has 233 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1038 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 476 transition count 344
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 418 transition count 344
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 118 place count 418 transition count 248
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 328 place count 304 transition count 248
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 346 place count 286 transition count 230
Iterating global reduction 2 with 18 rules applied. Total rules applied 364 place count 286 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 364 place count 286 transition count 228
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 369 place count 283 transition count 228
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 231 rules applied. Total rules applied 600 place count 166 transition count 114
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 2 with 2 rules applied. Total rules applied 602 place count 165 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 603 place count 164 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 604 place count 163 transition count 112
Applied a total of 604 rules in 81 ms. Remains 163 /483 variables (removed 320) and now considering 112/410 (removed 298) transitions.
// Phase 1: matrix 112 rows 163 cols
[2024-05-21 23:47:13] [INFO ] Computed 72 invariants in 1 ms
[2024-05-21 23:47:13] [INFO ] Implicit Places using invariants in 138 ms returned [0, 1, 5, 6, 29, 30, 31, 32, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 139 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 145/483 places, 112/410 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 226 ms. Remains : 145/483 places, 112/410 transitions.
[2024-05-21 23:47:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:47:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:47:14] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-21 23:47:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:47:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:47:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality5438106695729632551.gal : 1 ms
[2024-05-21 23:47:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality15263303354161882392.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/CTLCardinality5438106695729632551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15263303354161882392.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,47124,0.090001,6384,2,1764,5,10475,6,0,692,7926,0


Converting to forward existential form...Done !
original formula: A(EF((p409!=1)) U AG((p147!=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((p147!=1)))))))) * !(E(!(!(E(TRUE U !((p147!=1))))) U (!(E(TRUE U (p409!=1))) * !(...195
Reverse transition relation is NOT exact ! Due to transitions t26, t27, t28, t29, t30, t55, t56, t57, t58, t59, t75, t76, t77, t87, t91, t92, t93, t111, I...253
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.47231,46512,1,0,322,216030,233,213,5051,232734,395
FORMULA BusinessProcesses-PT-12-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 464 transition count 391
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 464 transition count 391
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 455 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 455 transition count 382
Applied a total of 56 rules in 35 ms. Remains 455 /483 variables (removed 28) and now considering 382/410 (removed 28) transitions.
// Phase 1: matrix 382 rows 455 cols
[2024-05-21 23:47:15] [INFO ] Computed 95 invariants in 3 ms
[2024-05-21 23:47:15] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 23:47:15] [INFO ] Invariant cache hit.
[2024-05-21 23:47:16] [INFO ] Implicit Places using invariants and state equation in 416 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 592 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/483 places, 382/410 transitions.
Applied a total of 0 rules in 10 ms. Remains 454 /454 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 637 ms. Remains : 454/483 places, 382/410 transitions.
[2024-05-21 23:47:16] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:47:16] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:47:16] [INFO ] Input system was already deterministic with 382 transitions.
[2024-05-21 23:47:16] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:47:16] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:47:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality3746371880807602825.gal : 2 ms
[2024-05-21 23:47:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality4309736730449120374.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/CTLCardinality3746371880807602825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4309736730449120374.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:47:46] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:47:46] [INFO ] Applying decomposition
[2024-05-21 23:47:46] [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/graph9584703583638606904.txt' '-o' '/tmp/graph9584703583638606904.bin' '-w' '/tmp/graph9584703583638606904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9584703583638606904.bin' '-l' '-1' '-v' '-w' '/tmp/graph9584703583638606904.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:47:46] [INFO ] Decomposing Gal with order
[2024-05-21 23:47:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:47:46] [INFO ] Removed a total of 187 redundant transitions.
[2024-05-21 23:47:46] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:47:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2024-05-21 23:47:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality15190001858259822957.gal : 7 ms
[2024-05-21 23:47:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality4644732214267296697.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/CTLCardinality15190001858259822957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4644732214267296697.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,3.45912e+23,1.33279,37444,4557,52,62677,481,1041,118770,61,1200,0


Converting to forward existential form...Done !
original formula: AG((AG((AX((i15.i3.u29.p102==0)) * AF((i3.i1.u89.p266==0)))) + AF(AG((i15.i0.u22.p74==0)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!(E(TRUE U !((!(EX(!((i15.i3.u29.p102==0)))) * !(EG(!((i3.i1.u89.p266==0)))))))))),!(...201
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t155, t163, t167, t175, t254, t371, t372, t374, t375, i0.i0.u79.t150, i0.i0.u120....1181
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 an SCC at level 7
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,16.8117,448228,1,0,916100,481,7180,1.51278e+06,284,1456,2024533
FORMULA BusinessProcesses-PT-12-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 465 transition count 392
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 465 transition count 392
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 457 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 457 transition count 384
Applied a total of 52 rules in 37 ms. Remains 457 /483 variables (removed 26) and now considering 384/410 (removed 26) transitions.
// Phase 1: matrix 384 rows 457 cols
[2024-05-21 23:48:03] [INFO ] Computed 95 invariants in 2 ms
[2024-05-21 23:48:03] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 23:48:03] [INFO ] Invariant cache hit.
[2024-05-21 23:48:04] [INFO ] Implicit Places using invariants and state equation in 453 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 668 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/483 places, 384/410 transitions.
Applied a total of 0 rules in 5 ms. Remains 456 /456 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 710 ms. Remains : 456/483 places, 384/410 transitions.
[2024-05-21 23:48:04] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:48:04] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:48:04] [INFO ] Input system was already deterministic with 384 transitions.
[2024-05-21 23:48:04] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:48:04] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:48:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality5908318317922122669.gal : 2 ms
[2024-05-21 23:48:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality7644066756319004643.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/CTLCardinality5908318317922122669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7644066756319004643.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:48:34] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:48:34] [INFO ] Applying decomposition
[2024-05-21 23:48:34] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10745714473793742077.txt' '-o' '/tmp/graph10745714473793742077.bin' '-w' '/tmp/graph10745714473793742077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10745714473793742077.bin' '-l' '-1' '-v' '-w' '/tmp/graph10745714473793742077.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:48:34] [INFO ] Decomposing Gal with order
[2024-05-21 23:48:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:48:34] [INFO ] Removed a total of 187 redundant transitions.
[2024-05-21 23:48:34] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:48:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-21 23:48:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality558706025318030418.gal : 4 ms
[2024-05-21 23:48:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality4768853087051748487.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/CTLCardinality558706025318030418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4768853087051748487.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.78427e+23,0.619751,27876,3245,46,47064,542,1019,99410,53,1397,0


Converting to forward existential form...Done !
original formula: E((A(A(((!((i1.u65.p194==0)||(i13.i1.u108.p344==1)))&&(i7.i0.u152.p557==1)) U (i14.i0.u39.p120==1)) U (i5.u17.p49==1)) * ((AG(EF(((i13.i1...342
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!((E(!((i5.u17.p49==1)) U (!(!((E(!((i14.i0.u39.p120==1)) U (!(((!((i1.u65.p194==0)||(i13.i1.u...535
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t156, t160, t168, t176, t254, t372, t374, t376, t377, i0.t164, i0.u69.t171, i0.u7...1194
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 464 transition count 391
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 464 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 456 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 456 transition count 383
Applied a total of 54 rules in 15 ms. Remains 456 /483 variables (removed 27) and now considering 383/410 (removed 27) transitions.
// Phase 1: matrix 383 rows 456 cols
[2024-05-21 23:49:04] [INFO ] Computed 95 invariants in 6 ms
[2024-05-21 23:49:04] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 23:49:04] [INFO ] Invariant cache hit.
[2024-05-21 23:49:05] [INFO ] Implicit Places using invariants and state equation in 468 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 673 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 455/483 places, 383/410 transitions.
Applied a total of 0 rules in 5 ms. Remains 455 /455 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 693 ms. Remains : 455/483 places, 383/410 transitions.
[2024-05-21 23:49:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:49:05] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:49:05] [INFO ] Input system was already deterministic with 383 transitions.
[2024-05-21 23:49:05] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:49:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:49:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality12331944686972746239.gal : 1 ms
[2024-05-21 23:49:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality14923399555789782801.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/CTLCardinality12331944686972746239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14923399555789782801.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:49:35] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:49:35] [INFO ] Applying decomposition
[2024-05-21 23:49:35] [INFO ] Flatten gal took : 19 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/graph10589997247042097386.txt' '-o' '/tmp/graph10589997247042097386.bin' '-w' '/tmp/graph10589997247042097386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10589997247042097386.bin' '-l' '-1' '-v' '-w' '/tmp/graph10589997247042097386.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:49:35] [INFO ] Decomposing Gal with order
[2024-05-21 23:49:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:49:35] [INFO ] Removed a total of 188 redundant transitions.
[2024-05-21 23:49:35] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:49:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 11 ms.
[2024-05-21 23:49:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality5198228871873328253.gal : 5 ms
[2024-05-21 23:49:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality874044379979245614.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/CTLCardinality5198228871873328253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality874044379979245614.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40969e+23,0.800311,31120,4081,47,49847,536,1038,145597,52,1339,0


Converting to forward existential form...Done !
original formula: E(AX(((i11.i1.u107.p343==0)||(i5.i0.u152.p460==1))) U EX(!((E((i11.i0.u39.p123==1) U (i14.u135.p490!=1)) + (i5.i0.u36.p116!=1)))))
=> equivalent forward existential formula: [((EY(FwdU(Init,!(EX(!(((i11.i1.u107.p343==0)||(i5.i0.u152.p460==1))))))) * !((i5.i0.u36.p116!=1))) * !(E((i11.i...203
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t157, t169, t177, t263, t372, t373, t375, t376, i0.u64.t180, i0.u66.t176, i1.u50....1197
(forward)formula 0,0,3.8684,145168,1,0,250011,536,6520,713398,238,1339,763648
FORMULA BusinessProcesses-PT-12-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 466 transition count 393
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 466 transition count 393
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 458 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 458 transition count 385
Applied a total of 50 rules in 31 ms. Remains 458 /483 variables (removed 25) and now considering 385/410 (removed 25) transitions.
// Phase 1: matrix 385 rows 458 cols
[2024-05-21 23:49:39] [INFO ] Computed 95 invariants in 6 ms
[2024-05-21 23:49:39] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 23:49:39] [INFO ] Invariant cache hit.
[2024-05-21 23:49:40] [INFO ] Implicit Places using invariants and state equation in 562 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 737 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 457/483 places, 385/410 transitions.
Applied a total of 0 rules in 6 ms. Remains 457 /457 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 775 ms. Remains : 457/483 places, 385/410 transitions.
[2024-05-21 23:49:40] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:49:40] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:49:40] [INFO ] Input system was already deterministic with 385 transitions.
[2024-05-21 23:49:40] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:49:40] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:49:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality9782539738101829783.gal : 2 ms
[2024-05-21 23:49:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality3917480679501133038.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/CTLCardinality9782539738101829783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3917480679501133038.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:50:10] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:50:10] [INFO ] Applying decomposition
[2024-05-21 23:50:10] [INFO ] Flatten gal took : 21 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/graph12582560869274376676.txt' '-o' '/tmp/graph12582560869274376676.bin' '-w' '/tmp/graph12582560869274376676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12582560869274376676.bin' '-l' '-1' '-v' '-w' '/tmp/graph12582560869274376676.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:50:10] [INFO ] Decomposing Gal with order
[2024-05-21 23:50:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:50:10] [INFO ] Removed a total of 187 redundant transitions.
[2024-05-21 23:50:10] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:50:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-21 23:50:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality10323193068597212608.gal : 5 ms
[2024-05-21 23:50:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality12562945493633482315.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/CTLCardinality10323193068597212608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12562945493633482315.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.41028e+23,0.582395,27416,3394,54,47559,703,1028,94540,59,1588,0


Converting to forward existential form...Done !
original formula: !(E(AF(((EG(AX(((i8.i0.u63.p180==0)||(i4.i1.u12.p27==1)))) + (i15.u158.p568==0)) + (i9.i1.u119.p399==1))) U !(EF(((EX((i14.i0.u69.p199==1...233
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(((EG(!(EX(!(((i8.i0.u63.p180==0)||(i4.i1.u12.p27==1)))))) + (i15.u158.p568==0)) + (i9.i1.u119...293
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t157, t169, t177, t256, t373, t374, t375, t377, i0.i0.u82.t152, i0.i0.u122.t69, i...1253
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 463 transition count 390
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 463 transition count 390
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 454 transition count 381
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 454 transition count 381
Applied a total of 58 rules in 29 ms. Remains 454 /483 variables (removed 29) and now considering 381/410 (removed 29) transitions.
// Phase 1: matrix 381 rows 454 cols
[2024-05-21 23:50:40] [INFO ] Computed 95 invariants in 7 ms
[2024-05-21 23:50:40] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-21 23:50:40] [INFO ] Invariant cache hit.
[2024-05-21 23:50:41] [INFO ] Implicit Places using invariants and state equation in 506 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 717 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/483 places, 381/410 transitions.
Applied a total of 0 rules in 4 ms. Remains 453 /453 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 751 ms. Remains : 453/483 places, 381/410 transitions.
[2024-05-21 23:50:41] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:50:41] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:50:41] [INFO ] Input system was already deterministic with 381 transitions.
[2024-05-21 23:50:41] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:50:41] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:50:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality17354119930807803275.gal : 6 ms
[2024-05-21 23:50:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality11853675693161586056.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/CTLCardinality17354119930807803275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11853675693161586056.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:51:11] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:51:11] [INFO ] Applying decomposition
[2024-05-21 23:51:11] [INFO ] Flatten gal took : 19 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/graph1570456785931485234.txt' '-o' '/tmp/graph1570456785931485234.bin' '-w' '/tmp/graph1570456785931485234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1570456785931485234.bin' '-l' '-1' '-v' '-w' '/tmp/graph1570456785931485234.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:51:11] [INFO ] Decomposing Gal with order
[2024-05-21 23:51:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:51:11] [INFO ] Removed a total of 189 redundant transitions.
[2024-05-21 23:51:11] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:51:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-21 23:51:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality407229474716102519.gal : 6 ms
[2024-05-21 23:51:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality13150304492642717579.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/CTLCardinality407229474716102519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13150304492642717579.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,3.40929e+23,0.60617,22348,3020,51,36595,573,997,81137,57,1279,0


Converting to forward existential form...Done !
original formula: A((i16.i0.u130.p474==1) U AX(EF(!((((i18.i1.u60.p178==0)||(i8.i1.u51.p145==1))||(i16.i2.u149.p458==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(E(TRUE U !((((i18.i1.u60.p178==0)||(i8.i1.u51.p145==1))||(i16.i2.u149.p458==1)))))))))))...395
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t155, t167, t261, t369, t370, t371, t373, t374, i0.i0.u80.t150, i0.i1.u117.t76, i...1172
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 463 transition count 390
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 463 transition count 390
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 454 transition count 381
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 454 transition count 381
Applied a total of 58 rules in 41 ms. Remains 454 /483 variables (removed 29) and now considering 381/410 (removed 29) transitions.
[2024-05-21 23:51:41] [INFO ] Invariant cache hit.
[2024-05-21 23:51:41] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 23:51:41] [INFO ] Invariant cache hit.
[2024-05-21 23:51:42] [INFO ] Implicit Places using invariants and state equation in 436 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 605 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/483 places, 381/410 transitions.
Applied a total of 0 rules in 7 ms. Remains 453 /453 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 653 ms. Remains : 453/483 places, 381/410 transitions.
[2024-05-21 23:51:42] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:51:42] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:51:42] [INFO ] Input system was already deterministic with 381 transitions.
[2024-05-21 23:51:42] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:51:42] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:51:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality4880469136623823032.gal : 2 ms
[2024-05-21 23:51:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality12629587147851859040.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/CTLCardinality4880469136623823032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12629587147851859040.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:52:12] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:52:12] [INFO ] Applying decomposition
[2024-05-21 23:52:12] [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/graph9115761569369470279.txt' '-o' '/tmp/graph9115761569369470279.bin' '-w' '/tmp/graph9115761569369470279.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9115761569369470279.bin' '-l' '-1' '-v' '-w' '/tmp/graph9115761569369470279.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:52:12] [INFO ] Decomposing Gal with order
[2024-05-21 23:52:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:52:12] [INFO ] Removed a total of 189 redundant transitions.
[2024-05-21 23:52:12] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:52:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-21 23:52:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality76743893208110736.gal : 4 ms
[2024-05-21 23:52:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality8579830923185963374.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/CTLCardinality76743893208110736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8579830923185963374.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 -...260
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,3.40929e+23,1.12757,34972,4433,50,52395,533,992,149129,56,1097,0


Converting to forward existential form...Done !
original formula: AG(!(A(AX(EX(((i9.i1.u118.p396==0)||(i12.i0.u134.p488==1)))) U EF((i0.u71.p210==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(E(TRUE U (i0.u71.p210==1)))))) * !(E(!(E(TRUE U (i0.u71.p210==1))) U (!(!(EX(!(EX(((...248
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t159, t163, t253, t370, t371, t373, t374, i0.t167, i0.u68.t174, i0.u70.t170, i1.t...1165
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 464 transition count 391
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 464 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 456 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 456 transition count 383
Applied a total of 54 rules in 37 ms. Remains 456 /483 variables (removed 27) and now considering 383/410 (removed 27) transitions.
// Phase 1: matrix 383 rows 456 cols
[2024-05-21 23:52:42] [INFO ] Computed 95 invariants in 5 ms
[2024-05-21 23:52:42] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-21 23:52:42] [INFO ] Invariant cache hit.
[2024-05-21 23:52:43] [INFO ] Implicit Places using invariants and state equation in 610 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 841 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 455/483 places, 383/410 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 885 ms. Remains : 455/483 places, 383/410 transitions.
[2024-05-21 23:52:43] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:52:43] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:52:43] [INFO ] Input system was already deterministic with 383 transitions.
[2024-05-21 23:52:43] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:52:43] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:52:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality16864608642236561980.gal : 2 ms
[2024-05-21 23:52:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality11254858724251618523.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/CTLCardinality16864608642236561980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11254858724251618523.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:53:13] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:53:13] [INFO ] Applying decomposition
[2024-05-21 23:53:13] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3577233981309600379.txt' '-o' '/tmp/graph3577233981309600379.bin' '-w' '/tmp/graph3577233981309600379.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3577233981309600379.bin' '-l' '-1' '-v' '-w' '/tmp/graph3577233981309600379.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:53:13] [INFO ] Decomposing Gal with order
[2024-05-21 23:53:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:53:13] [INFO ] Removed a total of 189 redundant transitions.
[2024-05-21 23:53:13] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:53:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-21 23:53:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality17854938930433656121.gal : 6 ms
[2024-05-21 23:53:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality10018569580190737356.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/CTLCardinality17854938930433656121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10018569580190737356.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48666e+23,1.10156,34752,4357,43,55689,570,1001,139333,52,1275,0


Converting to forward existential form...Done !
original formula: AX(EF(((i5.i1.u148.p549==0)&&(i10.u73.p219==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((i5.i1.u148.p549==0)&&(i10.u73.p219==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t159, t165, t169, t177, t255, t371, t372, t373, t375, t376, i0.t155, i0.i0.u76.t1...1172
(forward)formula 0,1,6.96112,221400,1,0,404847,570,6690,851440,241,1275,1059850
FORMULA BusinessProcesses-PT-12-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 410/410 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 466 transition count 393
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 466 transition count 393
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 459 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 459 transition count 386
Applied a total of 48 rules in 43 ms. Remains 459 /483 variables (removed 24) and now considering 386/410 (removed 24) transitions.
// Phase 1: matrix 386 rows 459 cols
[2024-05-21 23:53:20] [INFO ] Computed 95 invariants in 2 ms
[2024-05-21 23:53:20] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-21 23:53:20] [INFO ] Invariant cache hit.
[2024-05-21 23:53:21] [INFO ] Implicit Places using invariants and state equation in 493 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 725 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 458/483 places, 386/410 transitions.
Applied a total of 0 rules in 5 ms. Remains 458 /458 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 773 ms. Remains : 458/483 places, 386/410 transitions.
[2024-05-21 23:53:21] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:53:21] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:53:21] [INFO ] Input system was already deterministic with 386 transitions.
[2024-05-21 23:53:21] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:53:21] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:53:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality1723780126508435820.gal : 1 ms
[2024-05-21 23:53:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality3698816453624143092.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/CTLCardinality1723780126508435820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3698816453624143092.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:53:51] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:53:51] [INFO ] Applying decomposition
[2024-05-21 23:53:51] [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/graph14540060265417705465.txt' '-o' '/tmp/graph14540060265417705465.bin' '-w' '/tmp/graph14540060265417705465.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14540060265417705465.bin' '-l' '-1' '-v' '-w' '/tmp/graph14540060265417705465.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:53:51] [INFO ] Decomposing Gal with order
[2024-05-21 23:53:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:53:51] [INFO ] Removed a total of 184 redundant transitions.
[2024-05-21 23:53:51] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:53:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2024-05-21 23:53:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality2287722273651574224.gal : 5 ms
[2024-05-21 23:53:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality10388415673333723848.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/CTLCardinality2287722273651574224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10388415673333723848.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,3.4093e+23,2.34676,54320,5912,51,77002,657,1042,155659,62,1580,0


Converting to forward existential form...Done !
original formula: AG(EX(((!(A(((i3.i1.u124.p432==0)||(i14.i2.u106.p345==1)) U (i14.i2.u107.p342==1))) + (i5.i2.u88.p262==1)) + (((i5.i2.u103.p326==0)&&(i4....213
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((!(!((E(!((i14.i2.u107.p342==1)) U (!(((i3.i1.u124.p432==0)||(i14.i2.u106.p345==1))) *...338
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t160, t172, t180, t258, t374, t376, t378, i0.i0.u75.t163, i0.i0.u120.t71, i0.i0.u...1204
Detected timeout of ITS tools.
[2024-05-21 23:54:21] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:54:21] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:54:21] [INFO ] Applying decomposition
[2024-05-21 23:54:21] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2767755897740188469.txt' '-o' '/tmp/graph2767755897740188469.bin' '-w' '/tmp/graph2767755897740188469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2767755897740188469.bin' '-l' '-1' '-v' '-w' '/tmp/graph2767755897740188469.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:54:21] [INFO ] Decomposing Gal with order
[2024-05-21 23:54:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:54:21] [INFO ] Removed a total of 183 redundant transitions.
[2024-05-21 23:54:21] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:54:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:54:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality3889128394516484471.gal : 6 ms
[2024-05-21 23:54:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality4561939280348090611.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/CTLCardinality3889128394516484471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4561939280348090611.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.23159e+23,1.40625,46704,4124,115,76541,2768,1113,189349,77,12143,0


Converting to forward existential form...Done !
original formula: A(!(EG((i16.u134.p520==1))) U ((i12.i1.u95.p265!=1) * EX(((i16.u130.p426!=1) * AF((i17.i0.u105.p473!=0))))))
=> equivalent forward existential formula: [((Init * !(EG(!(((i12.i1.u95.p265!=1) * EX(((i16.u130.p426!=1) * !(EG(!((i17.i0.u105.p473!=0))))))))))) * !(E(!...375
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t10, t44, t174, t178, t196, t270, t279, t289, t400, i0.i0.u127.t84, i0.i0.u128.t8...1425
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
[2024-05-22 00:18:14] [INFO ] Applying decomposition
[2024-05-22 00:18:15] [INFO ] Flatten gal took : 31 ms
[2024-05-22 00:18:15] [INFO ] Decomposing Gal with order
[2024-05-22 00:18:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:18:15] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-22 00:18:15] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:18:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-22 00:18:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality4247397518486898038.gal : 7 ms
[2024-05-22 00:18:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality17054506321317222466.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4247397518486898038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17054506321317222466.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 7 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:24:44] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:24:45] [INFO ] Input system was already deterministic with 410 transitions.
[2024-05-22 00:24:45] [INFO ] Transformed 483 places.
[2024-05-22 00:24:45] [INFO ] Transformed 410 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:25:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality2476503113167065294.gal : 2 ms
[2024-05-22 00:25:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality7801158774600406888.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/CTLCardinality2476503113167065294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7801158774600406888.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3210859 ms.

BK_STOP 1716338172209

--------------------
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="BusinessProcesses-PT-12"
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 BusinessProcesses-PT-12, 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 r048-tajo-171620399700537"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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