Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 17K Apr 11 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.5M May 18 16:43 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 PolyORBLF-PT-S04J04T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716916900279

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 17:21:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:21:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:21:41] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2024-05-28 17:21:41] [INFO ] Transformed 554 places.
[2024-05-28 17:21:41] [INFO ] Transformed 2998 transitions.
[2024-05-28 17:21:41] [INFO ] Parsed PT model containing 554 places and 2998 transitions and 20754 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 340 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 544 transition count 1366
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 544 transition count 1366
Applied a total of 16 rules in 79 ms. Remains 544 /554 variables (removed 10) and now considering 1366/1372 (removed 6) transitions.
Running 1362 sub problems to find dead transitions.
[2024-05-28 17:21:42] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 544 cols
[2024-05-28 17:21:42] [INFO ] Computed 46 invariants in 64 ms
[2024-05-28 17:21:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-28 17:21:57] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 17 ms to minimize.
[2024-05-28 17:21:57] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:21:57] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:21:57] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:21:58] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 2 ms to minimize.
[2024-05-28 17:21:58] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:21:58] [INFO ] Deduced a trap composed of 132 places in 279 ms of which 3 ms to minimize.
[2024-05-28 17:21:59] [INFO ] Deduced a trap composed of 230 places in 332 ms of which 65 ms to minimize.
[2024-05-28 17:21:59] [INFO ] Deduced a trap composed of 165 places in 289 ms of which 3 ms to minimize.
[2024-05-28 17:21:59] [INFO ] Deduced a trap composed of 336 places in 338 ms of which 3 ms to minimize.
[2024-05-28 17:22:00] [INFO ] Deduced a trap composed of 271 places in 301 ms of which 4 ms to minimize.
[2024-05-28 17:22:00] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 0 ms to minimize.
[2024-05-28 17:22:00] [INFO ] Deduced a trap composed of 282 places in 263 ms of which 3 ms to minimize.
[2024-05-28 17:22:00] [INFO ] Deduced a trap composed of 268 places in 261 ms of which 3 ms to minimize.
[2024-05-28 17:22:01] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 2 ms to minimize.
[2024-05-28 17:22:02] [INFO ] Deduced a trap composed of 264 places in 350 ms of which 4 ms to minimize.
[2024-05-28 17:22:03] [INFO ] Deduced a trap composed of 295 places in 321 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1886 variables, and 59 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20105 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-28 17:22:18] [INFO ] Deduced a trap composed of 322 places in 351 ms of which 4 ms to minimize.
[2024-05-28 17:22:18] [INFO ] Deduced a trap composed of 290 places in 319 ms of which 5 ms to minimize.
[2024-05-28 17:22:19] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 3 ms to minimize.
[2024-05-28 17:22:20] [INFO ] Deduced a trap composed of 259 places in 301 ms of which 6 ms to minimize.
[2024-05-28 17:22:20] [INFO ] Deduced a trap composed of 281 places in 336 ms of which 4 ms to minimize.
[2024-05-28 17:22:21] [INFO ] Deduced a trap composed of 321 places in 310 ms of which 3 ms to minimize.
[2024-05-28 17:22:25] [INFO ] Deduced a trap composed of 310 places in 317 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1886 variables, and 66 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 24/24 constraints]
After SMT, in 44599ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 44643ms
[2024-05-28 17:22:26] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-05-28 17:22:26] [INFO ] Invariant cache hit.
[2024-05-28 17:22:27] [INFO ] Implicit Places using invariants in 310 ms returned [89, 244, 274, 361, 383, 480]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 334 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 538/554 places, 1366/1372 transitions.
Applied a total of 0 rules in 33 ms. Remains 538 /538 variables (removed 0) and now considering 1366/1366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45138 ms. Remains : 538/554 places, 1366/1372 transitions.
Support contains 340 out of 538 places after structural reductions.
[2024-05-28 17:22:27] [INFO ] Flatten gal took : 184 ms
[2024-05-28 17:22:27] [INFO ] Flatten gal took : 125 ms
[2024-05-28 17:22:27] [INFO ] Input system was already deterministic with 1366 transitions.
Support contains 335 out of 538 places (down from 340) after GAL structural reductions.
RANDOM walk for 40001 steps (8 resets) in 2339 ms. (17 steps per ms) remains 51/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (9 resets) in 39 ms. (100 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 199 ms. (20 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
[2024-05-28 17:22:29] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 538 cols
[2024-05-28 17:22:29] [INFO ] Computed 40 invariants in 30 ms
[2024-05-28 17:22:29] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (OVERLAPS) 221/436 variables, 11/11 constraints. Problems are: Problem set: 25 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/11 constraints. Problems are: Problem set: 25 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 2/438 variables, 2/13 constraints. Problems are: Problem set: 25 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/13 constraints. Problems are: Problem set: 25 solved, 26 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
After SMT solving in domain Real declared 537/1880 variables, and 39 constraints, problems are : Problem set: 51 solved, 0 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 950ms problems are : Problem set: 51 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 51 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 17:22:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 17:22:30] [INFO ] Flatten gal took : 77 ms
[2024-05-28 17:22:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 17:22:30] [INFO ] Flatten gal took : 61 ms
[2024-05-28 17:22:30] [INFO ] Input system was already deterministic with 1366 transitions.
Support contains 89 out of 538 places (down from 91) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 1360
Applied a total of 12 rules in 30 ms. Remains 532 /538 variables (removed 6) and now considering 1360/1366 (removed 6) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 17:22:30] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-28 17:22:30] [INFO ] Computed 40 invariants in 34 ms
[2024-05-28 17:22:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:22:45] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 3 ms to minimize.
[2024-05-28 17:22:45] [INFO ] Deduced a trap composed of 139 places in 300 ms of which 3 ms to minimize.
[2024-05-28 17:22:45] [INFO ] Deduced a trap composed of 304 places in 326 ms of which 3 ms to minimize.
[2024-05-28 17:22:46] [INFO ] Deduced a trap composed of 278 places in 314 ms of which 7 ms to minimize.
[2024-05-28 17:22:46] [INFO ] Deduced a trap composed of 258 places in 327 ms of which 3 ms to minimize.
[2024-05-28 17:22:47] [INFO ] Deduced a trap composed of 286 places in 284 ms of which 3 ms to minimize.
[2024-05-28 17:22:48] [INFO ] Deduced a trap composed of 299 places in 311 ms of which 4 ms to minimize.
[2024-05-28 17:22:48] [INFO ] Deduced a trap composed of 253 places in 302 ms of which 4 ms to minimize.
[2024-05-28 17:22:48] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
[2024-05-28 17:22:49] [INFO ] Deduced a trap composed of 82 places in 186 ms of which 3 ms to minimize.
[2024-05-28 17:22:49] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 6 ms to minimize.
[2024-05-28 17:22:51] [INFO ] Deduced a trap composed of 289 places in 186 ms of which 3 ms to minimize.
[2024-05-28 17:22:51] [INFO ] Deduced a trap composed of 348 places in 184 ms of which 3 ms to minimize.
[2024-05-28 17:22:52] [INFO ] Deduced a trap composed of 291 places in 270 ms of which 4 ms to minimize.
[2024-05-28 17:22:52] [INFO ] Deduced a trap composed of 42 places in 301 ms of which 3 ms to minimize.
[2024-05-28 17:22:53] [INFO ] Deduced a trap composed of 321 places in 228 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:23:03] [INFO ] Deduced a trap composed of 344 places in 366 ms of which 3 ms to minimize.
[2024-05-28 17:23:09] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 3 ms to minimize.
[2024-05-28 17:23:10] [INFO ] Deduced a trap composed of 3 places in 310 ms of which 3 ms to minimize.
[2024-05-28 17:23:10] [INFO ] Deduced a trap composed of 5 places in 326 ms of which 3 ms to minimize.
[2024-05-28 17:23:10] [INFO ] Deduced a trap composed of 74 places in 325 ms of which 3 ms to minimize.
[2024-05-28 17:23:11] [INFO ] Deduced a trap composed of 28 places in 380 ms of which 4 ms to minimize.
[2024-05-28 17:23:11] [INFO ] Deduced a trap composed of 28 places in 372 ms of which 4 ms to minimize.
[2024-05-28 17:23:11] [INFO ] Deduced a trap composed of 303 places in 306 ms of which 3 ms to minimize.
[2024-05-28 17:23:12] [INFO ] Deduced a trap composed of 75 places in 290 ms of which 3 ms to minimize.
[2024-05-28 17:23:12] [INFO ] Deduced a trap composed of 74 places in 242 ms of which 3 ms to minimize.
[2024-05-28 17:23:12] [INFO ] Deduced a trap composed of 75 places in 38 ms of which 2 ms to minimize.
[2024-05-28 17:23:12] [INFO ] Deduced a trap composed of 317 places in 363 ms of which 3 ms to minimize.
[2024-05-28 17:23:13] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:23:14] [INFO ] Deduced a trap composed of 342 places in 399 ms of which 3 ms to minimize.
[2024-05-28 17:23:14] [INFO ] Deduced a trap composed of 314 places in 380 ms of which 4 ms to minimize.
[2024-05-28 17:23:14] [INFO ] Deduced a trap composed of 310 places in 356 ms of which 4 ms to minimize.
[2024-05-28 17:23:15] [INFO ] Deduced a trap composed of 337 places in 356 ms of which 4 ms to minimize.
SMT process timed out in 44427ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44446ms
[2024-05-28 17:23:15] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:23:15] [INFO ] Invariant cache hit.
[2024-05-28 17:23:15] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-28 17:23:15] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:23:15] [INFO ] Invariant cache hit.
[2024-05-28 17:23:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:23:28] [INFO ] Implicit Places using invariants and state equation in 12594 ms returned []
Implicit Place search using SMT with State Equation took 13093 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-28 17:23:28] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:23:28] [INFO ] Invariant cache hit.
[2024-05-28 17:23:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:23:43] [INFO ] Deduced a trap composed of 142 places in 238 ms of which 3 ms to minimize.
[2024-05-28 17:23:44] [INFO ] Deduced a trap composed of 304 places in 309 ms of which 4 ms to minimize.
[2024-05-28 17:23:44] [INFO ] Deduced a trap composed of 323 places in 269 ms of which 3 ms to minimize.
[2024-05-28 17:23:44] [INFO ] Deduced a trap composed of 262 places in 260 ms of which 3 ms to minimize.
[2024-05-28 17:23:45] [INFO ] Deduced a trap composed of 280 places in 282 ms of which 3 ms to minimize.
[2024-05-28 17:23:45] [INFO ] Deduced a trap composed of 286 places in 260 ms of which 3 ms to minimize.
[2024-05-28 17:23:45] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 2 ms to minimize.
[2024-05-28 17:23:46] [INFO ] Deduced a trap composed of 283 places in 287 ms of which 4 ms to minimize.
[2024-05-28 17:23:46] [INFO ] Deduced a trap composed of 267 places in 261 ms of which 4 ms to minimize.
[2024-05-28 17:23:47] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 2 ms to minimize.
[2024-05-28 17:23:47] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 2 ms to minimize.
[2024-05-28 17:23:47] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 1 ms to minimize.
[2024-05-28 17:23:47] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2024-05-28 17:23:47] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-05-28 17:23:50] [INFO ] Deduced a trap composed of 291 places in 271 ms of which 4 ms to minimize.
[2024-05-28 17:23:50] [INFO ] Deduced a trap composed of 42 places in 294 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:24:12] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 3 ms to minimize.
[2024-05-28 17:24:13] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 4 ms to minimize.
[2024-05-28 17:24:13] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 5 ms to minimize.
[2024-05-28 17:24:13] [INFO ] Deduced a trap composed of 74 places in 340 ms of which 4 ms to minimize.
[2024-05-28 17:24:14] [INFO ] Deduced a trap composed of 28 places in 313 ms of which 4 ms to minimize.
[2024-05-28 17:24:14] [INFO ] Deduced a trap composed of 74 places in 271 ms of which 3 ms to minimize.
[2024-05-28 17:24:14] [INFO ] Deduced a trap composed of 301 places in 255 ms of which 3 ms to minimize.
[2024-05-28 17:24:14] [INFO ] Deduced a trap composed of 28 places in 361 ms of which 4 ms to minimize.
[2024-05-28 17:24:15] [INFO ] Deduced a trap composed of 74 places in 374 ms of which 3 ms to minimize.
[2024-05-28 17:24:15] [INFO ] Deduced a trap composed of 74 places in 246 ms of which 3 ms to minimize.
[2024-05-28 17:24:15] [INFO ] Deduced a trap composed of 341 places in 248 ms of which 3 ms to minimize.
[2024-05-28 17:24:16] [INFO ] Deduced a trap composed of 350 places in 247 ms of which 2 ms to minimize.
[2024-05-28 17:24:16] [INFO ] Deduced a trap composed of 338 places in 356 ms of which 3 ms to minimize.
[2024-05-28 17:24:16] [INFO ] Deduced a trap composed of 325 places in 330 ms of which 4 ms to minimize.
[2024-05-28 17:24:17] [INFO ] Deduced a trap composed of 292 places in 309 ms of which 3 ms to minimize.
[2024-05-28 17:24:17] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:24:19] [INFO ] Deduced a trap composed of 357 places in 315 ms of which 4 ms to minimize.
[2024-05-28 17:24:20] [INFO ] Deduced a trap composed of 98 places in 351 ms of which 5 ms to minimize.
[2024-05-28 17:24:20] [INFO ] Deduced a trap composed of 352 places in 349 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 62 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 35/35 constraints]
After SMT, in 64792ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 64805ms
Starting structural reductions in LTL mode, iteration 1 : 532/538 places, 1360/1366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122383 ms. Remains : 532/538 places, 1360/1366 transitions.
[2024-05-28 17:24:33] [INFO ] Flatten gal took : 50 ms
[2024-05-28 17:24:33] [INFO ] Flatten gal took : 74 ms
[2024-05-28 17:24:33] [INFO ] Input system was already deterministic with 1360 transitions.
[2024-05-28 17:24:33] [INFO ] Flatten gal took : 67 ms
[2024-05-28 17:24:33] [INFO ] Flatten gal took : 67 ms
[2024-05-28 17:24:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality16743225561935457569.gal : 37 ms
[2024-05-28 17:24:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality17326807739459563028.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/CTLCardinality16743225561935457569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17326807739459563028.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 17:25:03] [INFO ] Flatten gal took : 87 ms
[2024-05-28 17:25:03] [INFO ] Applying decomposition
[2024-05-28 17:25:03] [INFO ] Flatten gal took : 67 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/graph2983204375514130960.txt' '-o' '/tmp/graph2983204375514130960.bin' '-w' '/tmp/graph2983204375514130960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2983204375514130960.bin' '-l' '-1' '-v' '-w' '/tmp/graph2983204375514130960.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:25:04] [INFO ] Decomposing Gal with order
[2024-05-28 17:25:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:25:04] [INFO ] Removed a total of 892 redundant transitions.
[2024-05-28 17:25:04] [INFO ] Flatten gal took : 328 ms
[2024-05-28 17:25:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 300 labels/synchronizations in 64 ms.
[2024-05-28 17:25:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality11645459118440809176.gal : 22 ms
[2024-05-28 17:25:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality12805082865321160887.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/CTLCardinality11645459118440809176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12805082865321160887.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 84 place count 496 transition count 1294
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 144 place count 466 transition count 1294
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 276 place count 400 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 278 place count 398 transition count 1226
Iterating global reduction 2 with 2 rules applied. Total rules applied 280 place count 398 transition count 1226
Applied a total of 280 rules in 258 ms. Remains 398 /538 variables (removed 140) and now considering 1226/1366 (removed 140) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-28 17:25:35] [INFO ] Flow matrix only has 1202 transitions (discarded 24 similar events)
// Phase 1: matrix 1202 rows 398 cols
[2024-05-28 17:25:35] [INFO ] Computed 40 invariants in 29 ms
[2024-05-28 17:25:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-28 17:25:48] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 2 ms to minimize.
[2024-05-28 17:25:49] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1222 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 394/1600 variables, and 35 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-28 17:26:03] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:26:03] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:26:03] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:26:03] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-28 17:26:13] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2024-05-28 17:26:13] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1600 variables, and 41 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 8/8 constraints]
After SMT, in 44591ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 44609ms
[2024-05-28 17:26:20] [INFO ] Flow matrix only has 1202 transitions (discarded 24 similar events)
[2024-05-28 17:26:20] [INFO ] Invariant cache hit.
[2024-05-28 17:26:20] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-28 17:26:20] [INFO ] Flow matrix only has 1202 transitions (discarded 24 similar events)
[2024-05-28 17:26:20] [INFO ] Invariant cache hit.
[2024-05-28 17:26:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:26:27] [INFO ] Implicit Places using invariants and state equation in 7016 ms returned []
Implicit Place search using SMT with State Equation took 7368 ms to find 0 implicit places.
[2024-05-28 17:26:27] [INFO ] Redundant transitions in 120 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-28 17:26:27] [INFO ] Flow matrix only has 1202 transitions (discarded 24 similar events)
[2024-05-28 17:26:27] [INFO ] Invariant cache hit.
[2024-05-28 17:26:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-28 17:26:39] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2024-05-28 17:26:40] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 35070ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 35087ms
Starting structural reductions in SI_CTL mode, iteration 1 : 398/538 places, 1226/1366 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 87457 ms. Remains : 398/538 places, 1226/1366 transitions.
[2024-05-28 17:27:02] [INFO ] Flatten gal took : 70 ms
[2024-05-28 17:27:02] [INFO ] Flatten gal took : 94 ms
[2024-05-28 17:27:03] [INFO ] Input system was already deterministic with 1226 transitions.
[2024-05-28 17:27:03] [INFO ] Flatten gal took : 69 ms
[2024-05-28 17:27:03] [INFO ] Flatten gal took : 64 ms
[2024-05-28 17:27:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality14741352166765912648.gal : 8 ms
[2024-05-28 17:27:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality7953667011065532891.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/CTLCardinality14741352166765912648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7953667011065532891.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 17:27:33] [INFO ] Flatten gal took : 89 ms
[2024-05-28 17:27:33] [INFO ] Applying decomposition
[2024-05-28 17:27:33] [INFO ] Flatten gal took : 65 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/graph15950853901413789534.txt' '-o' '/tmp/graph15950853901413789534.bin' '-w' '/tmp/graph15950853901413789534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15950853901413789534.bin' '-l' '-1' '-v' '-w' '/tmp/graph15950853901413789534.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:27:33] [INFO ] Decomposing Gal with order
[2024-05-28 17:27:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:27:33] [INFO ] Removed a total of 830 redundant transitions.
[2024-05-28 17:27:33] [INFO ] Flatten gal took : 180 ms
[2024-05-28 17:27:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 371 labels/synchronizations in 44 ms.
[2024-05-28 17:27:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality3841142098625031202.gal : 32 ms
[2024-05-28 17:27:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality6132300195133037651.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/CTLCardinality3841142098625031202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6132300195133037651.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 538 transition count 1342
Reduce places removed 24 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 54 place count 514 transition count 1336
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 508 transition count 1336
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 60 place count 508 transition count 1276
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 180 place count 448 transition count 1276
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 4 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 312 place count 382 transition count 1210
Applied a total of 312 rules in 81 ms. Remains 382 /538 variables (removed 156) and now considering 1210/1366 (removed 156) transitions.
Running 1206 sub problems to find dead transitions.
[2024-05-28 17:28:04] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
// Phase 1: matrix 1186 rows 382 cols
[2024-05-28 17:28:04] [INFO ] Computed 40 invariants in 41 ms
[2024-05-28 17:28:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 17:28:15] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 2 ms to minimize.
[2024-05-28 17:28:15] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 1 ms to minimize.
[2024-05-28 17:28:16] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-05-28 17:28:16] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 3 ms to minimize.
[2024-05-28 17:28:16] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 2 ms to minimize.
[2024-05-28 17:28:24] [INFO ] Deduced a trap composed of 132 places in 236 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 17:28:27] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 42 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 17:28:31] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:28:31] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:28:31] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 0 ms to minimize.
[2024-05-28 17:28:32] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:28:37] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:28:42] [INFO ] Deduced a trap composed of 115 places in 296 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 17:28:45] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 49 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 14/14 constraints]
After SMT, in 44695ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 44710ms
[2024-05-28 17:28:49] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 17:28:49] [INFO ] Invariant cache hit.
[2024-05-28 17:28:49] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-28 17:28:49] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 17:28:49] [INFO ] Invariant cache hit.
[2024-05-28 17:28:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:28:55] [INFO ] Implicit Places using invariants and state equation in 6413 ms returned []
Implicit Place search using SMT with State Equation took 6830 ms to find 0 implicit places.
[2024-05-28 17:28:56] [INFO ] Redundant transitions in 70 ms returned []
Running 1206 sub problems to find dead transitions.
[2024-05-28 17:28:56] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
[2024-05-28 17:28:56] [INFO ] Invariant cache hit.
[2024-05-28 17:28:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 17:29:07] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 1 ms to minimize.
[2024-05-28 17:29:07] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 2 ms to minimize.
[2024-05-28 17:29:07] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-05-28 17:29:08] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 3 ms to minimize.
[2024-05-28 17:29:08] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 2 ms to minimize.
[2024-05-28 17:29:08] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 2 ms to minimize.
[2024-05-28 17:29:08] [INFO ] Deduced a trap composed of 87 places in 233 ms of which 2 ms to minimize.
[2024-05-28 17:29:09] [INFO ] Deduced a trap composed of 116 places in 223 ms of which 2 ms to minimize.
[2024-05-28 17:29:09] [INFO ] Deduced a trap composed of 74 places in 253 ms of which 3 ms to minimize.
[2024-05-28 17:29:09] [INFO ] Deduced a trap composed of 67 places in 232 ms of which 4 ms to minimize.
[2024-05-28 17:29:10] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:29:17] [INFO ] Deduced a trap composed of 132 places in 160 ms of which 2 ms to minimize.
[2024-05-28 17:29:17] [INFO ] Deduced a trap composed of 115 places in 180 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 17:29:27] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 49 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 17:29:35] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 2 ms to minimize.
[2024-05-28 17:29:35] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:29:35] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:29:35] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:29:36] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 17:29:44] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 55 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 20/20 constraints]
After SMT, in 64865ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 64882ms
Starting structural reductions in SI_CTL mode, iteration 1 : 382/538 places, 1210/1366 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 116591 ms. Remains : 382/538 places, 1210/1366 transitions.
[2024-05-28 17:30:00] [INFO ] Flatten gal took : 40 ms
[2024-05-28 17:30:01] [INFO ] Flatten gal took : 43 ms
[2024-05-28 17:30:01] [INFO ] Input system was already deterministic with 1210 transitions.
RANDOM walk for 336 steps (0 resets) in 9 ms. (33 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 17:30:01] [INFO ] Flatten gal took : 83 ms
[2024-05-28 17:30:01] [INFO ] Flatten gal took : 57 ms
[2024-05-28 17:30:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7278437280533890131.gal : 8 ms
[2024-05-28 17:30:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2939894421533561308.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7278437280533890131.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2939894421533561308.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 1360
Applied a total of 12 rules in 50 ms. Remains 532 /538 variables (removed 6) and now considering 1360/1366 (removed 6) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 17:30:01] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-28 17:30:01] [INFO ] Computed 40 invariants in 42 ms
[2024-05-28 17:30:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:30:15] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 2 ms to minimize.
[2024-05-28 17:30:16] [INFO ] Deduced a trap composed of 139 places in 346 ms of which 4 ms to minimize.
[2024-05-28 17:30:16] [INFO ] Deduced a trap composed of 304 places in 336 ms of which 3 ms to minimize.
[2024-05-28 17:30:16] [INFO ] Deduced a trap composed of 278 places in 321 ms of which 4 ms to minimize.
[2024-05-28 17:30:17] [INFO ] Deduced a trap composed of 258 places in 302 ms of which 4 ms to minimize.
[2024-05-28 17:30:17] [INFO ] Deduced a trap composed of 286 places in 272 ms of which 5 ms to minimize.
[2024-05-28 17:30:18] [INFO ] Deduced a trap composed of 299 places in 306 ms of which 4 ms to minimize.
[2024-05-28 17:30:18] [INFO ] Deduced a trap composed of 253 places in 306 ms of which 4 ms to minimize.
[2024-05-28 17:30:19] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-05-28 17:30:19] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 1 ms to minimize.
[2024-05-28 17:30:19] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 2 ms to minimize.
[2024-05-28 17:30:21] [INFO ] Deduced a trap composed of 289 places in 247 ms of which 3 ms to minimize.
[2024-05-28 17:30:22] [INFO ] Deduced a trap composed of 348 places in 263 ms of which 3 ms to minimize.
[2024-05-28 17:30:22] [INFO ] Deduced a trap composed of 291 places in 281 ms of which 3 ms to minimize.
[2024-05-28 17:30:23] [INFO ] Deduced a trap composed of 42 places in 334 ms of which 3 ms to minimize.
[2024-05-28 17:30:24] [INFO ] Deduced a trap composed of 321 places in 334 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:30:34] [INFO ] Deduced a trap composed of 344 places in 333 ms of which 4 ms to minimize.
[2024-05-28 17:30:40] [INFO ] Deduced a trap composed of 5 places in 356 ms of which 4 ms to minimize.
[2024-05-28 17:30:40] [INFO ] Deduced a trap composed of 3 places in 330 ms of which 4 ms to minimize.
[2024-05-28 17:30:40] [INFO ] Deduced a trap composed of 5 places in 346 ms of which 4 ms to minimize.
[2024-05-28 17:30:41] [INFO ] Deduced a trap composed of 74 places in 348 ms of which 3 ms to minimize.
[2024-05-28 17:30:41] [INFO ] Deduced a trap composed of 28 places in 329 ms of which 4 ms to minimize.
[2024-05-28 17:30:42] [INFO ] Deduced a trap composed of 28 places in 324 ms of which 4 ms to minimize.
[2024-05-28 17:30:42] [INFO ] Deduced a trap composed of 303 places in 291 ms of which 3 ms to minimize.
[2024-05-28 17:30:42] [INFO ] Deduced a trap composed of 75 places in 274 ms of which 3 ms to minimize.
[2024-05-28 17:30:42] [INFO ] Deduced a trap composed of 74 places in 301 ms of which 3 ms to minimize.
[2024-05-28 17:30:43] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 0 ms to minimize.
[2024-05-28 17:30:43] [INFO ] Deduced a trap composed of 317 places in 395 ms of which 4 ms to minimize.
[2024-05-28 17:30:43] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:30:44] [INFO ] Deduced a trap composed of 342 places in 412 ms of which 4 ms to minimize.
[2024-05-28 17:30:45] [INFO ] Deduced a trap composed of 314 places in 396 ms of which 3 ms to minimize.
[2024-05-28 17:30:45] [INFO ] Deduced a trap composed of 310 places in 352 ms of which 3 ms to minimize.
[2024-05-28 17:30:45] [INFO ] Deduced a trap composed of 337 places in 286 ms of which 3 ms to minimize.
SMT process timed out in 44550ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44567ms
[2024-05-28 17:30:45] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:30:45] [INFO ] Invariant cache hit.
[2024-05-28 17:30:46] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-28 17:30:46] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:30:46] [INFO ] Invariant cache hit.
[2024-05-28 17:30:47] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:30:55] [INFO ] Implicit Places using invariants and state equation in 8938 ms returned []
Implicit Place search using SMT with State Equation took 9447 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-28 17:30:55] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 17:30:55] [INFO ] Invariant cache hit.
[2024-05-28 17:30:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:31:10] [INFO ] Deduced a trap composed of 142 places in 275 ms of which 4 ms to minimize.
[2024-05-28 17:31:10] [INFO ] Deduced a trap composed of 304 places in 319 ms of which 3 ms to minimize.
[2024-05-28 17:31:11] [INFO ] Deduced a trap composed of 323 places in 289 ms of which 4 ms to minimize.
[2024-05-28 17:31:11] [INFO ] Deduced a trap composed of 262 places in 258 ms of which 4 ms to minimize.
[2024-05-28 17:31:11] [INFO ] Deduced a trap composed of 280 places in 256 ms of which 4 ms to minimize.
[2024-05-28 17:31:12] [INFO ] Deduced a trap composed of 286 places in 226 ms of which 3 ms to minimize.
[2024-05-28 17:31:12] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 2 ms to minimize.
[2024-05-28 17:31:13] [INFO ] Deduced a trap composed of 283 places in 275 ms of which 3 ms to minimize.
[2024-05-28 17:31:13] [INFO ] Deduced a trap composed of 267 places in 256 ms of which 3 ms to minimize.
[2024-05-28 17:31:13] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 2 ms to minimize.
[2024-05-28 17:31:13] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 2 ms to minimize.
[2024-05-28 17:31:13] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 2 ms to minimize.
[2024-05-28 17:31:14] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 2 ms to minimize.
[2024-05-28 17:31:14] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 2 ms to minimize.
[2024-05-28 17:31:16] [INFO ] Deduced a trap composed of 291 places in 286 ms of which 5 ms to minimize.
[2024-05-28 17:31:17] [INFO ] Deduced a trap composed of 42 places in 330 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 17:31:39] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 4 ms to minimize.
[2024-05-28 17:31:40] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 4 ms to minimize.
[2024-05-28 17:31:40] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 4 ms to minimize.
[2024-05-28 17:31:40] [INFO ] Deduced a trap composed of 74 places in 332 ms of which 3 ms to minimize.
[2024-05-28 17:31:41] [INFO ] Deduced a trap composed of 28 places in 327 ms of which 3 ms to minimize.
[2024-05-28 17:31:41] [INFO ] Deduced a trap composed of 74 places in 281 ms of which 2 ms to minimize.
[2024-05-28 17:31:41] [INFO ] Deduced a trap composed of 301 places in 279 ms of which 3 ms to minimize.
[2024-05-28 17:31:42] [INFO ] Deduced a trap composed of 28 places in 339 ms of which 4 ms to minimize.
[2024-05-28 17:31:42] [INFO ] Deduced a trap composed of 74 places in 355 ms of which 3 ms to minimize.
[2024-05-28 17:31:42] [INFO ] Deduced a trap composed of 74 places in 291 ms of which 3 ms to minimize.
[2024-05-28 17:31:43] [INFO ] Deduced a trap composed of 341 places in 278 ms of which 3 ms to minimize.
[2024-05-28 17:31:43] [INFO ] Deduced a trap composed of 350 places in 253 ms of which 4 ms to minimize.
[2024-05-28 17:31:43] [INFO ] Deduced a trap composed of 338 places in 352 ms of which 4 ms to minimize.
[2024-05-28 17:31:44] [INFO ] Deduced a trap composed of 325 places in 331 ms of which 3 ms to minimize.
[2024-05-28 17:31:44] [INFO ] Deduced a trap composed of 292 places in 355 ms of which 4 ms to minimize.
[2024-05-28 17:31:44] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:31:46] [INFO ] Deduced a trap composed of 357 places in 392 ms of which 4 ms to minimize.
[2024-05-28 17:31:47] [INFO ] Deduced a trap composed of 98 places in 340 ms of which 3 ms to minimize.
[2024-05-28 17:31:47] [INFO ] Deduced a trap composed of 352 places in 371 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 62 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 35/35 constraints]
After SMT, in 64726ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 64738ms
Starting structural reductions in LTL mode, iteration 1 : 532/538 places, 1360/1366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118812 ms. Remains : 532/538 places, 1360/1366 transitions.
[2024-05-28 17:32:00] [INFO ] Flatten gal took : 41 ms
[2024-05-28 17:32:00] [INFO ] Flatten gal took : 44 ms
[2024-05-28 17:32:00] [INFO ] Input system was already deterministic with 1360 transitions.
[2024-05-28 17:32:00] [INFO ] Flatten gal took : 44 ms
[2024-05-28 17:32:00] [INFO ] Flatten gal took : 39 ms
[2024-05-28 17:32:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality11006459807520683528.gal : 7 ms
[2024-05-28 17:32:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality9235358155251198736.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/CTLCardinality11006459807520683528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9235358155251198736.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 17:32:30] [INFO ] Flatten gal took : 83 ms
[2024-05-28 17:32:30] [INFO ] Applying decomposition
[2024-05-28 17:32:30] [INFO ] Flatten gal took : 59 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/graph12914571995051046560.txt' '-o' '/tmp/graph12914571995051046560.bin' '-w' '/tmp/graph12914571995051046560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12914571995051046560.bin' '-l' '-1' '-v' '-w' '/tmp/graph12914571995051046560.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:32:30] [INFO ] Decomposing Gal with order
[2024-05-28 17:32:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:32:30] [INFO ] Removed a total of 934 redundant transitions.
[2024-05-28 17:32:30] [INFO ] Flatten gal took : 115 ms
[2024-05-28 17:32:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 642 labels/synchronizations in 36 ms.
[2024-05-28 17:32:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality11151881273431626504.gal : 13 ms
[2024-05-28 17:32:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality16798743472937685192.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/CTLCardinality11151881273431626504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16798743472937685192.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 436 transition count 1264
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 3 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 334 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 369 transition count 1197
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 369 transition count 1197
Applied a total of 338 rules in 132 ms. Remains 369 /538 variables (removed 169) and now considering 1197/1366 (removed 169) transitions.
Running 1193 sub problems to find dead transitions.
[2024-05-28 17:33:01] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-05-28 17:33:01] [INFO ] Computed 40 invariants in 42 ms
[2024-05-28 17:33:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 0 ms to minimize.
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:33:12] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2024-05-28 17:33:13] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 2 ms to minimize.
[2024-05-28 17:33:13] [INFO ] Deduced a trap composed of 38 places in 271 ms of which 3 ms to minimize.
[2024-05-28 17:33:14] [INFO ] Deduced a trap composed of 128 places in 290 ms of which 3 ms to minimize.
[2024-05-28 17:33:14] [INFO ] Deduced a trap composed of 138 places in 255 ms of which 2 ms to minimize.
[2024-05-28 17:33:14] [INFO ] Deduced a trap composed of 47 places in 261 ms of which 3 ms to minimize.
[2024-05-28 17:33:15] [INFO ] Deduced a trap composed of 156 places in 234 ms of which 3 ms to minimize.
[2024-05-28 17:33:15] [INFO ] Deduced a trap composed of 160 places in 242 ms of which 2 ms to minimize.
[2024-05-28 17:33:16] [INFO ] Deduced a trap composed of 123 places in 248 ms of which 2 ms to minimize.
[2024-05-28 17:33:18] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 2 ms to minimize.
[2024-05-28 17:33:23] [INFO ] Deduced a trap composed of 163 places in 283 ms of which 2 ms to minimize.
[2024-05-28 17:33:23] [INFO ] Deduced a trap composed of 175 places in 298 ms of which 2 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 137 places in 263 ms of which 2 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 121 places in 272 ms of which 2 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 212 places in 233 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:33:25] [INFO ] Deduced a trap composed of 56 places in 240 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 57 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:33:31] [INFO ] Deduced a trap composed of 178 places in 329 ms of which 2 ms to minimize.
[2024-05-28 17:33:31] [INFO ] Deduced a trap composed of 156 places in 336 ms of which 3 ms to minimize.
[2024-05-28 17:33:35] [INFO ] Deduced a trap composed of 179 places in 253 ms of which 2 ms to minimize.
[2024-05-28 17:33:44] [INFO ] Deduced a trap composed of 140 places in 284 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 61 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 25/25 constraints]
After SMT, in 44930ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 44943ms
[2024-05-28 17:33:46] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:33:46] [INFO ] Invariant cache hit.
[2024-05-28 17:33:46] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-05-28 17:33:46] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:33:46] [INFO ] Invariant cache hit.
[2024-05-28 17:33:47] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:33:53] [INFO ] Implicit Places using invariants and state equation in 6840 ms returned []
Implicit Place search using SMT with State Equation took 7345 ms to find 0 implicit places.
[2024-05-28 17:33:53] [INFO ] Redundant transitions in 27 ms returned []
Running 1193 sub problems to find dead transitions.
[2024-05-28 17:33:53] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:33:53] [INFO ] Invariant cache hit.
[2024-05-28 17:33:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:34:03] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 3 ms to minimize.
[2024-05-28 17:34:03] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 0 ms to minimize.
[2024-05-28 17:34:03] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 0 ms to minimize.
[2024-05-28 17:34:03] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:34:03] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:34:04] [INFO ] Deduced a trap composed of 27 places in 291 ms of which 3 ms to minimize.
[2024-05-28 17:34:04] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 2 ms to minimize.
[2024-05-28 17:34:04] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 2 ms to minimize.
[2024-05-28 17:34:05] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 2 ms to minimize.
[2024-05-28 17:34:05] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 2 ms to minimize.
[2024-05-28 17:34:06] [INFO ] Deduced a trap composed of 137 places in 501 ms of which 3 ms to minimize.
[2024-05-28 17:34:07] [INFO ] Deduced a trap composed of 121 places in 295 ms of which 3 ms to minimize.
[2024-05-28 17:34:09] [INFO ] Deduced a trap composed of 211 places in 264 ms of which 3 ms to minimize.
[2024-05-28 17:34:09] [INFO ] Deduced a trap composed of 216 places in 226 ms of which 2 ms to minimize.
[2024-05-28 17:34:09] [INFO ] Deduced a trap composed of 193 places in 234 ms of which 3 ms to minimize.
[2024-05-28 17:34:10] [INFO ] Deduced a trap composed of 116 places in 244 ms of which 2 ms to minimize.
[2024-05-28 17:34:12] [INFO ] Deduced a trap composed of 165 places in 269 ms of which 3 ms to minimize.
[2024-05-28 17:34:16] [INFO ] Deduced a trap composed of 147 places in 248 ms of which 4 ms to minimize.
[2024-05-28 17:34:17] [INFO ] Deduced a trap composed of 173 places in 268 ms of which 3 ms to minimize.
[2024-05-28 17:34:17] [INFO ] Deduced a trap composed of 172 places in 252 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:34:26] [INFO ] Deduced a trap composed of 164 places in 295 ms of which 3 ms to minimize.
[2024-05-28 17:34:27] [INFO ] Deduced a trap composed of 114 places in 248 ms of which 3 ms to minimize.
[2024-05-28 17:34:27] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 59 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:34:33] [INFO ] Deduced a trap composed of 168 places in 299 ms of which 2 ms to minimize.
[2024-05-28 17:34:33] [INFO ] Deduced a trap composed of 179 places in 299 ms of which 3 ms to minimize.
[2024-05-28 17:34:36] [INFO ] Deduced a trap composed of 179 places in 259 ms of which 3 ms to minimize.
[2024-05-28 17:34:48] [INFO ] Deduced a trap composed of 146 places in 303 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 63 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 27/27 constraints]
After SMT, in 64288ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 64303ms
Starting structural reductions in SI_CTL mode, iteration 1 : 369/538 places, 1197/1366 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 116765 ms. Remains : 369/538 places, 1197/1366 transitions.
[2024-05-28 17:34:58] [INFO ] Flatten gal took : 36 ms
[2024-05-28 17:34:58] [INFO ] Flatten gal took : 38 ms
[2024-05-28 17:34:58] [INFO ] Input system was already deterministic with 1197 transitions.
[2024-05-28 17:34:58] [INFO ] Flatten gal took : 40 ms
[2024-05-28 17:34:58] [INFO ] Flatten gal took : 39 ms
[2024-05-28 17:34:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality17606541155548687688.gal : 6 ms
[2024-05-28 17:34:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality5564386778692271115.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/CTLCardinality17606541155548687688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5564386778692271115.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 17:35:28] [INFO ] Flatten gal took : 88 ms
[2024-05-28 17:35:28] [INFO ] Applying decomposition
[2024-05-28 17:35:28] [INFO ] Flatten gal took : 64 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/graph2198859975049743657.txt' '-o' '/tmp/graph2198859975049743657.bin' '-w' '/tmp/graph2198859975049743657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2198859975049743657.bin' '-l' '-1' '-v' '-w' '/tmp/graph2198859975049743657.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:35:28] [INFO ] Decomposing Gal with order
[2024-05-28 17:35:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:35:28] [INFO ] Removed a total of 527 redundant transitions.
[2024-05-28 17:35:28] [INFO ] Flatten gal took : 135 ms
[2024-05-28 17:35:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 444 labels/synchronizations in 12 ms.
[2024-05-28 17:35:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality1485244192498656957.gal : 6 ms
[2024-05-28 17:35:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality5040962913202366425.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/CTLCardinality1485244192498656957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5040962913202366425.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 538 transition count 1325
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 497 transition count 1324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 84 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 204 place count 436 transition count 1264
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 334 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 336 place count 369 transition count 1197
Iterating global reduction 3 with 2 rules applied. Total rules applied 338 place count 369 transition count 1197
Applied a total of 338 rules in 127 ms. Remains 369 /538 variables (removed 169) and now considering 1197/1366 (removed 169) transitions.
Running 1193 sub problems to find dead transitions.
[2024-05-28 17:35:59] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-05-28 17:35:59] [INFO ] Computed 40 invariants in 33 ms
[2024-05-28 17:35:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:36:10] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:36:10] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:36:10] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:36:10] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:36:10] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:36:10] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 2 ms to minimize.
[2024-05-28 17:36:10] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:36:10] [INFO ] Deduced a trap composed of 149 places in 259 ms of which 2 ms to minimize.
[2024-05-28 17:36:11] [INFO ] Deduced a trap composed of 140 places in 275 ms of which 3 ms to minimize.
[2024-05-28 17:36:11] [INFO ] Deduced a trap composed of 143 places in 287 ms of which 3 ms to minimize.
[2024-05-28 17:36:11] [INFO ] Deduced a trap composed of 146 places in 267 ms of which 2 ms to minimize.
[2024-05-28 17:36:12] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 2 ms to minimize.
[2024-05-28 17:36:12] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 2 ms to minimize.
[2024-05-28 17:36:13] [INFO ] Deduced a trap composed of 60 places in 297 ms of which 2 ms to minimize.
[2024-05-28 17:36:14] [INFO ] Deduced a trap composed of 121 places in 232 ms of which 3 ms to minimize.
[2024-05-28 17:36:22] [INFO ] Deduced a trap composed of 148 places in 310 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 52 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:36:31] [INFO ] Deduced a trap composed of 184 places in 257 ms of which 3 ms to minimize.
[2024-05-28 17:36:32] [INFO ] Deduced a trap composed of 139 places in 222 ms of which 2 ms to minimize.
[2024-05-28 17:36:33] [INFO ] Deduced a trap composed of 147 places in 256 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 55 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 19/19 constraints]
After SMT, in 44887ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 44900ms
[2024-05-28 17:36:44] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:36:44] [INFO ] Invariant cache hit.
[2024-05-28 17:36:44] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-28 17:36:44] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:36:44] [INFO ] Invariant cache hit.
[2024-05-28 17:36:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:36:51] [INFO ] Implicit Places using invariants and state equation in 7377 ms returned []
Implicit Place search using SMT with State Equation took 7866 ms to find 0 implicit places.
[2024-05-28 17:36:51] [INFO ] Redundant transitions in 51 ms returned []
Running 1193 sub problems to find dead transitions.
[2024-05-28 17:36:51] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:36:51] [INFO ] Invariant cache hit.
[2024-05-28 17:36:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:37:03] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2024-05-28 17:37:03] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-28 17:37:03] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:37:03] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-05-28 17:37:03] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-05-28 17:37:03] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 2 ms to minimize.
[2024-05-28 17:37:04] [INFO ] Deduced a trap composed of 114 places in 228 ms of which 2 ms to minimize.
[2024-05-28 17:37:04] [INFO ] Deduced a trap composed of 140 places in 258 ms of which 3 ms to minimize.
[2024-05-28 17:37:04] [INFO ] Deduced a trap composed of 151 places in 234 ms of which 2 ms to minimize.
[2024-05-28 17:37:05] [INFO ] Deduced a trap composed of 138 places in 229 ms of which 3 ms to minimize.
[2024-05-28 17:37:05] [INFO ] Deduced a trap composed of 150 places in 199 ms of which 2 ms to minimize.
[2024-05-28 17:37:05] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 0 ms to minimize.
[2024-05-28 17:37:05] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 2 ms to minimize.
[2024-05-28 17:37:06] [INFO ] Deduced a trap composed of 134 places in 261 ms of which 3 ms to minimize.
[2024-05-28 17:37:06] [INFO ] Deduced a trap composed of 62 places in 271 ms of which 3 ms to minimize.
[2024-05-28 17:37:07] [INFO ] Deduced a trap composed of 139 places in 266 ms of which 3 ms to minimize.
[2024-05-28 17:37:08] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 2 ms to minimize.
[2024-05-28 17:37:09] [INFO ] Deduced a trap composed of 121 places in 244 ms of which 3 ms to minimize.
[2024-05-28 17:37:10] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 2 ms to minimize.
[2024-05-28 17:37:16] [INFO ] Deduced a trap composed of 160 places in 259 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:37:23] [INFO ] Deduced a trap composed of 178 places in 256 ms of which 2 ms to minimize.
[2024-05-28 17:37:24] [INFO ] Deduced a trap composed of 162 places in 235 ms of which 3 ms to minimize.
[2024-05-28 17:37:24] [INFO ] Deduced a trap composed of 191 places in 284 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 9.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 3.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 1.0)
(s25 0.0)
(s26 1.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 1.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 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 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 1.0)
(s68 0.0)
(s69 0.0)
(s70 (/ 1.0 3.0))
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 (/ 11.0 2.0))
(s82 0.0)
(s83 0.0)
(s84 (/ 7.0 4.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 1.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 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 (/ 2.0 3.0))
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.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 (/ 1.0 3.0))
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s223 0.0)
(s224 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 59 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:37:33] [INFO ] Deduced a trap composed of 130 places in 292 ms of which 3 ms to minimize.
[2024-05-28 17:37:36] [INFO ] Deduced a trap composed of 184 places in 261 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 61 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 25/25 constraints]
After SMT, in 65091ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 65109ms
Starting structural reductions in SI_CTL mode, iteration 1 : 369/538 places, 1197/1366 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 118072 ms. Remains : 369/538 places, 1197/1366 transitions.
[2024-05-28 17:37:57] [INFO ] Flatten gal took : 72 ms
[2024-05-28 17:37:57] [INFO ] Flatten gal took : 58 ms
[2024-05-28 17:37:57] [INFO ] Input system was already deterministic with 1197 transitions.
[2024-05-28 17:37:57] [INFO ] Flatten gal took : 88 ms
[2024-05-28 17:37:57] [INFO ] Flatten gal took : 61 ms
[2024-05-28 17:37:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality16688548378856217212.gal : 8 ms
[2024-05-28 17:37:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality17133225241961299749.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/CTLCardinality16688548378856217212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17133225241961299749.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 17:38:27] [INFO ] Flatten gal took : 87 ms
[2024-05-28 17:38:27] [INFO ] Applying decomposition
[2024-05-28 17:38:27] [INFO ] Flatten gal took : 62 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/graph16412117207365252302.txt' '-o' '/tmp/graph16412117207365252302.bin' '-w' '/tmp/graph16412117207365252302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16412117207365252302.bin' '-l' '-1' '-v' '-w' '/tmp/graph16412117207365252302.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:38:27] [INFO ] Decomposing Gal with order
[2024-05-28 17:38:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:38:27] [INFO ] Removed a total of 572 redundant transitions.
[2024-05-28 17:38:27] [INFO ] Flatten gal took : 101 ms
[2024-05-28 17:38:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 269 labels/synchronizations in 7 ms.
[2024-05-28 17:38:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality2546253610262087576.gal : 10 ms
[2024-05-28 17:38:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality16315676222244950336.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/CTLCardinality2546253610262087576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16315676222244950336.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 84 place count 496 transition count 1265
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 202 place count 437 transition count 1265
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 334 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 369 transition count 1197
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 369 transition count 1197
Applied a total of 338 rules in 64 ms. Remains 369 /538 variables (removed 169) and now considering 1197/1366 (removed 169) transitions.
Running 1193 sub problems to find dead transitions.
[2024-05-28 17:38:58] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-05-28 17:38:58] [INFO ] Computed 40 invariants in 27 ms
[2024-05-28 17:38:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:39:09] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:39:09] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-05-28 17:39:10] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 2 ms to minimize.
[2024-05-28 17:39:10] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 2 ms to minimize.
[2024-05-28 17:39:10] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 2 ms to minimize.
[2024-05-28 17:39:10] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 2 ms to minimize.
[2024-05-28 17:39:11] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 1 ms to minimize.
[2024-05-28 17:39:12] [INFO ] Deduced a trap composed of 27 places in 284 ms of which 1 ms to minimize.
[2024-05-28 17:39:17] [INFO ] Deduced a trap composed of 121 places in 211 ms of which 2 ms to minimize.
[2024-05-28 17:39:19] [INFO ] Deduced a trap composed of 108 places in 191 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 1193 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 365/1542 variables, and 45 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/24 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:39:24] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:39:24] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:39:24] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 0 ms to minimize.
[2024-05-28 17:39:25] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:39:26] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:39:26] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 9)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 1)
(s9 2)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)timeout

(s67 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 51 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/24 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 16/16 constraints]
After SMT, in 44782ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 44793ms
[2024-05-28 17:39:42] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:39:42] [INFO ] Invariant cache hit.
[2024-05-28 17:39:43] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-28 17:39:43] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:39:43] [INFO ] Invariant cache hit.
[2024-05-28 17:39:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:39:53] [INFO ] Implicit Places using invariants and state equation in 10308 ms returned []
Implicit Place search using SMT with State Equation took 10760 ms to find 0 implicit places.
[2024-05-28 17:39:53] [INFO ] Redundant transitions in 49 ms returned []
Running 1193 sub problems to find dead transitions.
[2024-05-28 17:39:53] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:39:53] [INFO ] Invariant cache hit.
[2024-05-28 17:39:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:40:04] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 1 ms to minimize.
[2024-05-28 17:40:05] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-05-28 17:40:05] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 2 ms to minimize.
[2024-05-28 17:40:05] [INFO ] Deduced a trap composed of 55 places in 226 ms of which 2 ms to minimize.
[2024-05-28 17:40:13] [INFO ] Deduced a trap composed of 122 places in 185 ms of which 2 ms to minimize.
[2024-05-28 17:40:13] [INFO ] Deduced a trap composed of 121 places in 201 ms of which 1 ms to minimize.
[2024-05-28 17:40:14] [INFO ] Deduced a trap composed of 103 places in 232 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:40:16] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 43 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/24 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:40:31] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2024-05-28 17:40:31] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:40:31] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:40:33] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:40:34] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
At refinement iteration 5 (OVERLAPS) 4/369 variables, 5/53 constraints. Problems are: Problem set: 26 solved, 1167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/1542 variables, and 53 constraints, problems are : Problem set: 26 solved, 1167 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 13/13 constraints]
After SMT, in 64631ms problems are : Problem set: 26 solved, 1167 unsolved
Search for dead transitions found 26 dead transitions in 64652ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 369/538 places, 1171/1366 transitions.
Applied a total of 0 rules in 26 ms. Remains 369 /369 variables (removed 0) and now considering 1171/1171 (removed 0) transitions.
[2024-05-28 17:40:58] [INFO ] Redundant transitions in 20 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 120389 ms. Remains : 369/538 places, 1171/1366 transitions.
[2024-05-28 17:40:58] [INFO ] Flatten gal took : 40 ms
[2024-05-28 17:40:58] [INFO ] Flatten gal took : 43 ms
[2024-05-28 17:40:58] [INFO ] Input system was already deterministic with 1171 transitions.
[2024-05-28 17:40:58] [INFO ] Flatten gal took : 52 ms
[2024-05-28 17:40:58] [INFO ] Flatten gal took : 53 ms
[2024-05-28 17:40:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality18414035828011533849.gal : 8 ms
[2024-05-28 17:40:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality505571832720481116.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/CTLCardinality18414035828011533849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality505571832720481116.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 17:41:28] [INFO ] Flatten gal took : 81 ms
[2024-05-28 17:41:29] [INFO ] Applying decomposition
[2024-05-28 17:41:29] [INFO ] Flatten gal took : 59 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/graph2359099851207738401.txt' '-o' '/tmp/graph2359099851207738401.bin' '-w' '/tmp/graph2359099851207738401.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2359099851207738401.bin' '-l' '-1' '-v' '-w' '/tmp/graph2359099851207738401.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:41:29] [INFO ] Decomposing Gal with order
[2024-05-28 17:41:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:41:29] [INFO ] Removed a total of 508 redundant transitions.
[2024-05-28 17:41:29] [INFO ] Flatten gal took : 133 ms
[2024-05-28 17:41:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 10 ms.
[2024-05-28 17:41:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality8199636675898995173.gal : 9 ms
[2024-05-28 17:41:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality10985236077163399742.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/CTLCardinality8199636675898995173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10985236077163399742.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 538 transition count 1325
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 497 transition count 1325
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 82 place count 497 transition count 1266
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 200 place count 438 transition count 1266
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 326 place count 375 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 327 place count 374 transition count 1202
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 374 transition count 1202
Applied a total of 328 rules in 57 ms. Remains 374 /538 variables (removed 164) and now considering 1202/1366 (removed 164) transitions.
Running 1198 sub problems to find dead transitions.
[2024-05-28 17:41:59] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
// Phase 1: matrix 1178 rows 374 cols
[2024-05-28 17:41:59] [INFO ] Computed 40 invariants in 15 ms
[2024-05-28 17:41:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 17:42:11] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:42:11] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:42:11] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:42:11] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:42:11] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2024-05-28 17:42:12] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-05-28 17:42:12] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 2 ms to minimize.
[2024-05-28 17:42:13] [INFO ] Deduced a trap composed of 55 places in 224 ms of which 2 ms to minimize.
[2024-05-28 17:42:13] [INFO ] Deduced a trap composed of 82 places in 241 ms of which 2 ms to minimize.
[2024-05-28 17:42:13] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 2 ms to minimize.
[2024-05-28 17:42:14] [INFO ] Deduced a trap composed of 123 places in 281 ms of which 2 ms to minimize.
[2024-05-28 17:42:16] [INFO ] Deduced a trap composed of 120 places in 133 ms of which 1 ms to minimize.
[2024-05-28 17:42:22] [INFO ] Deduced a trap composed of 167 places in 275 ms of which 3 ms to minimize.
[2024-05-28 17:42:22] [INFO ] Deduced a trap composed of 157 places in 228 ms of which 2 ms to minimize.
[2024-05-28 17:42:22] [INFO ] Deduced a trap composed of 182 places in 231 ms of which 2 ms to minimize.
[2024-05-28 17:42:22] [INFO ] Deduced a trap composed of 176 places in 188 ms of which 2 ms to minimize.
[2024-05-28 17:42:23] [INFO ] Deduced a trap composed of 182 places in 222 ms of which 2 ms to minimize.
[2024-05-28 17:42:23] [INFO ] Deduced a trap composed of 178 places in 311 ms of which 2 ms to minimize.
[2024-05-28 17:42:23] [INFO ] Deduced a trap composed of 143 places in 209 ms of which 2 ms to minimize.
[2024-05-28 17:42:24] [INFO ] Deduced a trap composed of 175 places in 254 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1552 variables, and 56 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 17:42:29] [INFO ] Deduced a trap composed of 181 places in 223 ms of which 2 ms to minimize.
[2024-05-28 17:42:29] [INFO ] Deduced a trap composed of 186 places in 306 ms of which 2 ms to minimize.
[2024-05-28 17:42:30] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 2 ms to minimize.
[2024-05-28 17:42:30] [INFO ] Deduced a trap composed of 178 places in 236 ms of which 2 ms to minimize.
[2024-05-28 17:42:30] [INFO ] Deduced a trap composed of 212 places in 224 ms of which 2 ms to minimize.
[2024-05-28 17:42:30] [INFO ] Deduced a trap composed of 178 places in 215 ms of which 2 ms to minimize.
[2024-05-28 17:42:30] [INFO ] Deduced a trap composed of 207 places in 234 ms of which 2 ms to minimize.
[2024-05-28 17:42:31] [INFO ] Deduced a trap composed of 179 places in 233 ms of which 2 ms to minimize.
[2024-05-28 17:42:31] [INFO ] Deduced a trap composed of 186 places in 213 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1552 variables, and 65 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 29/29 constraints]
After SMT, in 45195ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 45208ms
[2024-05-28 17:42:44] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
[2024-05-28 17:42:44] [INFO ] Invariant cache hit.
[2024-05-28 17:42:45] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-28 17:42:45] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
[2024-05-28 17:42:45] [INFO ] Invariant cache hit.
[2024-05-28 17:42:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:42:51] [INFO ] Implicit Places using invariants and state equation in 6701 ms returned []
Implicit Place search using SMT with State Equation took 7058 ms to find 0 implicit places.
[2024-05-28 17:42:51] [INFO ] Redundant transitions in 44 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-28 17:42:52] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
[2024-05-28 17:42:52] [INFO ] Invariant cache hit.
[2024-05-28 17:42:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 17:43:03] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:43:03] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:43:03] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2024-05-28 17:43:03] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 0 ms to minimize.
[2024-05-28 17:43:03] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:43:03] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:43:03] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 3 ms to minimize.
[2024-05-28 17:43:04] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 3 ms to minimize.
[2024-05-28 17:43:04] [INFO ] Deduced a trap composed of 59 places in 273 ms of which 2 ms to minimize.
[2024-05-28 17:43:05] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 2 ms to minimize.
[2024-05-28 17:43:05] [INFO ] Deduced a trap composed of 135 places in 244 ms of which 3 ms to minimize.
[2024-05-28 17:43:05] [INFO ] Deduced a trap composed of 123 places in 254 ms of which 3 ms to minimize.
[2024-05-28 17:43:07] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 2 ms to minimize.
[2024-05-28 17:43:10] [INFO ] Deduced a trap composed of 186 places in 281 ms of which 2 ms to minimize.
[2024-05-28 17:43:11] [INFO ] Deduced a trap composed of 181 places in 237 ms of which 2 ms to minimize.
[2024-05-28 17:43:14] [INFO ] Deduced a trap composed of 172 places in 251 ms of which 2 ms to minimize.
[2024-05-28 17:43:14] [INFO ] Deduced a trap composed of 171 places in 263 ms of which 2 ms to minimize.
[2024-05-28 17:43:15] [INFO ] Deduced a trap composed of 174 places in 295 ms of which 3 ms to minimize.
[2024-05-28 17:43:15] [INFO ] Deduced a trap composed of 179 places in 297 ms of which 3 ms to minimize.
[2024-05-28 17:43:15] [INFO ] Deduced a trap composed of 179 places in 297 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 17:43:24] [INFO ] Deduced a trap composed of 174 places in 212 ms of which 3 ms to minimize.
[2024-05-28 17:43:24] [INFO ] Deduced a trap composed of 171 places in 217 ms of which 2 ms to minimize.
[2024-05-28 17:43:25] [INFO ] Deduced a trap composed of 196 places in 192 ms of which 3 ms to minimize.
[2024-05-28 17:43:25] [INFO ] Deduced a trap composed of 191 places in 224 ms of which 2 ms to minimize.
[2024-05-28 17:43:25] [INFO ] Deduced a trap composed of 168 places in 304 ms of which 2 ms to minimize.
[2024-05-28 17:43:26] [INFO ] Deduced a trap composed of 152 places in 267 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1552 variables, and 62 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 17:43:40] [INFO ] Deduced a trap composed of 137 places in 301 ms of which 3 ms to minimize.
[2024-05-28 17:43:55] [INFO ] Deduced a trap composed of 152 places in 221 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1552 variables, and 64 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 28/28 constraints]
After SMT, in 65382ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 65399ms
Starting structural reductions in SI_CTL mode, iteration 1 : 374/538 places, 1202/1366 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 117782 ms. Remains : 374/538 places, 1202/1366 transitions.
[2024-05-28 17:43:57] [INFO ] Flatten gal took : 67 ms
[2024-05-28 17:43:57] [INFO ] Flatten gal took : 56 ms
[2024-05-28 17:43:57] [INFO ] Input system was already deterministic with 1202 transitions.
[2024-05-28 17:43:57] [INFO ] Flatten gal took : 57 ms
[2024-05-28 17:43:57] [INFO ] Flatten gal took : 57 ms
[2024-05-28 17:43:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality4454461838256842309.gal : 9 ms
[2024-05-28 17:43:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality14229441869322634544.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/CTLCardinality4454461838256842309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14229441869322634544.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 17:44:27] [INFO ] Flatten gal took : 42 ms
[2024-05-28 17:44:27] [INFO ] Applying decomposition
[2024-05-28 17:44:27] [INFO ] Flatten gal took : 43 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/graph7693737247084600193.txt' '-o' '/tmp/graph7693737247084600193.bin' '-w' '/tmp/graph7693737247084600193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7693737247084600193.bin' '-l' '-1' '-v' '-w' '/tmp/graph7693737247084600193.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:44:28] [INFO ] Decomposing Gal with order
[2024-05-28 17:44:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:44:28] [INFO ] Removed a total of 484 redundant transitions.
[2024-05-28 17:44:28] [INFO ] Flatten gal took : 91 ms
[2024-05-28 17:44:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 6 ms.
[2024-05-28 17:44:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality15636127384301461276.gal : 6 ms
[2024-05-28 17:44:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality4427155364481519162.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/CTLCardinality15636127384301461276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4427155364481519162.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 436 transition count 1264
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 334 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 369 transition count 1197
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 369 transition count 1197
Applied a total of 338 rules in 56 ms. Remains 369 /538 variables (removed 169) and now considering 1197/1366 (removed 169) transitions.
Running 1193 sub problems to find dead transitions.
[2024-05-28 17:44:58] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-05-28 17:44:58] [INFO ] Computed 40 invariants in 33 ms
[2024-05-28 17:44:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:45:09] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:45:09] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:45:09] [INFO ] Deduced a trap composed of 48 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:45:10] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:45:10] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:45:10] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-05-28 17:45:10] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 2 ms to minimize.
[2024-05-28 17:45:10] [INFO ] Deduced a trap composed of 61 places in 214 ms of which 3 ms to minimize.
[2024-05-28 17:45:11] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 2 ms to minimize.
[2024-05-28 17:45:11] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 2 ms to minimize.
[2024-05-28 17:45:11] [INFO ] Deduced a trap composed of 139 places in 247 ms of which 3 ms to minimize.
[2024-05-28 17:45:12] [INFO ] Deduced a trap composed of 120 places in 252 ms of which 2 ms to minimize.
[2024-05-28 17:45:15] [INFO ] Deduced a trap composed of 149 places in 274 ms of which 2 ms to minimize.
[2024-05-28 17:45:19] [INFO ] Deduced a trap composed of 203 places in 248 ms of which 2 ms to minimize.
[2024-05-28 17:45:19] [INFO ] Deduced a trap composed of 179 places in 235 ms of which 3 ms to minimize.
[2024-05-28 17:45:20] [INFO ] Deduced a trap composed of 194 places in 229 ms of which 3 ms to minimize.
[2024-05-28 17:45:21] [INFO ] Deduced a trap composed of 137 places in 235 ms of which 3 ms to minimize.
[2024-05-28 17:45:21] [INFO ] Deduced a trap composed of 189 places in 322 ms of which 2 ms to minimize.
[2024-05-28 17:45:21] [INFO ] Deduced a trap composed of 173 places in 272 ms of which 3 ms to minimize.
[2024-05-28 17:45:21] [INFO ] Deduced a trap composed of 182 places in 275 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 56 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:45:30] [INFO ] Deduced a trap composed of 178 places in 282 ms of which 3 ms to minimize.
[2024-05-28 17:45:30] [INFO ] Deduced a trap composed of 172 places in 268 ms of which 3 ms to minimize.
[2024-05-28 17:45:30] [INFO ] Deduced a trap composed of 188 places in 291 ms of which 3 ms to minimize.
[2024-05-28 17:45:43] [INFO ] Deduced a trap composed of 134 places in 270 ms of which 2 ms to minimize.
SMT process timed out in 44707ms, After SMT, problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 44718ms
[2024-05-28 17:45:43] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:45:43] [INFO ] Invariant cache hit.
[2024-05-28 17:45:43] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-28 17:45:43] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:45:43] [INFO ] Invariant cache hit.
[2024-05-28 17:45:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:45:50] [INFO ] Implicit Places using invariants and state equation in 7198 ms returned []
Implicit Place search using SMT with State Equation took 7662 ms to find 0 implicit places.
[2024-05-28 17:45:50] [INFO ] Redundant transitions in 23 ms returned []
Running 1193 sub problems to find dead transitions.
[2024-05-28 17:45:50] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 17:45:50] [INFO ] Invariant cache hit.
[2024-05-28 17:45:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:46:01] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:46:01] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:46:01] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:46:01] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:46:01] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-05-28 17:46:01] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:46:02] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 2 ms to minimize.
[2024-05-28 17:46:02] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 2 ms to minimize.
[2024-05-28 17:46:02] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 1 ms to minimize.
[2024-05-28 17:46:03] [INFO ] Deduced a trap composed of 122 places in 241 ms of which 3 ms to minimize.
[2024-05-28 17:46:03] [INFO ] Deduced a trap composed of 120 places in 254 ms of which 3 ms to minimize.
[2024-05-28 17:46:04] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 1 ms to minimize.
[2024-05-28 17:46:10] [INFO ] Deduced a trap composed of 185 places in 176 ms of which 2 ms to minimize.
[2024-05-28 17:46:10] [INFO ] Deduced a trap composed of 175 places in 180 ms of which 2 ms to minimize.
[2024-05-28 17:46:10] [INFO ] Deduced a trap composed of 186 places in 213 ms of which 2 ms to minimize.
[2024-05-28 17:46:12] [INFO ] Deduced a trap composed of 193 places in 187 ms of which 2 ms to minimize.
[2024-05-28 17:46:12] [INFO ] Deduced a trap composed of 164 places in 285 ms of which 2 ms to minimize.
[2024-05-28 17:46:12] [INFO ] Deduced a trap composed of 149 places in 250 ms of which 3 ms to minimize.
[2024-05-28 17:46:13] [INFO ] Deduced a trap composed of 177 places in 255 ms of which 2 ms to minimize.
[2024-05-28 17:46:13] [INFO ] Deduced a trap composed of 183 places in 292 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 17:46:18] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2024-05-28 17:46:24] [INFO ] Deduced a trap composed of 174 places in 319 ms of which 3 ms to minimize.
[2024-05-28 17:46:25] [INFO ] Deduced a trap composed of 156 places in 239 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 59 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD809 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/369 variables, 4/63 constraints. Problems are: Problem set: 324 solved, 869 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/1542 variables, and 63 constraints, problems are : Problem set: 324 solved, 869 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 23/23 constraints]
After SMT, in 64496ms problems are : Problem set: 324 solved, 869 unsolved
Search for dead transitions found 324 dead transitions in 64507ms
Found 324 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 324 transitions
Dead transitions reduction (with SMT) removed 324 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 369/538 places, 873/1366 transitions.
Applied a total of 0 rules in 16 ms. Remains 369 /369 variables (removed 0) and now considering 873/873 (removed 0) transitions.
[2024-05-28 17:46:55] [INFO ] Redundant transitions in 25 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 117030 ms. Remains : 369/538 places, 873/1366 transitions.
[2024-05-28 17:46:55] [INFO ] Flatten gal took : 29 ms
[2024-05-28 17:46:55] [INFO ] Flatten gal took : 29 ms
[2024-05-28 17:46:55] [INFO ] Input system was already deterministic with 873 transitions.
RANDOM walk for 6821 steps (1 resets) in 47 ms. (142 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 17:46:55] [INFO ] Flatten gal took : 60 ms
[2024-05-28 17:46:55] [INFO ] Flatten gal took : 44 ms
[2024-05-28 17:46:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17731912242670187991.gal : 7 ms
[2024-05-28 17:46:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality728848226484158688.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17731912242670187991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality728848226484158688.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 538 transition count 1326
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 498 transition count 1325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 497 transition count 1325
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 82 place count 497 transition count 1265
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 202 place count 437 transition count 1265
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 332 place count 372 transition count 1200
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 334 place count 370 transition count 1198
Iterating global reduction 3 with 2 rules applied. Total rules applied 336 place count 370 transition count 1198
Applied a total of 336 rules in 109 ms. Remains 370 /538 variables (removed 168) and now considering 1198/1366 (removed 168) transitions.
Running 1194 sub problems to find dead transitions.
[2024-05-28 17:46:55] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
// Phase 1: matrix 1174 rows 370 cols
[2024-05-28 17:46:55] [INFO ] Computed 40 invariants in 38 ms
[2024-05-28 17:46:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 17:47:06] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:47:06] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:47:11] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 34 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 17:47:22] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 2 ms to minimize.
[2024-05-28 17:47:22] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 2 ms to minimize.
[2024-05-28 17:47:23] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 0 ms to minimize.
[2024-05-28 17:47:23] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:47:27] [INFO ] Deduced a trap composed of 47 places in 252 ms of which 1 ms to minimize.
[2024-05-28 17:47:28] [INFO ] Deduced a trap composed of 119 places in 196 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 17:47:33] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 17:47:38] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 42 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 11/11 constraints]
After SMT, in 44986ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 45003ms
[2024-05-28 17:47:40] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 17:47:40] [INFO ] Invariant cache hit.
[2024-05-28 17:47:41] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-28 17:47:41] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 17:47:41] [INFO ] Invariant cache hit.
[2024-05-28 17:47:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:47:48] [INFO ] Implicit Places using invariants and state equation in 7917 ms returned []
Implicit Place search using SMT with State Equation took 8238 ms to find 0 implicit places.
[2024-05-28 17:47:48] [INFO ] Redundant transitions in 35 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-05-28 17:47:49] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 17:47:49] [INFO ] Invariant cache hit.
[2024-05-28 17:47:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 17:48:00] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:48:05] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:48:06] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD807 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/367 variables, 1/35 constraints. Problems are: Problem set: 90 solved, 1104 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 367/1544 variables, and 35 constraints, problems are : Problem set: 90 solved, 1104 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 90 solved, 1104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 17/31 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 3/34 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/34 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
At refinement iteration 4 (OVERLAPS) 1/367 variables, 1/35 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
[2024-05-28 17:48:31] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 2 ms to minimize.
[2024-05-28 17:48:31] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 3 ms to minimize.
[2024-05-28 17:48:32] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 2 ms to minimize.
[2024-05-28 17:48:32] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:48:32] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:48:32] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:48:32] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2024-05-28 17:48:32] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
[2024-05-28 17:48:32] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 3 ms to minimize.
[2024-05-28 17:48:33] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 10/45 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
[2024-05-28 17:48:41] [INFO ] Deduced a trap composed of 128 places in 277 ms of which 3 ms to minimize.
[2024-05-28 17:48:41] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 2/47 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/47 constraints. Problems are: Problem set: 90 solved, 1104 unsolved
Problem TDEAD9 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD499 is UNSAT
At refinement iteration 8 (OVERLAPS) 3/370 variables, 8/55 constraints. Problems are: Problem set: 192 solved, 1002 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1544 variables, and 55 constraints, problems are : Problem set: 192 solved, 1002 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 15/15 constraints]
After SMT, in 64894ms problems are : Problem set: 192 solved, 1002 unsolved
Search for dead transitions found 192 dead transitions in 65006ms
Found 192 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 192 transitions
Dead transitions reduction (with SMT) removed 192 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 370/538 places, 1006/1366 transitions.
Applied a total of 0 rules in 25 ms. Remains 370 /370 variables (removed 0) and now considering 1006/1006 (removed 0) transitions.
[2024-05-28 17:48:54] [INFO ] Redundant transitions in 23 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 118476 ms. Remains : 370/538 places, 1006/1366 transitions.
[2024-05-28 17:48:54] [INFO ] Flatten gal took : 43 ms
[2024-05-28 17:48:54] [INFO ] Flatten gal took : 46 ms
[2024-05-28 17:48:54] [INFO ] Input system was already deterministic with 1006 transitions.
[2024-05-28 17:48:54] [INFO ] Flatten gal took : 45 ms
[2024-05-28 17:48:54] [INFO ] Flatten gal took : 47 ms
[2024-05-28 17:48:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality16789054675660075956.gal : 7 ms
[2024-05-28 17:48:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality8730345927282831255.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/CTLCardinality16789054675660075956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8730345927282831255.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

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

BK_STOP 1716918690221

--------------------
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="PolyORBLF-PT-S04J04T06"
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 PolyORBLF-PT-S04J04T06, 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 r290-tajo-171654446700265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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