About the Execution of ITS-Tools for FireWire-PT-19
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16207.128 | 3600000.00 | 3821070.00 | 11737.10 | ??T??????T???F?? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r550-tall-171734899100313.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FireWire-PT-19, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899100313
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 221K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717370648219
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 23:24:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:24:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:24:09] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-06-02 23:24:09] [INFO ] Transformed 602 places.
[2024-06-02 23:24:09] [INFO ] Transformed 944 transitions.
[2024-06-02 23:24:09] [INFO ] Found NUPN structural information;
[2024-06-02 23:24:09] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 124 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 944/944 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 597 transition count 944
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 94 place count 508 transition count 855
Iterating global reduction 1 with 89 rules applied. Total rules applied 183 place count 508 transition count 855
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 197 place count 494 transition count 836
Iterating global reduction 1 with 14 rules applied. Total rules applied 211 place count 494 transition count 836
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 213 place count 494 transition count 834
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 215 place count 492 transition count 832
Iterating global reduction 2 with 2 rules applied. Total rules applied 217 place count 492 transition count 832
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 218 place count 491 transition count 831
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 491 transition count 831
Applied a total of 219 rules in 124 ms. Remains 491 /602 variables (removed 111) and now considering 831/944 (removed 113) transitions.
// Phase 1: matrix 831 rows 491 cols
[2024-06-02 23:24:09] [INFO ] Computed 10 invariants in 24 ms
[2024-06-02 23:24:10] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-06-02 23:24:10] [INFO ] Invariant cache hit.
[2024-06-02 23:24:11] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2024-06-02 23:24:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-06-02 23:24:24] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 15 ms to minimize.
[2024-06-02 23:24:24] [INFO ] Deduced a trap composed of 97 places in 67 ms of which 2 ms to minimize.
[2024-06-02 23:24:25] [INFO ] Deduced a trap composed of 96 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:24:25] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 4 ms to minimize.
[2024-06-02 23:24:25] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:24:26] [INFO ] Deduced a trap composed of 108 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:24:26] [INFO ] Deduced a trap composed of 104 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:24:27] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 2 ms to minimize.
[2024-06-02 23:24:27] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:24:28] [INFO ] Deduced a trap composed of 97 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:24:28] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:24:28] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 2 ms to minimize.
[2024-06-02 23:24:29] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:24:29] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 2 ms to minimize.
[2024-06-02 23:24:29] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-06-02 23:24:29] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:24:30] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 2 ms to minimize.
[2024-06-02 23:24:33] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:24:35] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-06-02 23:24:36] [INFO ] Deduced a trap composed of 101 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:24:38] [INFO ] Deduced a trap composed of 108 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:24:39] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:24:40] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:24:40] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:24:40] [INFO ] Deduced a trap composed of 186 places in 159 ms of which 2 ms to minimize.
[2024-06-02 23:24:41] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 3 ms to minimize.
[2024-06-02 23:24:41] [INFO ] Deduced a trap composed of 150 places in 157 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/1322 variables, and 37 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/491 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-06-02 23:24:49] [INFO ] Deduced a trap composed of 93 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:24:51] [INFO ] Deduced a trap composed of 97 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-06-02 23:25:00] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:25:01] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:25:02] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/1322 variables, and 42 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/491 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 32/32 constraints]
After SMT, in 60647ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60737ms
Starting structural reductions in LTL mode, iteration 1 : 491/602 places, 831/944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62016 ms. Remains : 491/602 places, 831/944 transitions.
Support contains 124 out of 491 places after structural reductions.
[2024-06-02 23:25:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 23:25:12] [INFO ] Flatten gal took : 85 ms
[2024-06-02 23:25:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-19-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 23:25:12] [INFO ] Flatten gal took : 45 ms
[2024-06-02 23:25:12] [INFO ] Input system was already deterministic with 831 transitions.
Support contains 94 out of 491 places (down from 124) after GAL structural reductions.
RANDOM walk for 40000 steps (25 resets) in 2128 ms. (18 steps per ms) remains 37/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
[2024-06-02 23:25:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 357/417 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 11/428 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 778/1206 variables, 428/438 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 0/438 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 51/1257 variables, 26/464 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1257 variables, 0/464 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 38/1295 variables, 21/485 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1295 variables, 0/485 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 17/1312 variables, 10/495 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1312 variables, 0/495 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 9/1321 variables, 5/500 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1321 variables, 0/500 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 1/1322 variables, 1/501 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1322 variables, 0/501 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 17 (OVERLAPS) 0/1322 variables, 0/501 constraints. Problems are: Problem set: 2 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1322/1322 variables, and 501 constraints, problems are : Problem set: 2 solved, 35 unsolved in 4679 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 353/405 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-02 23:25:18] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:25:18] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:25:18] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 3/11 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 23/428 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-02 23:25:19] [INFO ] Deduced a trap composed of 98 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:25:19] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-06-02 23:25:19] [INFO ] Deduced a trap composed of 98 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 3/16 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-02 23:25:19] [INFO ] Deduced a trap composed of 98 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 1/17 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 778/1206 variables, 428/445 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1206 variables, 31/476 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-02 23:25:21] [INFO ] Deduced a trap composed of 154 places in 165 ms of which 3 ms to minimize.
[2024-06-02 23:25:21] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 3 ms to minimize.
[2024-06-02 23:25:22] [INFO ] Deduced a trap composed of 98 places in 174 ms of which 8 ms to minimize.
[2024-06-02 23:25:22] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1322 variables, and 480 constraints, problems are : Problem set: 2 solved, 35 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 428/491 constraints, PredecessorRefiner: 31/37 constraints, Known Traps: 11/11 constraints]
After SMT, in 9712ms problems are : Problem set: 2 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 316 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 4 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 1406 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 472 transition count 732
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 395 transition count 730
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 9 rules applied. Total rules applied 168 place count 394 transition count 722
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 178 place count 386 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 179 place count 385 transition count 720
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 179 place count 385 transition count 691
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 237 place count 356 transition count 691
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 247 place count 346 transition count 681
Iterating global reduction 5 with 10 rules applied. Total rules applied 257 place count 346 transition count 681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 346 transition count 680
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 258 place count 346 transition count 678
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 262 place count 344 transition count 678
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 265 place count 341 transition count 675
Iterating global reduction 6 with 3 rules applied. Total rules applied 268 place count 341 transition count 675
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 270 place count 341 transition count 673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 271 place count 340 transition count 673
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 369 place count 291 transition count 624
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 370 place count 290 transition count 594
Iterating global reduction 8 with 1 rules applied. Total rules applied 371 place count 290 transition count 594
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 58 rules applied. Total rules applied 429 place count 261 transition count 702
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 433 place count 261 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 455 place count 261 transition count 676
Free-agglomeration rule applied 34 times.
Iterating global reduction 9 with 34 rules applied. Total rules applied 489 place count 261 transition count 642
Reduce places removed 34 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 38 rules applied. Total rules applied 527 place count 227 transition count 638
Drop transitions (Redundant composition of simpler transitions.) removed 114 transitions
Redundant transition composition rules discarded 114 transitions
Iterating global reduction 10 with 114 rules applied. Total rules applied 641 place count 227 transition count 524
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 646 place count 227 transition count 524
Applied a total of 646 rules in 207 ms. Remains 227 /491 variables (removed 264) and now considering 524/831 (removed 307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 227/491 places, 524/831 transitions.
RANDOM walk for 40000 steps (968 resets) in 676 ms. (59 steps per ms) remains 16/35 properties
BEST_FIRST walk for 4004 steps (19 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (17 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (17 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (17 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
[2024-06-02 23:25:23] [INFO ] Flow matrix only has 512 transitions (discarded 12 similar events)
// Phase 1: matrix 512 rows 227 cols
[2024-06-02 23:25:23] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:25:23] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 177/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/216 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 509/725 variables, 216/226 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 83/309 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 11/736 variables, 9/318 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 2/738 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/738 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/738 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 1/739 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/739 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/739 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 739/739 variables, and 322 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1061 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 177/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 23:25:24] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-06-02 23:25:24] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:25:24] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:25:24] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:25:25] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 23:25:25] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 14/216 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 23:25:25] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 509/725 variables, 216/233 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 83/316 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 12/328 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 23:25:25] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 23:25:26] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/725 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/725 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 14 (OVERLAPS) 11/736 variables, 9/339 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/736 variables, 2/341 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/736 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 2/738 variables, 1/342 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/738 variables, 2/344 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/738 variables, 0/344 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 1/739 variables, 1/345 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/739 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 0/739 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 739/739 variables, and 345 constraints, problems are : Problem set: 1 solved, 14 unsolved in 3435 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 9/9 constraints]
After SMT, in 4518ms problems are : Problem set: 1 solved, 14 unsolved
Parikh walk visited 8 properties in 8305 ms.
Support contains 9 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 524/524 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 227 transition count 508
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 211 transition count 508
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 32 place count 211 transition count 504
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 207 transition count 504
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 207 transition count 503
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 204 transition count 498
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 204 transition count 498
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 47 place count 204 transition count 497
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 203 transition count 497
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 77 place count 189 transition count 482
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 84 place count 189 transition count 475
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 106 place count 178 transition count 489
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 110 place count 178 transition count 485
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 140 place count 178 transition count 455
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 178 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 144 place count 176 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 145 place count 176 transition count 452
Applied a total of 145 rules in 72 ms. Remains 176 /227 variables (removed 51) and now considering 452/524 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 176/227 places, 452/524 transitions.
RANDOM walk for 40000 steps (1512 resets) in 178 ms. (223 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (318 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (329 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (313 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (324 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (319 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
[2024-06-02 23:25:36] [INFO ] Flow matrix only has 396 transitions (discarded 56 similar events)
// Phase 1: matrix 396 rows 176 cols
[2024-06-02 23:25:36] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:25:36] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 139/147 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 23/170 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 395/565 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 86/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6/571 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/572 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/572 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 274 constraints, problems are : Problem set: 0 solved, 5 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 139/147 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:25:37] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 23/170 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:25:37] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2024-06-02 23:25:37] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:25:37] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 395/565 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 86/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:25:37] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 3 ms to minimize.
[2024-06-02 23:25:37] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/571 variables, 5/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:25:37] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/571 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/571 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/572 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/572 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/572 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 572/572 variables, and 286 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1255 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints]
After SMT, in 1613ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 741 ms.
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 452/452 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 174 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 173 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 173 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 173 transition count 446
Applied a total of 8 rules in 28 ms. Remains 173 /176 variables (removed 3) and now considering 446/452 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 173/176 places, 446/452 transitions.
RANDOM walk for 40000 steps (1520 resets) in 180 ms. (220 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (315 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (312 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (312 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (308 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 504453 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :2 out of 4
Probabilistic random walk after 504453 steps, saw 171317 distinct states, run finished after 3004 ms. (steps per millisecond=167 ) properties seen :2
[2024-06-02 23:25:42] [INFO ] Flow matrix only has 391 transitions (discarded 55 similar events)
// Phase 1: matrix 391 rows 173 cols
[2024-06-02 23:25:42] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 23:25:42] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 77/167 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:25:42] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:25:42] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:25:42] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 390/557 variables, 167/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 85/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/563 variables, 5/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/564 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/564 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 273 constraints, problems are : Problem set: 0 solved, 2 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 77/167 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:25:42] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 390/557 variables, 167/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 85/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/563 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/563 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/563 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/564 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/564 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/564 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 276 constraints, problems are : Problem set: 0 solved, 2 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 826ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 446/446 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 171 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 171 transition count 443
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 170 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 170 transition count 443
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 170 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 169 transition count 442
Applied a total of 9 rules in 31 ms. Remains 169 /173 variables (removed 4) and now considering 442/446 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 169/173 places, 442/446 transitions.
RANDOM walk for 40000 steps (1548 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (311 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (325 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 414474 steps, run visited all 2 properties in 2288 ms. (steps per millisecond=181 )
Probabilistic random walk after 414474 steps, saw 136192 distinct states, run finished after 2292 ms. (steps per millisecond=180 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA FireWire-PT-19-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 23:25:45] [INFO ] Flatten gal took : 35 ms
[2024-06-02 23:25:45] [INFO ] Flatten gal took : 36 ms
[2024-06-02 23:25:45] [INFO ] Input system was already deterministic with 831 transitions.
Support contains 72 out of 491 places (down from 76) after GAL structural reductions.
Computed a total of 83 stabilizing places and 86 stable transitions
Graph (complete) has 1426 edges and 491 vertex of which 487 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.18 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 385 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 471 transition count 709
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 109 rules applied. Total rules applied 216 place count 366 transition count 705
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 218 place count 364 transition count 705
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 218 place count 364 transition count 677
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 274 place count 336 transition count 677
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 298 place count 312 transition count 650
Iterating global reduction 3 with 24 rules applied. Total rules applied 322 place count 312 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 324 place count 312 transition count 648
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 324 place count 312 transition count 640
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 340 place count 304 transition count 640
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 345 place count 299 transition count 605
Iterating global reduction 4 with 5 rules applied. Total rules applied 350 place count 299 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 352 place count 299 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 353 place count 298 transition count 603
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 423 place count 263 transition count 568
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 426 place count 260 transition count 534
Iterating global reduction 6 with 3 rules applied. Total rules applied 429 place count 260 transition count 534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 430 place count 260 transition count 533
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 431 place count 260 transition count 533
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 433 place count 258 transition count 531
Applied a total of 433 rules in 94 ms. Remains 258 /491 variables (removed 233) and now considering 531/831 (removed 300) transitions.
[2024-06-02 23:25:45] [INFO ] Flow matrix only has 526 transitions (discarded 5 similar events)
// Phase 1: matrix 526 rows 258 cols
[2024-06-02 23:25:45] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:25:45] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 23:25:45] [INFO ] Flow matrix only has 526 transitions (discarded 5 similar events)
[2024-06-02 23:25:45] [INFO ] Invariant cache hit.
[2024-06-02 23:25:46] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 23:25:46] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-06-02 23:25:46] [INFO ] Redundant transitions in 32 ms returned []
Running 518 sub problems to find dead transitions.
[2024-06-02 23:25:46] [INFO ] Flow matrix only has 526 transitions (discarded 5 similar events)
[2024-06-02 23:25:46] [INFO ] Invariant cache hit.
[2024-06-02 23:25:46] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-02 23:25:48] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:25:49] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:25:49] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:25:49] [INFO ] Deduced a trap composed of 54 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:25:49] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2024-06-02 23:25:50] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:25:50] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:25:50] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:25:50] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:25:52] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:25:52] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 525/780 variables, 255/276 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/780 variables, 33/309 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-02 23:26:02] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 1 ms to minimize.
[2024-06-02 23:26:04] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/780 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/780 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (OVERLAPS) 3/783 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 783/784 variables, and 314 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 258/258 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 525/780 variables, 255/278 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/780 variables, 33/311 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/780 variables, 518/829 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/780 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (OVERLAPS) 3/783 variables, 3/832 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 783/784 variables, and 832 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 258/258 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 13/13 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 60346ms
Starting structural reductions in SI_CTL mode, iteration 1 : 258/491 places, 531/831 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61052 ms. Remains : 258/491 places, 531/831 transitions.
[2024-06-02 23:26:46] [INFO ] Flatten gal took : 36 ms
[2024-06-02 23:26:46] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:26:46] [INFO ] Input system was already deterministic with 531 transitions.
[2024-06-02 23:26:46] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:26:46] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:26:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality17506380231913032169.gal : 14 ms
[2024-06-02 23:26:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality2692618780977821913.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/CTLCardinality17506380231913032169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2692618780977821913.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:27:17] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:27:17] [INFO ] Applying decomposition
[2024-06-02 23:27:17] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16706501665045493339.txt' '-o' '/tmp/graph16706501665045493339.bin' '-w' '/tmp/graph16706501665045493339.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16706501665045493339.bin' '-l' '-1' '-v' '-w' '/tmp/graph16706501665045493339.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:27:17] [INFO ] Decomposing Gal with order
[2024-06-02 23:27:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:27:17] [INFO ] Removed a total of 649 redundant transitions.
[2024-06-02 23:27:17] [INFO ] Flatten gal took : 101 ms
[2024-06-02 23:27:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 15 ms.
[2024-06-02 23:27:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality1407815058100328548.gal : 7 ms
[2024-06-02 23:27:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality10843249157605496473.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/CTLCardinality1407815058100328548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10843249157605496473.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 49 place count 442 transition count 782
Iterating global reduction 1 with 45 rules applied. Total rules applied 94 place count 442 transition count 782
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 106 place count 430 transition count 741
Iterating global reduction 1 with 12 rules applied. Total rules applied 118 place count 430 transition count 741
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 430 transition count 739
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 428 transition count 737
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 428 transition count 737
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 426 transition count 735
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 426 transition count 735
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 424 transition count 733
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 424 transition count 733
Applied a total of 132 rules in 31 ms. Remains 424 /491 variables (removed 67) and now considering 733/831 (removed 98) transitions.
// Phase 1: matrix 733 rows 424 cols
[2024-06-02 23:27:47] [INFO ] Computed 10 invariants in 10 ms
[2024-06-02 23:27:47] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-02 23:27:47] [INFO ] Invariant cache hit.
[2024-06-02 23:27:48] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Running 732 sub problems to find dead transitions.
[2024-06-02 23:27:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 732 unsolved
[2024-06-02 23:27:58] [INFO ] Deduced a trap composed of 87 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:27:59] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:28:00] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:28:00] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 5 ms to minimize.
[2024-06-02 23:28:00] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:28:01] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:28:04] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 732 unsolved
[2024-06-02 23:28:08] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 732 unsolved
[2024-06-02 23:28:16] [INFO ] Deduced a trap composed of 81 places in 47 ms of which 2 ms to minimize.
[2024-06-02 23:28:16] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/1157 variables, and 20 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/424 constraints, PredecessorRefiner: 732/732 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 732 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 732 unsolved
[2024-06-02 23:28:24] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:28:24] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:28:24] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 0 ms to minimize.
[2024-06-02 23:28:24] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 732 unsolved
[2024-06-02 23:28:32] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 6 (OVERLAPS) 733/1157 variables, 424/449 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1157 variables, 732/1181 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1157/1157 variables, and 1181 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 424/424 constraints, PredecessorRefiner: 732/732 constraints, Known Traps: 15/15 constraints]
After SMT, in 60353ms problems are : Problem set: 0 solved, 732 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Starting structural reductions in LTL mode, iteration 1 : 424/491 places, 733/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60966 ms. Remains : 424/491 places, 733/831 transitions.
[2024-06-02 23:28:48] [INFO ] Flatten gal took : 22 ms
[2024-06-02 23:28:48] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:28:48] [INFO ] Input system was already deterministic with 733 transitions.
[2024-06-02 23:28:48] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:28:48] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:28:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality14348207854774106827.gal : 3 ms
[2024-06-02 23:28:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality11699884925921644237.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/CTLCardinality14348207854774106827.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11699884925921644237.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:29:18] [INFO ] Flatten gal took : 24 ms
[2024-06-02 23:29:18] [INFO ] Applying decomposition
[2024-06-02 23:29:18] [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/graph9616202711667921657.txt' '-o' '/tmp/graph9616202711667921657.bin' '-w' '/tmp/graph9616202711667921657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9616202711667921657.bin' '-l' '-1' '-v' '-w' '/tmp/graph9616202711667921657.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:29:18] [INFO ] Decomposing Gal with order
[2024-06-02 23:29:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:29:18] [INFO ] Removed a total of 756 redundant transitions.
[2024-06-02 23:29:18] [INFO ] Flatten gal took : 33 ms
[2024-06-02 23:29:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 8 ms.
[2024-06-02 23:29:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality12265326294068116095.gal : 5 ms
[2024-06-02 23:29:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality11431378059885967521.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/CTLCardinality12265326294068116095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11431378059885967521.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 51 place count 440 transition count 780
Iterating global reduction 1 with 47 rules applied. Total rules applied 98 place count 440 transition count 780
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 112 place count 426 transition count 734
Iterating global reduction 1 with 14 rules applied. Total rules applied 126 place count 426 transition count 734
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 128 place count 426 transition count 732
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 424 transition count 730
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 424 transition count 730
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 422 transition count 728
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 422 transition count 728
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 420 transition count 726
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 420 transition count 726
Applied a total of 140 rules in 32 ms. Remains 420 /491 variables (removed 71) and now considering 726/831 (removed 105) transitions.
// Phase 1: matrix 726 rows 420 cols
[2024-06-02 23:29:49] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:29:49] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-02 23:29:49] [INFO ] Invariant cache hit.
[2024-06-02 23:29:49] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 725 sub problems to find dead transitions.
[2024-06-02 23:29:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-06-02 23:29:59] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:30:00] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:30:01] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 0 ms to minimize.
[2024-06-02 23:30:01] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 1 ms to minimize.
[2024-06-02 23:30:01] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
[2024-06-02 23:30:02] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:30:06] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 4 (OVERLAPS) 726/1146 variables, 420/437 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-06-02 23:30:19] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 438 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 4 (OVERLAPS) 726/1146 variables, 420/438 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1146 variables, 725/1163 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-06-02 23:30:39] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:30:40] [INFO ] Deduced a trap composed of 132 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:30:40] [INFO ] Deduced a trap composed of 211 places in 144 ms of which 2 ms to minimize.
[2024-06-02 23:30:41] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 3 ms to minimize.
[2024-06-02 23:30:44] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:30:46] [INFO ] Deduced a trap composed of 220 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:30:47] [INFO ] Deduced a trap composed of 226 places in 135 ms of which 2 ms to minimize.
[2024-06-02 23:30:47] [INFO ] Deduced a trap composed of 225 places in 135 ms of which 2 ms to minimize.
[2024-06-02 23:30:48] [INFO ] Deduced a trap composed of 214 places in 131 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1146/1146 variables, and 1172 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 17/17 constraints]
After SMT, in 60338ms problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Starting structural reductions in LTL mode, iteration 1 : 420/491 places, 726/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61000 ms. Remains : 420/491 places, 726/831 transitions.
[2024-06-02 23:30:49] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:30:50] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:30:50] [INFO ] Input system was already deterministic with 726 transitions.
[2024-06-02 23:30:50] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:30:50] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:30:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality1567073035120423790.gal : 4 ms
[2024-06-02 23:30:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality14754588562585711037.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/CTLCardinality1567073035120423790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14754588562585711037.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:31:20] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:31:20] [INFO ] Applying decomposition
[2024-06-02 23:31:20] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12202415485865236468.txt' '-o' '/tmp/graph12202415485865236468.bin' '-w' '/tmp/graph12202415485865236468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12202415485865236468.bin' '-l' '-1' '-v' '-w' '/tmp/graph12202415485865236468.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:31:20] [INFO ] Decomposing Gal with order
[2024-06-02 23:31:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:31:20] [INFO ] Removed a total of 785 redundant transitions.
[2024-06-02 23:31:20] [INFO ] Flatten gal took : 31 ms
[2024-06-02 23:31:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 6 ms.
[2024-06-02 23:31:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality12296107710797150262.gal : 4 ms
[2024-06-02 23:31:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1806419887728169648.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/CTLCardinality12296107710797150262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1806419887728169648.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 52 place count 439 transition count 779
Iterating global reduction 1 with 48 rules applied. Total rules applied 100 place count 439 transition count 779
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 115 place count 424 transition count 732
Iterating global reduction 1 with 15 rules applied. Total rules applied 130 place count 424 transition count 732
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 132 place count 424 transition count 730
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 422 transition count 728
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 422 transition count 728
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 420 transition count 726
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 420 transition count 726
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 142 place count 418 transition count 724
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 418 transition count 724
Applied a total of 144 rules in 31 ms. Remains 418 /491 variables (removed 73) and now considering 724/831 (removed 107) transitions.
// Phase 1: matrix 724 rows 418 cols
[2024-06-02 23:31:50] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 23:31:50] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-02 23:31:50] [INFO ] Invariant cache hit.
[2024-06-02 23:31:50] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 723 sub problems to find dead transitions.
[2024-06-02 23:31:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:32:01] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:32:01] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:32:02] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:32:03] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 1 ms to minimize.
[2024-06-02 23:32:03] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2024-06-02 23:32:03] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:32:07] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:32:08] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:32:08] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:32:19] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1142 variables, and 20 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:32:28] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:32:33] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (OVERLAPS) 724/1142 variables, 418/440 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 723/1163 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1163 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 12/12 constraints]
After SMT, in 60329ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Starting structural reductions in LTL mode, iteration 1 : 418/491 places, 724/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60915 ms. Remains : 418/491 places, 724/831 transitions.
[2024-06-02 23:32:51] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:32:51] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:32:51] [INFO ] Input system was already deterministic with 724 transitions.
[2024-06-02 23:32:51] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:32:51] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:32:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality4292500058972854468.gal : 5 ms
[2024-06-02 23:32:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality16263464399320038003.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/CTLCardinality4292500058972854468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16263464399320038003.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:33:21] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:33:21] [INFO ] Applying decomposition
[2024-06-02 23:33:21] [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/graph17271094485592252920.txt' '-o' '/tmp/graph17271094485592252920.bin' '-w' '/tmp/graph17271094485592252920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17271094485592252920.bin' '-l' '-1' '-v' '-w' '/tmp/graph17271094485592252920.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:33:21] [INFO ] Decomposing Gal with order
[2024-06-02 23:33:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:33:21] [INFO ] Removed a total of 785 redundant transitions.
[2024-06-02 23:33:21] [INFO ] Flatten gal took : 29 ms
[2024-06-02 23:33:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 6 ms.
[2024-06-02 23:33:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality16911396214467140591.gal : 5 ms
[2024-06-02 23:33:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality3192630137217837103.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/CTLCardinality16911396214467140591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3192630137217837103.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 387 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 471 transition count 708
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 110 rules applied. Total rules applied 218 place count 365 transition count 704
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 221 place count 363 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 362 transition count 703
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 222 place count 362 transition count 675
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 278 place count 334 transition count 675
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 301 place count 311 transition count 648
Iterating global reduction 4 with 23 rules applied. Total rules applied 324 place count 311 transition count 648
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 326 place count 311 transition count 646
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 326 place count 311 transition count 639
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 340 place count 304 transition count 639
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 345 place count 299 transition count 604
Iterating global reduction 5 with 5 rules applied. Total rules applied 350 place count 299 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 352 place count 299 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 353 place count 298 transition count 602
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 423 place count 263 transition count 567
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 426 place count 260 transition count 533
Iterating global reduction 7 with 3 rules applied. Total rules applied 429 place count 260 transition count 533
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 430 place count 260 transition count 532
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 431 place count 259 transition count 531
Applied a total of 431 rules in 64 ms. Remains 259 /491 variables (removed 232) and now considering 531/831 (removed 300) transitions.
[2024-06-02 23:33:51] [INFO ] Flow matrix only has 526 transitions (discarded 5 similar events)
// Phase 1: matrix 526 rows 259 cols
[2024-06-02 23:33:51] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:33:52] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-06-02 23:33:52] [INFO ] Flow matrix only has 526 transitions (discarded 5 similar events)
[2024-06-02 23:33:52] [INFO ] Invariant cache hit.
[2024-06-02 23:33:52] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 23:33:52] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-06-02 23:33:52] [INFO ] Redundant transitions in 13 ms returned []
Running 529 sub problems to find dead transitions.
[2024-06-02 23:33:52] [INFO ] Flow matrix only has 526 transitions (discarded 5 similar events)
[2024-06-02 23:33:52] [INFO ] Invariant cache hit.
[2024-06-02 23:33:52] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (OVERLAPS) 1/259 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 529 unsolved
[2024-06-02 23:33:57] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:33:57] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:33:57] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:33:58] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:33:58] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 5 ms to minimize.
[2024-06-02 23:33:58] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:33:58] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:33:58] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:33:58] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:33:59] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:33:59] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:33:59] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:34:00] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:34:01] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 5 (OVERLAPS) 525/784 variables, 259/283 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 33/316 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 784/785 variables, and 316 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 259/259 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 529/529 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 529 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 3 (OVERLAPS) 1/259 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 6 (OVERLAPS) 525/784 variables, 259/283 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 33/316 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 529/845 constraints. Problems are: Problem set: 0 solved, 529 unsolved
[2024-06-02 23:34:43] [INFO ] Deduced a trap composed of 159 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:34:43] [INFO ] Deduced a trap composed of 157 places in 108 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 2/847 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/785 variables, and 847 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 259/259 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 529/529 constraints, Known Traps: 16/16 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 529 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
Starting structural reductions in SI_CTL mode, iteration 1 : 259/491 places, 531/831 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61060 ms. Remains : 259/491 places, 531/831 transitions.
[2024-06-02 23:34:52] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:34:52] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:34:52] [INFO ] Input system was already deterministic with 531 transitions.
[2024-06-02 23:34:52] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:34:52] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:34:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality12894488328961283031.gal : 3 ms
[2024-06-02 23:34:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality873294670621204203.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/CTLCardinality12894488328961283031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality873294670621204203.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:35:23] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:35:23] [INFO ] Applying decomposition
[2024-06-02 23:35:23] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16750918178836081220.txt' '-o' '/tmp/graph16750918178836081220.bin' '-w' '/tmp/graph16750918178836081220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16750918178836081220.bin' '-l' '-1' '-v' '-w' '/tmp/graph16750918178836081220.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:35:23] [INFO ] Decomposing Gal with order
[2024-06-02 23:35:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:35:23] [INFO ] Removed a total of 653 redundant transitions.
[2024-06-02 23:35:23] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:35:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 10 ms.
[2024-06-02 23:35:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality3411541309688666078.gal : 4 ms
[2024-06-02 23:35:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality405641284125673249.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/CTLCardinality3411541309688666078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality405641284125673249.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 386 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 473 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 473 transition count 710
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 109 rules applied. Total rules applied 216 place count 368 transition count 706
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 218 place count 366 transition count 706
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 218 place count 366 transition count 678
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 274 place count 338 transition count 678
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 296 place count 316 transition count 652
Iterating global reduction 3 with 22 rules applied. Total rules applied 318 place count 316 transition count 652
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 319 place count 316 transition count 651
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 319 place count 316 transition count 644
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 333 place count 309 transition count 644
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 337 place count 305 transition count 611
Iterating global reduction 4 with 4 rules applied. Total rules applied 341 place count 305 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 343 place count 305 transition count 609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 344 place count 304 transition count 609
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 420 place count 266 transition count 571
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 423 place count 263 transition count 537
Iterating global reduction 6 with 3 rules applied. Total rules applied 426 place count 263 transition count 537
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 427 place count 263 transition count 536
Applied a total of 427 rules in 50 ms. Remains 263 /491 variables (removed 228) and now considering 536/831 (removed 295) transitions.
[2024-06-02 23:35:53] [INFO ] Flow matrix only has 531 transitions (discarded 5 similar events)
// Phase 1: matrix 531 rows 263 cols
[2024-06-02 23:35:53] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:35:53] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 23:35:53] [INFO ] Flow matrix only has 531 transitions (discarded 5 similar events)
[2024-06-02 23:35:53] [INFO ] Invariant cache hit.
[2024-06-02 23:35:53] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-02 23:35:53] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-06-02 23:35:53] [INFO ] Redundant transitions in 5 ms returned []
Running 535 sub problems to find dead transitions.
[2024-06-02 23:35:53] [INFO ] Flow matrix only has 531 transitions (discarded 5 similar events)
[2024-06-02 23:35:53] [INFO ] Invariant cache hit.
[2024-06-02 23:35:53] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-06-02 23:35:58] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:35:58] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:35:58] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:35:59] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:35:59] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:35:59] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-06-02 23:35:59] [INFO ] Deduced a trap composed of 116 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:35:59] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:36:01] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (OVERLAPS) 530/792 variables, 262/281 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/792 variables, 33/314 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-06-02 23:36:12] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 792/794 variables, and 315 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 262/263 constraints, ReadFeed: 33/34 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-06-02 23:36:27] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 1 ms to minimize.
[2024-06-02 23:36:27] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:36:27] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:36:27] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:36:29] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 530/792 variables, 262/287 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 33/320 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 530/850 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 9 (OVERLAPS) 1/793 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 793/794 variables, and 856 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 263/263 constraints, ReadFeed: 33/34 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 15/15 constraints]
After SMT, in 60328ms problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Starting structural reductions in SI_CTL mode, iteration 1 : 263/491 places, 536/831 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60794 ms. Remains : 263/491 places, 536/831 transitions.
[2024-06-02 23:36:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:36:54] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:36:54] [INFO ] Input system was already deterministic with 536 transitions.
[2024-06-02 23:36:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:36:54] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:36:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13627887629454156625.gal : 3 ms
[2024-06-02 23:36:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality4052601754371377006.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/CTLCardinality13627887629454156625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4052601754371377006.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:37:24] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:37:24] [INFO ] Applying decomposition
[2024-06-02 23:37:24] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12924480572951073128.txt' '-o' '/tmp/graph12924480572951073128.bin' '-w' '/tmp/graph12924480572951073128.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12924480572951073128.bin' '-l' '-1' '-v' '-w' '/tmp/graph12924480572951073128.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:37:24] [INFO ] Decomposing Gal with order
[2024-06-02 23:37:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:37:24] [INFO ] Removed a total of 660 redundant transitions.
[2024-06-02 23:37:24] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:37:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 4 ms.
[2024-06-02 23:37:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality8793466585665804400.gal : 3 ms
[2024-06-02 23:37:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12133538026611663307.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/CTLCardinality8793466585665804400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12133538026611663307.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 51 place count 440 transition count 780
Iterating global reduction 1 with 47 rules applied. Total rules applied 98 place count 440 transition count 780
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 113 place count 425 transition count 733
Iterating global reduction 1 with 15 rules applied. Total rules applied 128 place count 425 transition count 733
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 130 place count 425 transition count 731
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 423 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 423 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 421 transition count 727
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 421 transition count 727
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 419 transition count 725
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 419 transition count 725
Applied a total of 142 rules in 26 ms. Remains 419 /491 variables (removed 72) and now considering 725/831 (removed 106) transitions.
// Phase 1: matrix 725 rows 419 cols
[2024-06-02 23:37:54] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 23:37:54] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-02 23:37:54] [INFO ] Invariant cache hit.
[2024-06-02 23:37:54] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 724 sub problems to find dead transitions.
[2024-06-02 23:37:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 23:38:03] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:38:04] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:38:05] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:38:05] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:38:05] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:38:06] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:38:06] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:38:06] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:38:07] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 23:38:12] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:38:14] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 724 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1144 variables, and 21 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 4 (OVERLAPS) 725/1144 variables, 419/440 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1144 variables, 724/1164 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 23:38:43] [INFO ] Deduced a trap composed of 221 places in 168 ms of which 3 ms to minimize.
[2024-06-02 23:38:43] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 2 ms to minimize.
[2024-06-02 23:38:48] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:38:53] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1168 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 15/15 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 60320ms
Starting structural reductions in LTL mode, iteration 1 : 419/491 places, 725/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60877 ms. Remains : 419/491 places, 725/831 transitions.
[2024-06-02 23:38:55] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:38:55] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:38:55] [INFO ] Input system was already deterministic with 725 transitions.
[2024-06-02 23:38:55] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:38:55] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:38:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality5857733595958569235.gal : 3 ms
[2024-06-02 23:38:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality9101301897824726201.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/CTLCardinality5857733595958569235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9101301897824726201.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:39:25] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:39:25] [INFO ] Applying decomposition
[2024-06-02 23:39:25] [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/graph14723930970210247220.txt' '-o' '/tmp/graph14723930970210247220.bin' '-w' '/tmp/graph14723930970210247220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14723930970210247220.bin' '-l' '-1' '-v' '-w' '/tmp/graph14723930970210247220.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:39:25] [INFO ] Decomposing Gal with order
[2024-06-02 23:39:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:39:25] [INFO ] Removed a total of 755 redundant transitions.
[2024-06-02 23:39:25] [INFO ] Flatten gal took : 35 ms
[2024-06-02 23:39:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 3 ms.
[2024-06-02 23:39:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality1680852545684798548.gal : 4 ms
[2024-06-02 23:39:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality14681799174359288940.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/CTLCardinality1680852545684798548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14681799174359288940.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 488 transition count 831
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 50 place count 441 transition count 780
Iterating global reduction 1 with 47 rules applied. Total rules applied 97 place count 441 transition count 780
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 110 place count 428 transition count 735
Iterating global reduction 1 with 13 rules applied. Total rules applied 123 place count 428 transition count 735
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 125 place count 428 transition count 733
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 426 transition count 731
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 426 transition count 731
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 424 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 424 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 422 transition count 727
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 422 transition count 727
Applied a total of 137 rules in 27 ms. Remains 422 /491 variables (removed 69) and now considering 727/831 (removed 104) transitions.
// Phase 1: matrix 727 rows 422 cols
[2024-06-02 23:39:55] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:39:55] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-02 23:39:55] [INFO ] Invariant cache hit.
[2024-06-02 23:39:56] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2024-06-02 23:39:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 23:40:06] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:40:06] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:40:07] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:40:07] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:40:07] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:40:08] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:40:09] [INFO ] Deduced a trap composed of 110 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:40:09] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:40:12] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 23:40:14] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 0 ms to minimize.
[2024-06-02 23:40:14] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:40:14] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1149 variables, and 22 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/422 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 23:40:33] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:40:35] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 5 (OVERLAPS) 727/1148 variables, 421/445 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1148 variables, 724/1169 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 23:40:52] [INFO ] Deduced a trap composed of 229 places in 167 ms of which 2 ms to minimize.
[2024-06-02 23:40:55] [INFO ] Deduced a trap composed of 139 places in 189 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1148/1149 variables, and 1171 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 421/422 constraints, PredecessorRefiner: 724/726 constraints, Known Traps: 16/16 constraints]
After SMT, in 60339ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
Starting structural reductions in LTL mode, iteration 1 : 422/491 places, 727/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61032 ms. Remains : 422/491 places, 727/831 transitions.
[2024-06-02 23:40:56] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:40:56] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:40:56] [INFO ] Input system was already deterministic with 727 transitions.
[2024-06-02 23:40:56] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:40:56] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:40:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality4402631080617142990.gal : 19 ms
[2024-06-02 23:40:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality18365457915266095207.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/CTLCardinality4402631080617142990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18365457915266095207.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:41:26] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:41:26] [INFO ] Applying decomposition
[2024-06-02 23:41:26] [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/graph964640765434706459.txt' '-o' '/tmp/graph964640765434706459.bin' '-w' '/tmp/graph964640765434706459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph964640765434706459.bin' '-l' '-1' '-v' '-w' '/tmp/graph964640765434706459.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:41:26] [INFO ] Decomposing Gal with order
[2024-06-02 23:41:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:41:26] [INFO ] Removed a total of 784 redundant transitions.
[2024-06-02 23:41:26] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:41:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 3 ms.
[2024-06-02 23:41:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality9209616498573466440.gal : 3 ms
[2024-06-02 23:41:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality9752490623655184792.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/CTLCardinality9209616498573466440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9752490623655184792.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 50 place count 441 transition count 781
Iterating global reduction 1 with 46 rules applied. Total rules applied 96 place count 441 transition count 781
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 109 place count 428 transition count 736
Iterating global reduction 1 with 13 rules applied. Total rules applied 122 place count 428 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 123 place count 428 transition count 735
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 426 transition count 733
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 426 transition count 733
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 424 transition count 731
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 424 transition count 731
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 422 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 422 transition count 729
Applied a total of 135 rules in 22 ms. Remains 422 /491 variables (removed 69) and now considering 729/831 (removed 102) transitions.
// Phase 1: matrix 729 rows 422 cols
[2024-06-02 23:41:57] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:41:57] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-02 23:41:57] [INFO ] Invariant cache hit.
[2024-06-02 23:41:57] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 728 sub problems to find dead transitions.
[2024-06-02 23:41:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-06-02 23:42:06] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:42:06] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:42:06] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:42:07] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:42:08] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:42:09] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 0 ms to minimize.
[2024-06-02 23:42:09] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:42:10] [INFO ] Deduced a trap composed of 114 places in 132 ms of which 1 ms to minimize.
[2024-06-02 23:42:10] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-06-02 23:42:17] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1151 variables, and 20 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/422 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 728 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-06-02 23:42:34] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 5 (OVERLAPS) 729/1151 variables, 422/443 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1151 variables, 728/1171 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-06-02 23:42:53] [INFO ] Deduced a trap composed of 229 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:42:53] [INFO ] Deduced a trap composed of 210 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:42:54] [INFO ] Deduced a trap composed of 224 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:42:56] [INFO ] Deduced a trap composed of 214 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1151/1151 variables, and 1175 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 422/422 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 15/15 constraints]
After SMT, in 60329ms problems are : Problem set: 0 solved, 728 unsolved
Search for dead transitions found 0 dead transitions in 60335ms
Starting structural reductions in LTL mode, iteration 1 : 422/491 places, 729/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60950 ms. Remains : 422/491 places, 729/831 transitions.
[2024-06-02 23:42:57] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:42:57] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:42:58] [INFO ] Input system was already deterministic with 729 transitions.
[2024-06-02 23:42:58] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:42:58] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:42:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality11340660005637944219.gal : 2 ms
[2024-06-02 23:42:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality6160121611883687352.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/CTLCardinality11340660005637944219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6160121611883687352.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:43:28] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:43:28] [INFO ] Applying decomposition
[2024-06-02 23:43:28] [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/graph14679366878807046907.txt' '-o' '/tmp/graph14679366878807046907.bin' '-w' '/tmp/graph14679366878807046907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14679366878807046907.bin' '-l' '-1' '-v' '-w' '/tmp/graph14679366878807046907.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:43:28] [INFO ] Decomposing Gal with order
[2024-06-02 23:43:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:43:28] [INFO ] Removed a total of 783 redundant transitions.
[2024-06-02 23:43:28] [INFO ] Flatten gal took : 37 ms
[2024-06-02 23:43:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 6 ms.
[2024-06-02 23:43:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality15695080779263018076.gal : 24 ms
[2024-06-02 23:43:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality9652422936799686687.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/CTLCardinality15695080779263018076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9652422936799686687.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 388 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 471 transition count 707
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 111 rules applied. Total rules applied 220 place count 364 transition count 703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 222 place count 362 transition count 703
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 222 place count 362 transition count 675
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 278 place count 334 transition count 675
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 302 place count 310 transition count 647
Iterating global reduction 3 with 24 rules applied. Total rules applied 326 place count 310 transition count 647
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 328 place count 310 transition count 645
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 328 place count 310 transition count 638
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 342 place count 303 transition count 638
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 347 place count 298 transition count 603
Iterating global reduction 4 with 5 rules applied. Total rules applied 352 place count 298 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 354 place count 298 transition count 601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 355 place count 297 transition count 601
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 427 place count 261 transition count 565
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 430 place count 258 transition count 531
Iterating global reduction 6 with 3 rules applied. Total rules applied 433 place count 258 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 434 place count 258 transition count 530
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 435 place count 258 transition count 530
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 437 place count 256 transition count 528
Applied a total of 437 rules in 104 ms. Remains 256 /491 variables (removed 235) and now considering 528/831 (removed 303) transitions.
[2024-06-02 23:43:58] [INFO ] Flow matrix only has 523 transitions (discarded 5 similar events)
// Phase 1: matrix 523 rows 256 cols
[2024-06-02 23:43:58] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 23:43:58] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-06-02 23:43:58] [INFO ] Flow matrix only has 523 transitions (discarded 5 similar events)
[2024-06-02 23:43:58] [INFO ] Invariant cache hit.
[2024-06-02 23:43:58] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 23:43:59] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2024-06-02 23:43:59] [INFO ] Redundant transitions in 4 ms returned []
Running 515 sub problems to find dead transitions.
[2024-06-02 23:43:59] [INFO ] Flow matrix only has 523 transitions (discarded 5 similar events)
[2024-06-02 23:43:59] [INFO ] Invariant cache hit.
[2024-06-02 23:43:59] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 23:44:01] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 1 ms to minimize.
[2024-06-02 23:44:01] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:44:02] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:44:02] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:44:02] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:44:02] [INFO ] Deduced a trap composed of 113 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:44:02] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:44:03] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:44:04] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:44:04] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:44:05] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (OVERLAPS) 522/775 variables, 253/274 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/775 variables, 33/307 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/775 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 6 (OVERLAPS) 3/778 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/778 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 778/779 variables, and 310 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 256/256 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (OVERLAPS) 522/775 variables, 253/274 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/775 variables, 33/307 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/775 variables, 515/822 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 23:44:36] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 1/823 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 515 unsolved
SMT process timed out in 60250ms, After SMT, problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in SI_CTL mode, iteration 1 : 256/491 places, 528/831 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61088 ms. Remains : 256/491 places, 528/831 transitions.
[2024-06-02 23:44:59] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:44:59] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:44:59] [INFO ] Input system was already deterministic with 528 transitions.
[2024-06-02 23:44:59] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:44:59] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:44:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality18432660926892981514.gal : 2 ms
[2024-06-02 23:44:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality17742149960505557741.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/CTLCardinality18432660926892981514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17742149960505557741.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:45:29] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:45:29] [INFO ] Applying decomposition
[2024-06-02 23:45:29] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12394610657971604494.txt' '-o' '/tmp/graph12394610657971604494.bin' '-w' '/tmp/graph12394610657971604494.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12394610657971604494.bin' '-l' '-1' '-v' '-w' '/tmp/graph12394610657971604494.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:45:29] [INFO ] Decomposing Gal with order
[2024-06-02 23:45:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:45:29] [INFO ] Removed a total of 652 redundant transitions.
[2024-06-02 23:45:29] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:45:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 4 ms.
[2024-06-02 23:45:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality17636811710729510970.gal : 3 ms
[2024-06-02 23:45:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality12957547149063346531.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/CTLCardinality17636811710729510970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12957547149063346531.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 386 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 471 transition count 708
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 110 rules applied. Total rules applied 218 place count 365 transition count 704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 220 place count 363 transition count 704
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 220 place count 363 transition count 676
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 276 place count 335 transition count 676
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 300 place count 311 transition count 648
Iterating global reduction 3 with 24 rules applied. Total rules applied 324 place count 311 transition count 648
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 326 place count 311 transition count 646
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 326 place count 311 transition count 638
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 342 place count 303 transition count 638
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 347 place count 298 transition count 603
Iterating global reduction 4 with 5 rules applied. Total rules applied 352 place count 298 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 354 place count 298 transition count 601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 355 place count 297 transition count 601
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 425 place count 262 transition count 566
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 428 place count 259 transition count 532
Iterating global reduction 6 with 3 rules applied. Total rules applied 431 place count 259 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 432 place count 259 transition count 531
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 434 place count 257 transition count 529
Applied a total of 434 rules in 58 ms. Remains 257 /491 variables (removed 234) and now considering 529/831 (removed 302) transitions.
[2024-06-02 23:45:59] [INFO ] Flow matrix only has 524 transitions (discarded 5 similar events)
// Phase 1: matrix 524 rows 257 cols
[2024-06-02 23:45:59] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:45:59] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 23:45:59] [INFO ] Flow matrix only has 524 transitions (discarded 5 similar events)
[2024-06-02 23:45:59] [INFO ] Invariant cache hit.
[2024-06-02 23:46:00] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 23:46:00] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2024-06-02 23:46:00] [INFO ] Redundant transitions in 5 ms returned []
Running 515 sub problems to find dead transitions.
[2024-06-02 23:46:00] [INFO ] Flow matrix only has 524 transitions (discarded 5 similar events)
[2024-06-02 23:46:00] [INFO ] Invariant cache hit.
[2024-06-02 23:46:00] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 23:46:02] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:46:03] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:46:03] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:46:03] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:46:03] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:46:03] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:46:04] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:46:05] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:46:06] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:46:06] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:46:06] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (OVERLAPS) 1/254 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 23:46:12] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:46:12] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 6 (OVERLAPS) 523/777 variables, 254/277 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 33/310 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/777 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 3/780 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 780/781 variables, and 313 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 257/257 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (OVERLAPS) 1/254 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 23:46:34] [INFO ] Deduced a trap composed of 155 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 6 (OVERLAPS) 523/777 variables, 254/278 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 33/311 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/777 variables, 515/826 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 23:46:53] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/777 variables, 1/827 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/781 variables, and 827 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 254/257 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 15/15 constraints]
After SMT, in 60300ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60306ms
Starting structural reductions in SI_CTL mode, iteration 1 : 257/491 places, 529/831 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60877 ms. Remains : 257/491 places, 529/831 transitions.
[2024-06-02 23:47:00] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:47:00] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:47:00] [INFO ] Input system was already deterministic with 529 transitions.
[2024-06-02 23:47:00] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:47:00] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:47:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality9377625605100026079.gal : 2 ms
[2024-06-02 23:47:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality3881041165448146870.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/CTLCardinality9377625605100026079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3881041165448146870.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:47:30] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:47:30] [INFO ] Applying decomposition
[2024-06-02 23:47:30] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4564705190916666142.txt' '-o' '/tmp/graph4564705190916666142.bin' '-w' '/tmp/graph4564705190916666142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4564705190916666142.bin' '-l' '-1' '-v' '-w' '/tmp/graph4564705190916666142.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:47:30] [INFO ] Decomposing Gal with order
[2024-06-02 23:47:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:47:30] [INFO ] Removed a total of 654 redundant transitions.
[2024-06-02 23:47:30] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:47:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 4 ms.
[2024-06-02 23:47:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality12017805577812697571.gal : 2 ms
[2024-06-02 23:47:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality17306751072341044066.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/CTLCardinality12017805577812697571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17306751072341044066.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 488 transition count 831
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 447 transition count 788
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 447 transition count 788
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 96 place count 436 transition count 747
Iterating global reduction 1 with 11 rules applied. Total rules applied 107 place count 436 transition count 747
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 109 place count 436 transition count 745
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 435 transition count 744
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 435 transition count 744
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 434 transition count 743
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 434 transition count 743
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 433 transition count 742
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 433 transition count 742
Applied a total of 115 rules in 25 ms. Remains 433 /491 variables (removed 58) and now considering 742/831 (removed 89) transitions.
// Phase 1: matrix 742 rows 433 cols
[2024-06-02 23:48:00] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:48:01] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-02 23:48:01] [INFO ] Invariant cache hit.
[2024-06-02 23:48:01] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 741 sub problems to find dead transitions.
[2024-06-02 23:48:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (OVERLAPS) 1/432 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-02 23:48:11] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:48:11] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 0 ms to minimize.
[2024-06-02 23:48:12] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:48:12] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:48:12] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:48:13] [INFO ] Deduced a trap composed of 90 places in 70 ms of which 2 ms to minimize.
[2024-06-02 23:48:13] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:48:13] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:48:13] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:48:13] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:48:14] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 2 ms to minimize.
[2024-06-02 23:48:14] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:48:15] [INFO ] Deduced a trap composed of 112 places in 161 ms of which 2 ms to minimize.
[2024-06-02 23:48:15] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:48:19] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/432 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 4 (OVERLAPS) 742/1174 variables, 432/457 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1174/1175 variables, and 457 constraints, problems are : Problem set: 0 solved, 741 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 432/433 constraints, PredecessorRefiner: 741/741 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 741 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (OVERLAPS) 1/432 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-02 23:48:36] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/432 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 5 (OVERLAPS) 742/1174 variables, 432/458 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1174 variables, 736/1194 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-02 23:48:58] [INFO ] Deduced a trap composed of 217 places in 152 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1174/1175 variables, and 1195 constraints, problems are : Problem set: 0 solved, 741 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 432/433 constraints, PredecessorRefiner: 736/741 constraints, Known Traps: 17/17 constraints]
After SMT, in 60304ms problems are : Problem set: 0 solved, 741 unsolved
Search for dead transitions found 0 dead transitions in 60310ms
Starting structural reductions in LTL mode, iteration 1 : 433/491 places, 742/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60870 ms. Remains : 433/491 places, 742/831 transitions.
[2024-06-02 23:49:01] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:49:01] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:49:01] [INFO ] Input system was already deterministic with 742 transitions.
[2024-06-02 23:49:01] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:49:01] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:49:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality11178758592367885619.gal : 4 ms
[2024-06-02 23:49:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality16967695802366870457.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/CTLCardinality11178758592367885619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16967695802366870457.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:49:32] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:49:32] [INFO ] Applying decomposition
[2024-06-02 23:49:32] [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/graph8471228411717695327.txt' '-o' '/tmp/graph8471228411717695327.bin' '-w' '/tmp/graph8471228411717695327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8471228411717695327.bin' '-l' '-1' '-v' '-w' '/tmp/graph8471228411717695327.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:49:32] [INFO ] Decomposing Gal with order
[2024-06-02 23:49:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:49:32] [INFO ] Removed a total of 793 redundant transitions.
[2024-06-02 23:49:32] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:49:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 4 ms.
[2024-06-02 23:49:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality14128896550236807062.gal : 6 ms
[2024-06-02 23:49:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality7181099584236220871.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/CTLCardinality14128896550236807062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7181099584236220871.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 386 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 471 transition count 708
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 110 rules applied. Total rules applied 218 place count 365 transition count 704
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 221 place count 363 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 362 transition count 703
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 222 place count 362 transition count 676
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 276 place count 335 transition count 676
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 301 place count 310 transition count 647
Iterating global reduction 4 with 25 rules applied. Total rules applied 326 place count 310 transition count 647
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 328 place count 310 transition count 645
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 328 place count 310 transition count 637
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 344 place count 302 transition count 637
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 349 place count 297 transition count 602
Iterating global reduction 5 with 5 rules applied. Total rules applied 354 place count 297 transition count 602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 356 place count 297 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 357 place count 296 transition count 600
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 427 place count 261 transition count 565
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 430 place count 258 transition count 531
Iterating global reduction 7 with 3 rules applied. Total rules applied 433 place count 258 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 434 place count 258 transition count 530
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 436 place count 256 transition count 528
Applied a total of 436 rules in 88 ms. Remains 256 /491 variables (removed 235) and now considering 528/831 (removed 303) transitions.
[2024-06-02 23:50:02] [INFO ] Flow matrix only has 523 transitions (discarded 5 similar events)
// Phase 1: matrix 523 rows 256 cols
[2024-06-02 23:50:02] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 23:50:02] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-06-02 23:50:02] [INFO ] Flow matrix only has 523 transitions (discarded 5 similar events)
[2024-06-02 23:50:02] [INFO ] Invariant cache hit.
[2024-06-02 23:50:02] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 23:50:03] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2024-06-02 23:50:03] [INFO ] Redundant transitions in 4 ms returned []
Running 515 sub problems to find dead transitions.
[2024-06-02 23:50:03] [INFO ] Flow matrix only has 523 transitions (discarded 5 similar events)
[2024-06-02 23:50:03] [INFO ] Invariant cache hit.
[2024-06-02 23:50:03] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 23:50:05] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:50:05] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:50:05] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:50:06] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:50:06] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 1 ms to minimize.
[2024-06-02 23:50:06] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:50:07] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:50:07] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2024-06-02 23:50:08] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2024-06-02 23:50:08] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:50:09] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 23:50:10] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2024-06-02 23:50:10] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 522/775 variables, 253/276 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/775 variables, 33/309 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-06-02 23:50:19] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-06-02 23:50:20] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 775/779 variables, and 311 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 253/256 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (OVERLAPS) 522/775 variables, 253/278 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/775 variables, 33/311 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/775 variables, 515/826 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 7 (OVERLAPS) 3/778 variables, 3/829 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 778/779 variables, and 829 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 256/256 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 15/15 constraints]
After SMT, in 60292ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Starting structural reductions in SI_CTL mode, iteration 1 : 256/491 places, 528/831 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61131 ms. Remains : 256/491 places, 528/831 transitions.
[2024-06-02 23:51:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:51:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:51:03] [INFO ] Input system was already deterministic with 528 transitions.
[2024-06-02 23:51:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:51:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:51:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality2713384350821063068.gal : 2 ms
[2024-06-02 23:51:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality17947076315168532608.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/CTLCardinality2713384350821063068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17947076315168532608.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:51:33] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:51:33] [INFO ] Applying decomposition
[2024-06-02 23:51:33] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1770967683962902629.txt' '-o' '/tmp/graph1770967683962902629.bin' '-w' '/tmp/graph1770967683962902629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1770967683962902629.bin' '-l' '-1' '-v' '-w' '/tmp/graph1770967683962902629.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:51:33] [INFO ] Decomposing Gal with order
[2024-06-02 23:51:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:51:33] [INFO ] Removed a total of 657 redundant transitions.
[2024-06-02 23:51:33] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:51:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 131 labels/synchronizations in 5 ms.
[2024-06-02 23:51:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality11243367188318101787.gal : 3 ms
[2024-06-02 23:51:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality12214579667825378678.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/CTLCardinality11243367188318101787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12214579667825378678.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:52:03] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:52:03] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:52:03] [INFO ] Applying decomposition
[2024-06-02 23:52:03] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11864896588639001441.txt' '-o' '/tmp/graph11864896588639001441.bin' '-w' '/tmp/graph11864896588639001441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11864896588639001441.bin' '-l' '-1' '-v' '-w' '/tmp/graph11864896588639001441.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:52:03] [INFO ] Decomposing Gal with order
[2024-06-02 23:52:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:52:03] [INFO ] Removed a total of 792 redundant transitions.
[2024-06-02 23:52:03] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:52:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 5 ms.
[2024-06-02 23:52:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality2621420945498664513.gal : 4 ms
[2024-06-02 23:52:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality10623598421852155111.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/CTLCardinality2621420945498664513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10623598421852155111.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 13 CTL formulae.
ITS-tools command line returned an error code 137
[2024-06-03 00:10:15] [INFO ] Applying decomposition
[2024-06-03 00:10:15] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:10:15] [INFO ] Decomposing Gal with order
[2024-06-03 00:10:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:10:15] [INFO ] Removed a total of 648 redundant transitions.
[2024-06-03 00:10:15] [INFO ] Flatten gal took : 32 ms
[2024-06-03 00:10:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 586 labels/synchronizations in 8 ms.
[2024-06-03 00:10:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality12243866885805223910.gal : 3 ms
[2024-06-03 00:10:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality18129823520812436961.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/CTLCardinality12243866885805223910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18129823520812436961.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 13 CTL formulae.
ITS-tools command line returned an error code 137
[2024-06-03 00:21:14] [INFO ] Flatten gal took : 24 ms
[2024-06-03 00:21:14] [INFO ] Input system was already deterministic with 831 transitions.
[2024-06-03 00:21:14] [INFO ] Transformed 491 places.
[2024-06-03 00:21:14] [INFO ] Transformed 831 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-06-03 00:21:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality5004296016894157633.gal : 3 ms
[2024-06-03 00:21:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality2612402875035517467.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/CTLCardinality5004296016894157633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2612402875035517467.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 13 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-19"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-19, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734899100313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-19.tgz
mv FireWire-PT-19 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 '
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 ;