Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446300073.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-COL-S02J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446300073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.3K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:55 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 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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-COL-S02J04T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716903246352

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-28 13:34:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 13:34:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:34:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 13:34:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 13:34:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 640 ms
[2024-05-28 13:34:08] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2024-05-28 13:34:08] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 13:34:08] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (21 resets) in 2476 ms. (16 steps per ms) remains 60/82 properties
BEST_FIRST walk for 4000 steps (8 resets) in 79 ms. (50 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 219 ms. (18 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 210 ms. (18 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 73 ms. (54 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (9 resets) in 33 ms. (117 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (9 resets) in 37 ms. (105 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (9 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 55 ms. (71 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
[2024-05-28 13:34:10] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 13:34:10] [INFO ] Computed 26 invariants in 5 ms
[2024-05-28 13:34:10] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 52 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/5 constraints. Problems are: Problem set: 9 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 9 solved, 51 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 3 (OVERLAPS) 16/66 variables, 8/13 constraints. Problems are: Problem set: 41 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 41 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 5 (OVERLAPS) 15/81 variables, 13/26 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 58 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 58 solved, 2 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 58 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/45 variables, 6/6 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/49 variables, 3/9 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 58 solved, 2 unsolved
[2024-05-28 13:34:11] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 12 ms to minimize.
Problem AtomicPropp8 is UNSAT
[2024-05-28 13:34:11] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 2/23 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/78 variables, 3/26 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/79 variables, 1/27 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 64/143 variables, 79/106 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 8/114 constraints. Problems are: Problem set: 59 solved, 1 unsolved
Problem AtomicPropp49 is UNSAT
After SMT solving in domain Int declared 143/145 variables, and 115 constraints, problems are : Problem set: 60 solved, 0 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 79/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/60 constraints, Known Traps: 2/2 constraints]
After SMT, in 848ms problems are : Problem set: 60 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 60 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:34:11] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-28 13:34:11] [INFO ] Flatten gal took : 31 ms
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:34:11] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 13:34:11] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 31 ms.
[2024-05-28 13:34:11] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 313 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Applied a total of 14 rules in 35 ms. Remains 468 /476 variables (removed 8) and now considering 818/824 (removed 6) transitions.
Running 816 sub problems to find dead transitions.
[2024-05-28 13:34:11] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 468 cols
[2024-05-28 13:34:11] [INFO ] Computed 44 invariants in 45 ms
[2024-05-28 13:34:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:34:17] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 4 ms to minimize.
[2024-05-28 13:34:17] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:34:17] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 2 ms to minimize.
[2024-05-28 13:34:17] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-28 13:34:17] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:34:18] [INFO ] Deduced a trap composed of 269 places in 190 ms of which 4 ms to minimize.
[2024-05-28 13:34:18] [INFO ] Deduced a trap composed of 92 places in 168 ms of which 4 ms to minimize.
[2024-05-28 13:34:18] [INFO ] Deduced a trap composed of 144 places in 149 ms of which 3 ms to minimize.
[2024-05-28 13:34:18] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:34:19] [INFO ] Deduced a trap composed of 277 places in 182 ms of which 3 ms to minimize.
[2024-05-28 13:34:19] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 1 ms to minimize.
[2024-05-28 13:34:19] [INFO ] Deduced a trap composed of 251 places in 178 ms of which 2 ms to minimize.
[2024-05-28 13:34:19] [INFO ] Deduced a trap composed of 211 places in 181 ms of which 3 ms to minimize.
[2024-05-28 13:34:20] [INFO ] Deduced a trap composed of 257 places in 188 ms of which 3 ms to minimize.
[2024-05-28 13:34:20] [INFO ] Deduced a trap composed of 245 places in 174 ms of which 3 ms to minimize.
[2024-05-28 13:34:20] [INFO ] Deduced a trap composed of 248 places in 170 ms of which 3 ms to minimize.
[2024-05-28 13:34:20] [INFO ] Deduced a trap composed of 243 places in 171 ms of which 2 ms to minimize.
[2024-05-28 13:34:25] [INFO ] Deduced a trap composed of 223 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:34:26] [INFO ] Deduced a trap composed of 245 places in 231 ms of which 4 ms to minimize.
[2024-05-28 13:34:26] [INFO ] Deduced a trap composed of 261 places in 252 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1274 variables, and 62 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:34:37] [INFO ] Deduced a trap composed of 300 places in 220 ms of which 4 ms to minimize.
[2024-05-28 13:34:37] [INFO ] Deduced a trap composed of 253 places in 174 ms of which 3 ms to minimize.
[2024-05-28 13:34:37] [INFO ] Deduced a trap composed of 250 places in 167 ms of which 3 ms to minimize.
[2024-05-28 13:34:38] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-28 13:34:41] [INFO ] Deduced a trap composed of 238 places in 208 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:34:52] [INFO ] Deduced a trap composed of 318 places in 213 ms of which 3 ms to minimize.
SMT process timed out in 41213ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 41228ms
[2024-05-28 13:34:52] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 13:34:52] [INFO ] Invariant cache hit.
[2024-05-28 13:34:52] [INFO ] Implicit Places using invariants in 166 ms returned [366, 367, 368, 369, 370, 371]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 174 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 462/476 places, 818/824 transitions.
Applied a total of 0 rules in 11 ms. Remains 462 /462 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41467 ms. Remains : 462/476 places, 818/824 transitions.
Support contains 313 out of 462 places after structural reductions.
[2024-05-28 13:34:52] [INFO ] Flatten gal took : 79 ms
[2024-05-28 13:34:52] [INFO ] Flatten gal took : 73 ms
[2024-05-28 13:34:53] [INFO ] Input system was already deterministic with 818 transitions.
RANDOM walk for 40000 steps (11 resets) in 1462 ms. (27 steps per ms) remains 30/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (9 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
[2024-05-28 13:34:53] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2024-05-28 13:34:53] [INFO ] Computed 38 invariants in 16 ms
[2024-05-28 13:34:54] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem AtomicPropp28 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 2 (OVERLAPS) 25/204 variables, 8/9 constraints. Problems are: Problem set: 6 solved, 24 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 2/11 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 23 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 5 (OVERLAPS) 256/460 variables, 26/37 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/37 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 806/1266 variables, 460/497 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1266 variables, 72/569 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1266 variables, 0/569 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/1268 variables, 2/571 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1268 variables, 1/572 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1268 variables, 0/572 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1268 variables, 0/572 constraints. Problems are: Problem set: 29 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1268/1268 variables, and 572 constraints, problems are : Problem set: 29 solved, 1 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 462/462 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 29 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 315/318 variables, 5/5 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/5 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/330 variables, 8/13 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/13 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 129/459 variables, 23/36 constraints. Problems are: Problem set: 29 solved, 1 unsolved
[2024-05-28 13:34:55] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 3 ms to minimize.
[2024-05-28 13:34:55] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-28 13:34:55] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 3/39 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/39 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/460 variables, 1/40 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/40 constraints. Problems are: Problem set: 29 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1266/1268 variables, and 500 constraints, problems are : Problem set: 29 solved, 1 unsolved in 1210 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 460/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/30 constraints, Known Traps: 3/3 constraints]
After SMT, in 1996ms problems are : Problem set: 29 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 818/818 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 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 288 place count 318 transition count 674
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 294 place count 312 transition count 668
Iterating global reduction 2 with 6 rules applied. Total rules applied 300 place count 312 transition count 668
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 312 place count 312 transition count 656
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 324 place count 300 transition count 656
Applied a total of 324 rules in 179 ms. Remains 300 /462 variables (removed 162) and now considering 656/818 (removed 162) transitions.
Running 654 sub problems to find dead transitions.
[2024-05-28 13:34:56] [INFO ] Flow matrix only has 644 transitions (discarded 12 similar events)
// Phase 1: matrix 644 rows 300 cols
[2024-05-28 13:34:56] [INFO ] Computed 38 invariants in 19 ms
[2024-05-28 13:34:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 654 unsolved
[2024-05-28 13:35:00] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-05-28 13:35:00] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-28 13:35:00] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-28 13:35:00] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 5 ms to minimize.
[2024-05-28 13:35:00] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-28 13:35:00] [INFO ] Deduced a trap composed of 112 places in 148 ms of which 2 ms to minimize.
[2024-05-28 13:35:00] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 2 ms to minimize.
[2024-05-28 13:35:00] [INFO ] Deduced a trap composed of 108 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:35:01] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-28 13:35:01] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:35:03] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 3 ms to minimize.
[2024-05-28 13:35:03] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:35:04] [INFO ] Deduced a trap composed of 128 places in 185 ms of which 2 ms to minimize.
[2024-05-28 13:35:04] [INFO ] Deduced a trap composed of 123 places in 176 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 654 unsolved
[2024-05-28 13:35:06] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/300 variables, 2/53 constraints. Problems are: Problem set: 66 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/944 variables, and 53 constraints, problems are : Problem set: 66 solved, 588 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/300 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 654/654 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 66 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 11/11 constraints. Problems are: Problem set: 66 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 25/36 constraints. Problems are: Problem set: 66 solved, 588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 15/51 constraints. Problems are: Problem set: 66 solved, 588 unsolved
[2024-05-28 13:35:22] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:35:22] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-28 13:35:23] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 3 ms to minimize.
[2024-05-28 13:35:24] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 4/55 constraints. Problems are: Problem set: 66 solved, 588 unsolved
[2024-05-28 13:35:28] [INFO ] Deduced a trap composed of 110 places in 202 ms of which 3 ms to minimize.
[2024-05-28 13:35:29] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 2/57 constraints. Problems are: Problem set: 66 solved, 588 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 9)
(s105 1)
(s106 0)
(s107 1)
(s108 1)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 1)
(s236 0)
(s237 8)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 2)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 5)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/944 variables, and 57 constraints, problems are : Problem set: 66 solved, 588 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/300 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/654 constraints, Known Traps: 21/21 constraints]
After SMT, in 41015ms problems are : Problem set: 66 solved, 588 unsolved
Search for dead transitions found 66 dead transitions in 41024ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 300/462 places, 590/818 transitions.
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 578
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 13 place count 287 transition count 566
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 13 rules in 39 ms. Remains 287 /300 variables (removed 13) and now considering 566/590 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41247 ms. Remains : 287/462 places, 566/818 transitions.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (20 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (30 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 421275 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 1
Probabilistic random walk after 421275 steps, saw 196298 distinct states, run finished after 3008 ms. (steps per millisecond=140 ) properties seen :0
[2024-05-28 13:35:40] [INFO ] Flow matrix only has 554 transitions (discarded 12 similar events)
// Phase 1: matrix 554 rows 286 cols
[2024-05-28 13:35:40] [INFO ] Computed 38 invariants in 23 ms
[2024-05-28 13:35:40] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 2/840 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, Generalized P Invariants (flows): 0/27 constraints, State Equation: 0/286 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 30 atomic propositions for a total of 8 simplifications.
[2024-05-28 13:35:40] [INFO ] Flatten gal took : 41 ms
[2024-05-28 13:35:40] [INFO ] Flatten gal took : 39 ms
[2024-05-28 13:35:40] [INFO ] Input system was already deterministic with 818 transitions.
Support contains 73 out of 462 places (down from 128) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 462/462 places, 818/818 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 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 288 place count 318 transition count 674
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 294 place count 312 transition count 668
Iterating global reduction 2 with 6 rules applied. Total rules applied 300 place count 312 transition count 668
Applied a total of 300 rules in 57 ms. Remains 312 /462 variables (removed 150) and now considering 668/818 (removed 150) transitions.
Running 666 sub problems to find dead transitions.
[2024-05-28 13:35:40] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
// Phase 1: matrix 656 rows 312 cols
[2024-05-28 13:35:40] [INFO ] Computed 38 invariants in 13 ms
[2024-05-28 13:35:40] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 13:35:44] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-28 13:35:45] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:35:45] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
[2024-05-28 13:35:45] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-05-28 13:35:45] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:35:45] [INFO ] Deduced a trap composed of 115 places in 192 ms of which 3 ms to minimize.
[2024-05-28 13:35:46] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:35:46] [INFO ] Deduced a trap composed of 178 places in 172 ms of which 2 ms to minimize.
[2024-05-28 13:35:49] [INFO ] Deduced a trap composed of 108 places in 163 ms of which 2 ms to minimize.
[2024-05-28 13:35:49] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 2 ms to minimize.
[2024-05-28 13:35:49] [INFO ] Deduced a trap composed of 101 places in 184 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 13:35:52] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 3 ms to minimize.
[2024-05-28 13:35:52] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/50 constraints. Problems are: Problem set: 36 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/968 variables, and 50 constraints, problems are : Problem set: 36 solved, 630 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 36 solved, 630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 13/49 constraints. Problems are: Problem set: 36 solved, 630 unsolved
[2024-05-28 13:36:06] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/50 constraints. Problems are: Problem set: 36 solved, 630 unsolved
[2024-05-28 13:36:11] [INFO ] Deduced a trap composed of 108 places in 180 ms of which 2 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 4/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/968 variables, and 54 constraints, problems are : Problem set: 36 solved, 630 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 18/18 constraints]
After SMT, in 40809ms problems are : Problem set: 36 solved, 630 unsolved
Search for dead transitions found 36 dead transitions in 40817ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 36 transitions.
[2024-05-28 13:36:21] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
// Phase 1: matrix 620 rows 312 cols
[2024-05-28 13:36:21] [INFO ] Computed 38 invariants in 16 ms
[2024-05-28 13:36:21] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-28 13:36:21] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2024-05-28 13:36:21] [INFO ] Invariant cache hit.
[2024-05-28 13:36:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:36:24] [INFO ] Implicit Places using invariants and state equation in 3061 ms returned []
Implicit Place search using SMT with State Equation took 3309 ms to find 0 implicit places.
[2024-05-28 13:36:24] [INFO ] Redundant transitions in 65 ms returned []
Starting structural reductions in SI_CTL mode, iteration 1 : 312/462 places, 632/818 transitions.
Applied a total of 0 rules in 37 ms. Remains 312 /312 variables (removed 0) and now considering 632/632 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44303 ms. Remains : 312/462 places, 632/818 transitions.
[2024-05-28 13:36:24] [INFO ] Flatten gal took : 51 ms
[2024-05-28 13:36:25] [INFO ] Flatten gal took : 40 ms
[2024-05-28 13:36:25] [INFO ] Input system was already deterministic with 632 transitions.
[2024-05-28 13:36:25] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:36:25] [INFO ] Flatten gal took : 27 ms
[2024-05-28 13:36:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality2678820181081595156.gal : 13 ms
[2024-05-28 13:36:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality304378949688141956.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/CTLCardinality2678820181081595156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality304378949688141956.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:36:55] [INFO ] Flatten gal took : 57 ms
[2024-05-28 13:36:55] [INFO ] Applying decomposition
[2024-05-28 13:36:55] [INFO ] Flatten gal took : 39 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/graph2184514807352380610.txt' '-o' '/tmp/graph2184514807352380610.bin' '-w' '/tmp/graph2184514807352380610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2184514807352380610.bin' '-l' '-1' '-v' '-w' '/tmp/graph2184514807352380610.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:36:55] [INFO ] Decomposing Gal with order
[2024-05-28 13:36:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:36:55] [INFO ] Removed a total of 533 redundant transitions.
[2024-05-28 13:36:55] [INFO ] Flatten gal took : 184 ms
[2024-05-28 13:36:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 335 labels/synchronizations in 40 ms.
[2024-05-28 13:36:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality6178792211491384811.gal : 12 ms
[2024-05-28 13:36:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality16276324721030796834.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/CTLCardinality6178792211491384811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16276324721030796834.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 LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 29 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:37:26] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 13:37:26] [INFO ] Computed 38 invariants in 19 ms
[2024-05-28 13:37:26] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:37:32] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-28 13:37:32] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:37:32] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:37:32] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:37:32] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:37:33] [INFO ] Deduced a trap composed of 240 places in 223 ms of which 4 ms to minimize.
[2024-05-28 13:37:33] [INFO ] Deduced a trap composed of 139 places in 221 ms of which 2 ms to minimize.
[2024-05-28 13:37:33] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:37:33] [INFO ] Deduced a trap composed of 271 places in 245 ms of which 4 ms to minimize.
[2024-05-28 13:37:34] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:37:34] [INFO ] Deduced a trap composed of 265 places in 242 ms of which 3 ms to minimize.
[2024-05-28 13:37:37] [INFO ] Deduced a trap composed of 248 places in 236 ms of which 4 ms to minimize.
[2024-05-28 13:37:39] [INFO ] Deduced a trap composed of 223 places in 228 ms of which 3 ms to minimize.
[2024-05-28 13:37:39] [INFO ] Deduced a trap composed of 241 places in 221 ms of which 4 ms to minimize.
[2024-05-28 13:37:40] [INFO ] Deduced a trap composed of 110 places in 218 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:37:43] [INFO ] Deduced a trap composed of 262 places in 196 ms of which 3 ms to minimize.
[2024-05-28 13:37:43] [INFO ] Deduced a trap composed of 269 places in 203 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:37:51] [INFO ] Deduced a trap composed of 309 places in 199 ms of which 4 ms to minimize.
[2024-05-28 13:37:51] [INFO ] Deduced a trap composed of 298 places in 174 ms of which 3 ms to minimize.
[2024-05-28 13:37:52] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:37:55] [INFO ] Deduced a trap composed of 243 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 242 places in 215 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 22/22 constraints]
After SMT, in 40909ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40924ms
[2024-05-28 13:38:07] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:38:07] [INFO ] Invariant cache hit.
[2024-05-28 13:38:07] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-28 13:38:07] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:38:07] [INFO ] Invariant cache hit.
[2024-05-28 13:38:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:38:11] [INFO ] Implicit Places using invariants and state equation in 4336 ms returned []
Implicit Place search using SMT with State Equation took 4691 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:38:11] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:38:11] [INFO ] Invariant cache hit.
[2024-05-28 13:38:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:17] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:38:19] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-28 13:38:19] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:38:21] [INFO ] Deduced a trap composed of 270 places in 212 ms of which 3 ms to minimize.
[2024-05-28 13:38:21] [INFO ] Deduced a trap composed of 286 places in 222 ms of which 4 ms to minimize.
[2024-05-28 13:38:21] [INFO ] Deduced a trap composed of 256 places in 208 ms of which 4 ms to minimize.
[2024-05-28 13:38:21] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 4 ms to minimize.
[2024-05-28 13:38:22] [INFO ] Deduced a trap composed of 268 places in 205 ms of which 4 ms to minimize.
[2024-05-28 13:38:22] [INFO ] Deduced a trap composed of 245 places in 180 ms of which 3 ms to minimize.
[2024-05-28 13:38:22] [INFO ] Deduced a trap composed of 241 places in 199 ms of which 3 ms to minimize.
[2024-05-28 13:38:22] [INFO ] Deduced a trap composed of 288 places in 202 ms of which 3 ms to minimize.
[2024-05-28 13:38:22] [INFO ] Deduced a trap composed of 232 places in 178 ms of which 2 ms to minimize.
[2024-05-28 13:38:23] [INFO ] Deduced a trap composed of 248 places in 178 ms of which 3 ms to minimize.
[2024-05-28 13:38:25] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 4 ms to minimize.
[2024-05-28 13:38:26] [INFO ] Deduced a trap composed of 144 places in 215 ms of which 4 ms to minimize.
[2024-05-28 13:38:27] [INFO ] Deduced a trap composed of 302 places in 227 ms of which 4 ms to minimize.
[2024-05-28 13:38:27] [INFO ] Deduced a trap composed of 278 places in 200 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:27] [INFO ] Deduced a trap composed of 296 places in 212 ms of which 4 ms to minimize.
[2024-05-28 13:38:27] [INFO ] Deduced a trap composed of 249 places in 178 ms of which 3 ms to minimize.
[2024-05-28 13:38:28] [INFO ] Deduced a trap composed of 261 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:38:28] [INFO ] Deduced a trap composed of 247 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:38:33] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 3 ms to minimize.
[2024-05-28 13:38:34] [INFO ] Deduced a trap composed of 242 places in 220 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:42] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:38:48] [INFO ] Deduced a trap composed of 222 places in 222 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:39:10] [INFO ] Deduced a trap composed of 145 places in 252 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 60818ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60833ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/462 places, 776/818 transitions.
Applied a total of 0 rules in 8 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106493 ms. Remains : 456/462 places, 776/818 transitions.
[2024-05-28 13:39:12] [INFO ] Flatten gal took : 47 ms
[2024-05-28 13:39:12] [INFO ] Flatten gal took : 50 ms
[2024-05-28 13:39:12] [INFO ] Input system was already deterministic with 776 transitions.
[2024-05-28 13:39:12] [INFO ] Flatten gal took : 35 ms
[2024-05-28 13:39:12] [INFO ] Flatten gal took : 37 ms
[2024-05-28 13:39:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality18375350403855283461.gal : 6 ms
[2024-05-28 13:39:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9855244515162261670.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/CTLCardinality18375350403855283461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9855244515162261670.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 13:39:43] [INFO ] Flatten gal took : 60 ms
[2024-05-28 13:39:43] [INFO ] Applying decomposition
[2024-05-28 13:39:43] [INFO ] Flatten gal took : 45 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/graph5814561890198130848.txt' '-o' '/tmp/graph5814561890198130848.bin' '-w' '/tmp/graph5814561890198130848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5814561890198130848.bin' '-l' '-1' '-v' '-w' '/tmp/graph5814561890198130848.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:39:43] [INFO ] Decomposing Gal with order
[2024-05-28 13:39:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:39:43] [INFO ] Removed a total of 656 redundant transitions.
[2024-05-28 13:39:43] [INFO ] Flatten gal took : 94 ms
[2024-05-28 13:39:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 200 labels/synchronizations in 25 ms.
[2024-05-28 13:39:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality2677112805413116837.gal : 11 ms
[2024-05-28 13:39:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4052517462846155339.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/CTLCardinality2677112805413116837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4052517462846155339.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 16 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:40:13] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:40:13] [INFO ] Invariant cache hit.
[2024-05-28 13:40:13] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:40:20] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-28 13:40:20] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:40:20] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:40:20] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:40:21] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2024-05-28 13:40:21] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:40:23] [INFO ] Deduced a trap composed of 270 places in 237 ms of which 4 ms to minimize.
[2024-05-28 13:40:23] [INFO ] Deduced a trap composed of 286 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:40:23] [INFO ] Deduced a trap composed of 256 places in 205 ms of which 4 ms to minimize.
[2024-05-28 13:40:24] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 3 ms to minimize.
[2024-05-28 13:40:24] [INFO ] Deduced a trap composed of 268 places in 222 ms of which 4 ms to minimize.
[2024-05-28 13:40:24] [INFO ] Deduced a trap composed of 245 places in 222 ms of which 4 ms to minimize.
[2024-05-28 13:40:24] [INFO ] Deduced a trap composed of 241 places in 204 ms of which 3 ms to minimize.
[2024-05-28 13:40:25] [INFO ] Deduced a trap composed of 288 places in 229 ms of which 3 ms to minimize.
[2024-05-28 13:40:25] [INFO ] Deduced a trap composed of 232 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:40:25] [INFO ] Deduced a trap composed of 248 places in 223 ms of which 3 ms to minimize.
[2024-05-28 13:40:28] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:40:28] [INFO ] Deduced a trap composed of 144 places in 189 ms of which 4 ms to minimize.
[2024-05-28 13:40:29] [INFO ] Deduced a trap composed of 302 places in 208 ms of which 4 ms to minimize.
[2024-05-28 13:40:29] [INFO ] Deduced a trap composed of 278 places in 194 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:40:30] [INFO ] Deduced a trap composed of 296 places in 174 ms of which 4 ms to minimize.
[2024-05-28 13:40:30] [INFO ] Deduced a trap composed of 249 places in 159 ms of which 2 ms to minimize.
[2024-05-28 13:40:31] [INFO ] Deduced a trap composed of 261 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:40:31] [INFO ] Deduced a trap composed of 247 places in 239 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:40:38] [INFO ] Deduced a trap composed of 297 places in 221 ms of which 4 ms to minimize.
[2024-05-28 13:40:42] [INFO ] Deduced a trap composed of 276 places in 218 ms of which 4 ms to minimize.
[2024-05-28 13:40:42] [INFO ] Deduced a trap composed of 246 places in 159 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:40:48] [INFO ] Deduced a trap composed of 239 places in 207 ms of which 4 ms to minimize.
[2024-05-28 13:40:49] [INFO ] Deduced a trap composed of 129 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 65 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 40998ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 41012ms
[2024-05-28 13:40:54] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:40:54] [INFO ] Invariant cache hit.
[2024-05-28 13:40:54] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-28 13:40:54] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:40:54] [INFO ] Invariant cache hit.
[2024-05-28 13:40:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:40:59] [INFO ] Implicit Places using invariants and state equation in 5043 ms returned []
Implicit Place search using SMT with State Equation took 5317 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:40:59] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:40:59] [INFO ] Invariant cache hit.
[2024-05-28 13:40:59] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:41:06] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-28 13:41:06] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-28 13:41:06] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:41:06] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:41:07] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2024-05-28 13:41:07] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:41:09] [INFO ] Deduced a trap composed of 270 places in 230 ms of which 4 ms to minimize.
[2024-05-28 13:41:09] [INFO ] Deduced a trap composed of 286 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:41:09] [INFO ] Deduced a trap composed of 256 places in 185 ms of which 3 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 3 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 268 places in 202 ms of which 4 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 245 places in 213 ms of which 4 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 241 places in 183 ms of which 3 ms to minimize.
[2024-05-28 13:41:10] [INFO ] Deduced a trap composed of 288 places in 194 ms of which 4 ms to minimize.
[2024-05-28 13:41:11] [INFO ] Deduced a trap composed of 232 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:41:11] [INFO ] Deduced a trap composed of 248 places in 195 ms of which 3 ms to minimize.
[2024-05-28 13:41:13] [INFO ] Deduced a trap composed of 42 places in 262 ms of which 4 ms to minimize.
[2024-05-28 13:41:14] [INFO ] Deduced a trap composed of 144 places in 214 ms of which 3 ms to minimize.
[2024-05-28 13:41:15] [INFO ] Deduced a trap composed of 302 places in 263 ms of which 3 ms to minimize.
[2024-05-28 13:41:15] [INFO ] Deduced a trap composed of 278 places in 222 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:41:16] [INFO ] Deduced a trap composed of 296 places in 240 ms of which 3 ms to minimize.
[2024-05-28 13:41:16] [INFO ] Deduced a trap composed of 249 places in 202 ms of which 3 ms to minimize.
[2024-05-28 13:41:16] [INFO ] Deduced a trap composed of 261 places in 184 ms of which 3 ms to minimize.
[2024-05-28 13:41:17] [INFO ] Deduced a trap composed of 247 places in 185 ms of which 3 ms to minimize.
[2024-05-28 13:41:22] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:41:22] [INFO ] Deduced a trap composed of 242 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:41:31] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:41:44] [INFO ] Deduced a trap composed of 244 places in 209 ms of which 3 ms to minimize.
[2024-05-28 13:41:45] [INFO ] Deduced a trap composed of 288 places in 183 ms of which 4 ms to minimize.
[2024-05-28 13:41:45] [INFO ] Deduced a trap composed of 222 places in 208 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/455 variables, 1/67 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:41:59] [INFO ] Deduced a trap composed of 320 places in 183 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 68 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 31/31 constraints]
After SMT, in 60858ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60875ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/462 places, 776/818 transitions.
Applied a total of 0 rules in 5 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107233 ms. Remains : 456/462 places, 776/818 transitions.
[2024-05-28 13:42:00] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:42:00] [INFO ] Flatten gal took : 23 ms
[2024-05-28 13:42:00] [INFO ] Input system was already deterministic with 776 transitions.
[2024-05-28 13:42:00] [INFO ] Flatten gal took : 23 ms
[2024-05-28 13:42:00] [INFO ] Flatten gal took : 22 ms
[2024-05-28 13:42:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality4179116777308865775.gal : 4 ms
[2024-05-28 13:42:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality6058755533624523421.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/CTLCardinality4179116777308865775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6058755533624523421.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 13:42:31] [INFO ] Flatten gal took : 51 ms
[2024-05-28 13:42:31] [INFO ] Applying decomposition
[2024-05-28 13:42:31] [INFO ] Flatten gal took : 38 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/graph14614998400420056817.txt' '-o' '/tmp/graph14614998400420056817.bin' '-w' '/tmp/graph14614998400420056817.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14614998400420056817.bin' '-l' '-1' '-v' '-w' '/tmp/graph14614998400420056817.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:42:31] [INFO ] Decomposing Gal with order
[2024-05-28 13:42:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:42:31] [INFO ] Removed a total of 760 redundant transitions.
[2024-05-28 13:42:31] [INFO ] Flatten gal took : 73 ms
[2024-05-28 13:42:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 179 labels/synchronizations in 23 ms.
[2024-05-28 13:42:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality5383851935302370746.gal : 8 ms
[2024-05-28 13:42:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality8518246731834282934.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/CTLCardinality5383851935302370746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8518246731834282934.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 LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 20 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:43:01] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:43:01] [INFO ] Invariant cache hit.
[2024-05-28 13:43:01] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:07] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-28 13:43:07] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-28 13:43:07] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:43:07] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:43:08] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-05-28 13:43:08] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:43:10] [INFO ] Deduced a trap composed of 270 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:43:10] [INFO ] Deduced a trap composed of 286 places in 192 ms of which 3 ms to minimize.
[2024-05-28 13:43:10] [INFO ] Deduced a trap composed of 256 places in 224 ms of which 4 ms to minimize.
[2024-05-28 13:43:11] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 3 ms to minimize.
[2024-05-28 13:43:11] [INFO ] Deduced a trap composed of 268 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:43:11] [INFO ] Deduced a trap composed of 245 places in 194 ms of which 3 ms to minimize.
[2024-05-28 13:43:11] [INFO ] Deduced a trap composed of 241 places in 184 ms of which 3 ms to minimize.
[2024-05-28 13:43:11] [INFO ] Deduced a trap composed of 288 places in 187 ms of which 3 ms to minimize.
[2024-05-28 13:43:12] [INFO ] Deduced a trap composed of 232 places in 214 ms of which 3 ms to minimize.
[2024-05-28 13:43:12] [INFO ] Deduced a trap composed of 248 places in 169 ms of which 5 ms to minimize.
[2024-05-28 13:43:14] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 4 ms to minimize.
[2024-05-28 13:43:15] [INFO ] Deduced a trap composed of 144 places in 240 ms of which 3 ms to minimize.
[2024-05-28 13:43:16] [INFO ] Deduced a trap composed of 302 places in 225 ms of which 3 ms to minimize.
[2024-05-28 13:43:16] [INFO ] Deduced a trap composed of 278 places in 216 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:16] [INFO ] Deduced a trap composed of 296 places in 220 ms of which 3 ms to minimize.
[2024-05-28 13:43:17] [INFO ] Deduced a trap composed of 249 places in 228 ms of which 4 ms to minimize.
[2024-05-28 13:43:17] [INFO ] Deduced a trap composed of 261 places in 229 ms of which 3 ms to minimize.
[2024-05-28 13:43:17] [INFO ] Deduced a trap composed of 247 places in 223 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:26] [INFO ] Deduced a trap composed of 297 places in 240 ms of which 3 ms to minimize.
[2024-05-28 13:43:30] [INFO ] Deduced a trap composed of 276 places in 169 ms of which 3 ms to minimize.
[2024-05-28 13:43:30] [INFO ] Deduced a trap composed of 246 places in 191 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:38] [INFO ] Deduced a trap composed of 239 places in 243 ms of which 3 ms to minimize.
[2024-05-28 13:43:38] [INFO ] Deduced a trap composed of 129 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 65 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 40834ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40850ms
[2024-05-28 13:43:42] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:43:42] [INFO ] Invariant cache hit.
[2024-05-28 13:43:42] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-28 13:43:42] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:43:42] [INFO ] Invariant cache hit.
[2024-05-28 13:43:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:43:47] [INFO ] Implicit Places using invariants and state equation in 4885 ms returned []
Implicit Place search using SMT with State Equation took 5150 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:43:47] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:43:47] [INFO ] Invariant cache hit.
[2024-05-28 13:43:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:43:53] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-28 13:43:53] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:43:53] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:43:53] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:43:56] [INFO ] Deduced a trap composed of 270 places in 245 ms of which 4 ms to minimize.
[2024-05-28 13:43:56] [INFO ] Deduced a trap composed of 286 places in 235 ms of which 3 ms to minimize.
[2024-05-28 13:43:57] [INFO ] Deduced a trap composed of 256 places in 168 ms of which 2 ms to minimize.
[2024-05-28 13:43:57] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
[2024-05-28 13:43:57] [INFO ] Deduced a trap composed of 268 places in 149 ms of which 3 ms to minimize.
[2024-05-28 13:43:57] [INFO ] Deduced a trap composed of 245 places in 142 ms of which 3 ms to minimize.
[2024-05-28 13:43:57] [INFO ] Deduced a trap composed of 241 places in 169 ms of which 2 ms to minimize.
[2024-05-28 13:43:58] [INFO ] Deduced a trap composed of 288 places in 247 ms of which 3 ms to minimize.
[2024-05-28 13:43:58] [INFO ] Deduced a trap composed of 232 places in 209 ms of which 4 ms to minimize.
[2024-05-28 13:43:58] [INFO ] Deduced a trap composed of 248 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:44:00] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 3 ms to minimize.
[2024-05-28 13:44:01] [INFO ] Deduced a trap composed of 144 places in 240 ms of which 4 ms to minimize.
[2024-05-28 13:44:02] [INFO ] Deduced a trap composed of 302 places in 227 ms of which 4 ms to minimize.
[2024-05-28 13:44:02] [INFO ] Deduced a trap composed of 278 places in 227 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:44:02] [INFO ] Deduced a trap composed of 296 places in 228 ms of which 4 ms to minimize.
[2024-05-28 13:44:03] [INFO ] Deduced a trap composed of 249 places in 194 ms of which 3 ms to minimize.
[2024-05-28 13:44:03] [INFO ] Deduced a trap composed of 261 places in 177 ms of which 3 ms to minimize.
[2024-05-28 13:44:03] [INFO ] Deduced a trap composed of 247 places in 174 ms of which 3 ms to minimize.
[2024-05-28 13:44:08] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 3 ms to minimize.
[2024-05-28 13:44:09] [INFO ] Deduced a trap composed of 242 places in 214 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:44:18] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:44:24] [INFO ] Deduced a trap composed of 222 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:44:43] [INFO ] Deduced a trap composed of 145 places in 230 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 60830ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60841ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/462 places, 776/818 transitions.
Applied a total of 0 rules in 5 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106872 ms. Remains : 456/462 places, 776/818 transitions.
[2024-05-28 13:44:48] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:44:48] [INFO ] Flatten gal took : 23 ms
[2024-05-28 13:44:48] [INFO ] Input system was already deterministic with 776 transitions.
[2024-05-28 13:44:48] [INFO ] Flatten gal took : 22 ms
[2024-05-28 13:44:48] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:44:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality6159408221617400219.gal : 4 ms
[2024-05-28 13:44:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality6044433575443355989.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/CTLCardinality6159408221617400219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6044433575443355989.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 13:45:18] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:45:18] [INFO ] Applying decomposition
[2024-05-28 13:45:18] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18069655055394977218.txt' '-o' '/tmp/graph18069655055394977218.bin' '-w' '/tmp/graph18069655055394977218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18069655055394977218.bin' '-l' '-1' '-v' '-w' '/tmp/graph18069655055394977218.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:45:18] [INFO ] Decomposing Gal with order
[2024-05-28 13:45:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:45:18] [INFO ] Removed a total of 675 redundant transitions.
[2024-05-28 13:45:18] [INFO ] Flatten gal took : 54 ms
[2024-05-28 13:45:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 185 labels/synchronizations in 10 ms.
[2024-05-28 13:45:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality214624524579006337.gal : 5 ms
[2024-05-28 13:45:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality17513897883116112176.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/CTLCardinality214624524579006337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17513897883116112176.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 LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 19 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:45:48] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:45:48] [INFO ] Invariant cache hit.
[2024-05-28 13:45:48] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:45:54] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 3 ms to minimize.
[2024-05-28 13:45:55] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-05-28 13:45:55] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:45:55] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:45:55] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-28 13:45:55] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 0 ms to minimize.
[2024-05-28 13:45:57] [INFO ] Deduced a trap composed of 270 places in 188 ms of which 2 ms to minimize.
[2024-05-28 13:45:57] [INFO ] Deduced a trap composed of 286 places in 167 ms of which 3 ms to minimize.
[2024-05-28 13:45:58] [INFO ] Deduced a trap composed of 256 places in 220 ms of which 4 ms to minimize.
[2024-05-28 13:45:58] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 4 ms to minimize.
[2024-05-28 13:45:58] [INFO ] Deduced a trap composed of 268 places in 203 ms of which 4 ms to minimize.
[2024-05-28 13:45:58] [INFO ] Deduced a trap composed of 245 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:45:58] [INFO ] Deduced a trap composed of 241 places in 203 ms of which 4 ms to minimize.
[2024-05-28 13:45:59] [INFO ] Deduced a trap composed of 288 places in 170 ms of which 3 ms to minimize.
[2024-05-28 13:45:59] [INFO ] Deduced a trap composed of 232 places in 171 ms of which 3 ms to minimize.
[2024-05-28 13:45:59] [INFO ] Deduced a trap composed of 248 places in 169 ms of which 3 ms to minimize.
[2024-05-28 13:46:01] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 4 ms to minimize.
[2024-05-28 13:46:02] [INFO ] Deduced a trap composed of 144 places in 210 ms of which 3 ms to minimize.
[2024-05-28 13:46:03] [INFO ] Deduced a trap composed of 302 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:46:03] [INFO ] Deduced a trap composed of 278 places in 209 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:46:04] [INFO ] Deduced a trap composed of 296 places in 200 ms of which 3 ms to minimize.
[2024-05-28 13:46:04] [INFO ] Deduced a trap composed of 249 places in 183 ms of which 3 ms to minimize.
[2024-05-28 13:46:04] [INFO ] Deduced a trap composed of 261 places in 177 ms of which 3 ms to minimize.
[2024-05-28 13:46:04] [INFO ] Deduced a trap composed of 247 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:46:09] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 61 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:46:11] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 2 ms to minimize.
[2024-05-28 13:46:22] [INFO ] Deduced a trap composed of 219 places in 170 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 27/27 constraints]
After SMT, in 40876ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40891ms
[2024-05-28 13:46:29] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:46:29] [INFO ] Invariant cache hit.
[2024-05-28 13:46:30] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-28 13:46:30] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:46:30] [INFO ] Invariant cache hit.
[2024-05-28 13:46:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:46:34] [INFO ] Implicit Places using invariants and state equation in 4184 ms returned []
Implicit Place search using SMT with State Equation took 4541 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:46:34] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:46:34] [INFO ] Invariant cache hit.
[2024-05-28 13:46:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:46:40] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:46:40] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:46:40] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:46:40] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:46:41] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:46:41] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2024-05-28 13:46:42] [INFO ] Deduced a trap composed of 270 places in 162 ms of which 3 ms to minimize.
[2024-05-28 13:46:43] [INFO ] Deduced a trap composed of 286 places in 172 ms of which 3 ms to minimize.
[2024-05-28 13:46:43] [INFO ] Deduced a trap composed of 256 places in 196 ms of which 2 ms to minimize.
[2024-05-28 13:46:43] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 2 ms to minimize.
[2024-05-28 13:46:43] [INFO ] Deduced a trap composed of 268 places in 185 ms of which 2 ms to minimize.
[2024-05-28 13:46:43] [INFO ] Deduced a trap composed of 245 places in 160 ms of which 2 ms to minimize.
[2024-05-28 13:46:44] [INFO ] Deduced a trap composed of 241 places in 172 ms of which 3 ms to minimize.
[2024-05-28 13:46:44] [INFO ] Deduced a trap composed of 288 places in 169 ms of which 2 ms to minimize.
[2024-05-28 13:46:44] [INFO ] Deduced a trap composed of 232 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:46:44] [INFO ] Deduced a trap composed of 248 places in 166 ms of which 3 ms to minimize.
[2024-05-28 13:46:46] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 3 ms to minimize.
[2024-05-28 13:46:47] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 2 ms to minimize.
[2024-05-28 13:46:47] [INFO ] Deduced a trap composed of 302 places in 157 ms of which 3 ms to minimize.
[2024-05-28 13:46:48] [INFO ] Deduced a trap composed of 278 places in 167 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:46:48] [INFO ] Deduced a trap composed of 296 places in 167 ms of which 2 ms to minimize.
[2024-05-28 13:46:48] [INFO ] Deduced a trap composed of 249 places in 155 ms of which 3 ms to minimize.
[2024-05-28 13:46:48] [INFO ] Deduced a trap composed of 261 places in 179 ms of which 3 ms to minimize.
[2024-05-28 13:46:49] [INFO ] Deduced a trap composed of 247 places in 166 ms of which 2 ms to minimize.
[2024-05-28 13:46:54] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 4 ms to minimize.
[2024-05-28 13:46:55] [INFO ] Deduced a trap composed of 242 places in 210 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:47:03] [INFO ] Deduced a trap composed of 78 places in 147 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 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:47:12] [INFO ] Deduced a trap composed of 222 places in 230 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:47:32] [INFO ] Deduced a trap composed of 145 places in 210 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/66 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 66 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 60829ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60836ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/462 places, 776/818 transitions.
Applied a total of 0 rules in 5 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106300 ms. Remains : 456/462 places, 776/818 transitions.
[2024-05-28 13:47:35] [INFO ] Flatten gal took : 20 ms
[2024-05-28 13:47:35] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:47:35] [INFO ] Input system was already deterministic with 776 transitions.
[2024-05-28 13:47:35] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:47:35] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:47:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality7112860256293055226.gal : 4 ms
[2024-05-28 13:47:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality3796939741849009732.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/CTLCardinality7112860256293055226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3796939741849009732.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 13:48:05] [INFO ] Flatten gal took : 35 ms
[2024-05-28 13:48:05] [INFO ] Applying decomposition
[2024-05-28 13:48:05] [INFO ] Flatten gal took : 30 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/graph11298317655729798492.txt' '-o' '/tmp/graph11298317655729798492.bin' '-w' '/tmp/graph11298317655729798492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11298317655729798492.bin' '-l' '-1' '-v' '-w' '/tmp/graph11298317655729798492.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:48:05] [INFO ] Decomposing Gal with order
[2024-05-28 13:48:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:48:05] [INFO ] Removed a total of 586 redundant transitions.
[2024-05-28 13:48:05] [INFO ] Flatten gal took : 125 ms
[2024-05-28 13:48:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 19 ms.
[2024-05-28 13:48:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality2323985537688220204.gal : 12 ms
[2024-05-28 13:48:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality6211824472992948072.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/CTLCardinality2323985537688220204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6211824472992948072.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Applied a total of 0 rules in 5 ms. Remains 462 /462 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Running 816 sub problems to find dead transitions.
[2024-05-28 13:48:36] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2024-05-28 13:48:36] [INFO ] Computed 38 invariants in 21 ms
[2024-05-28 13:48:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:48:42] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:48:42] [INFO ] Deduced a trap composed of 130 places in 233 ms of which 4 ms to minimize.
[2024-05-28 13:48:42] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-28 13:48:42] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-28 13:48:43] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 2 ms to minimize.
[2024-05-28 13:48:43] [INFO ] Deduced a trap composed of 235 places in 209 ms of which 3 ms to minimize.
[2024-05-28 13:48:43] [INFO ] Deduced a trap composed of 277 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:48:43] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 3 ms to minimize.
[2024-05-28 13:48:46] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-28 13:48:46] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 2 ms to minimize.
[2024-05-28 13:48:47] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 4 ms to minimize.
[2024-05-28 13:48:49] [INFO ] Deduced a trap composed of 223 places in 232 ms of which 4 ms to minimize.
[2024-05-28 13:48:50] [INFO ] Deduced a trap composed of 264 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:48:50] [INFO ] Deduced a trap composed of 256 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:48:50] [INFO ] Deduced a trap composed of 214 places in 178 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 816 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 460/1268 variables, and 51 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:49:03] [INFO ] Deduced a trap composed of 263 places in 232 ms of which 3 ms to minimize.
[2024-05-28 13:49:03] [INFO ] Deduced a trap composed of 295 places in 196 ms of which 2 ms to minimize.
[2024-05-28 13:49:03] [INFO ] Deduced a trap composed of 258 places in 175 ms of which 2 ms to minimize.
[2024-05-28 13:49:04] [INFO ] Deduced a trap composed of 234 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:49:09] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 3 ms to minimize.
[2024-05-28 13:49:09] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 13:49:12] [INFO ] Deduced a trap composed of 191 places in 191 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1268 variables, and 58 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 22/22 constraints]
After SMT, in 40762ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40771ms
[2024-05-28 13:49:16] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 13:49:16] [INFO ] Invariant cache hit.
[2024-05-28 13:49:17] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-28 13:49:17] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 13:49:17] [INFO ] Invariant cache hit.
[2024-05-28 13:49:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:49:22] [INFO ] Implicit Places using invariants and state equation in 5264 ms returned []
Implicit Place search using SMT with State Equation took 5612 ms to find 0 implicit places.
Running 816 sub problems to find dead transitions.
[2024-05-28 13:49:22] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 13:49:22] [INFO ] Invariant cache hit.
[2024-05-28 13:49:22] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:49:28] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:49:28] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:49:28] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:49:28] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:49:28] [INFO ] Deduced a trap composed of 65 places in 36 ms of which 1 ms to minimize.
[2024-05-28 13:49:28] [INFO ] Deduced a trap composed of 251 places in 179 ms of which 3 ms to minimize.
[2024-05-28 13:49:29] [INFO ] Deduced a trap composed of 134 places in 206 ms of which 3 ms to minimize.
[2024-05-28 13:49:29] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:49:29] [INFO ] Deduced a trap composed of 278 places in 208 ms of which 3 ms to minimize.
[2024-05-28 13:49:30] [INFO ] Deduced a trap composed of 254 places in 261 ms of which 3 ms to minimize.
[2024-05-28 13:49:30] [INFO ] Deduced a trap composed of 264 places in 233 ms of which 4 ms to minimize.
[2024-05-28 13:49:30] [INFO ] Deduced a trap composed of 259 places in 238 ms of which 4 ms to minimize.
[2024-05-28 13:49:30] [INFO ] Deduced a trap composed of 247 places in 208 ms of which 4 ms to minimize.
[2024-05-28 13:49:31] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 3 ms to minimize.
[2024-05-28 13:49:35] [INFO ] Deduced a trap composed of 228 places in 199 ms of which 3 ms to minimize.
[2024-05-28 13:49:35] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:49:36] [INFO ] Deduced a trap composed of 327 places in 245 ms of which 4 ms to minimize.
[2024-05-28 13:49:36] [INFO ] Deduced a trap composed of 239 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:49:37] [INFO ] Deduced a trap composed of 236 places in 236 ms of which 3 ms to minimize.
[2024-05-28 13:49:37] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:49:42] [INFO ] Deduced a trap composed of 225 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:49:43] [INFO ] Deduced a trap composed of 275 places in 218 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:49:50] [INFO ] Deduced a trap composed of 247 places in 158 ms of which 2 ms to minimize.
[2024-05-28 13:49:52] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 60 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 13:49:56] [INFO ] Deduced a trap composed of 247 places in 163 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/462 variables, 2/63 constraints. Problems are: Problem set: 66 solved, 750 unsolved
[2024-05-28 13:50:10] [INFO ] Deduced a trap composed of 219 places in 238 ms of which 4 ms to minimize.
[2024-05-28 13:50:10] [INFO ] Deduced a trap composed of 88 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:50:18] [INFO ] Deduced a trap composed of 197 places in 173 ms of which 5 ms to minimize.
[2024-05-28 13:50:19] [INFO ] Deduced a trap composed of 214 places in 209 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 4/67 constraints. Problems are: Problem set: 66 solved, 750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1268 variables, and 67 constraints, problems are : Problem set: 66 solved, 750 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 29/29 constraints]
After SMT, in 60874ms problems are : Problem set: 66 solved, 750 unsolved
Search for dead transitions found 66 dead transitions in 60888ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in LTL mode, iteration 1 : 462/462 places, 752/818 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 460 transition count 740
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 448 transition count 728
Applied a total of 14 rules in 16 ms. Remains 448 /462 variables (removed 14) and now considering 728/752 (removed 24) transitions.
[2024-05-28 13:50:23] [INFO ] Flow matrix only has 716 transitions (discarded 12 similar events)
// Phase 1: matrix 716 rows 448 cols
[2024-05-28 13:50:23] [INFO ] Computed 38 invariants in 7 ms
[2024-05-28 13:50:23] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-28 13:50:23] [INFO ] Flow matrix only has 716 transitions (discarded 12 similar events)
[2024-05-28 13:50:23] [INFO ] Invariant cache hit.
[2024-05-28 13:50:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:50:27] [INFO ] Implicit Places using invariants and state equation in 4055 ms returned []
Implicit Place search using SMT with State Equation took 4448 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 448/462 places, 728/818 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111744 ms. Remains : 448/462 places, 728/818 transitions.
[2024-05-28 13:50:27] [INFO ] Flatten gal took : 44 ms
[2024-05-28 13:50:27] [INFO ] Flatten gal took : 32 ms
[2024-05-28 13:50:27] [INFO ] Input system was already deterministic with 728 transitions.
[2024-05-28 13:50:27] [INFO ] Flatten gal took : 26 ms
[2024-05-28 13:50:27] [INFO ] Flatten gal took : 26 ms
[2024-05-28 13:50:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality7431522155957429413.gal : 5 ms
[2024-05-28 13:50:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality8115623962289639075.ctl : 4 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/CTLCardinality7431522155957429413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8115623962289639075.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 13:50:58] [INFO ] Flatten gal took : 37 ms
[2024-05-28 13:50:58] [INFO ] Applying decomposition
[2024-05-28 13:50:58] [INFO ] Flatten gal took : 30 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/graph15972194945973050420.txt' '-o' '/tmp/graph15972194945973050420.bin' '-w' '/tmp/graph15972194945973050420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15972194945973050420.bin' '-l' '-1' '-v' '-w' '/tmp/graph15972194945973050420.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:50:58] [INFO ] Decomposing Gal with order
[2024-05-28 13:50:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:50:58] [INFO ] Removed a total of 701 redundant transitions.
[2024-05-28 13:50:58] [INFO ] Flatten gal took : 87 ms
[2024-05-28 13:50:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 24 ms.
[2024-05-28 13:50:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality13344489316753239432.gal : 17 ms
[2024-05-28 13:50:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality12489948158616482931.ctl : 30 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/CTLCardinality13344489316753239432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12489948158616482931.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 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 462 transition count 788
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 432 transition count 782
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 426 transition count 782
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 72 place count 426 transition count 734
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 168 place count 378 transition count 734
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 276 place count 324 transition count 680
Applied a total of 276 rules in 76 ms. Remains 324 /462 variables (removed 138) and now considering 680/818 (removed 138) transitions.
Running 678 sub problems to find dead transitions.
[2024-05-28 13:51:28] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 324 cols
[2024-05-28 13:51:28] [INFO ] Computed 38 invariants in 13 ms
[2024-05-28 13:51:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 13:51:32] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-28 13:51:32] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 2 ms to minimize.
[2024-05-28 13:51:33] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-05-28 13:51:33] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:51:33] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:51:33] [INFO ] Deduced a trap composed of 152 places in 210 ms of which 3 ms to minimize.
[2024-05-28 13:51:33] [INFO ] Deduced a trap composed of 121 places in 181 ms of which 3 ms to minimize.
[2024-05-28 13:51:33] [INFO ] Deduced a trap composed of 125 places in 175 ms of which 3 ms to minimize.
[2024-05-28 13:51:34] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-28 13:51:34] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:51:37] [INFO ] Deduced a trap composed of 109 places in 173 ms of which 2 ms to minimize.
[2024-05-28 13:51:37] [INFO ] Deduced a trap composed of 123 places in 143 ms of which 2 ms to minimize.
[2024-05-28 13:51:38] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 3 ms to minimize.
[2024-05-28 13:51:38] [INFO ] Deduced a trap composed of 147 places in 164 ms of which 2 ms to minimize.
[2024-05-28 13:51:39] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 13:51:40] [INFO ] Deduced a trap composed of 184 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/992 variables, and 52 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 13:51:55] [INFO ] Deduced a trap composed of 114 places in 173 ms of which 3 ms to minimize.
[2024-05-28 13:51:55] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 13:52:04] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 13:52:08] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/992 variables, and 57 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 21/21 constraints]
After SMT, in 40787ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 40800ms
[2024-05-28 13:52:09] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2024-05-28 13:52:09] [INFO ] Invariant cache hit.
[2024-05-28 13:52:09] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-28 13:52:09] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2024-05-28 13:52:09] [INFO ] Invariant cache hit.
[2024-05-28 13:52:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:52:11] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned []
Implicit Place search using SMT with State Equation took 2455 ms to find 0 implicit places.
[2024-05-28 13:52:11] [INFO ] Redundant transitions in 13 ms returned []
Running 678 sub problems to find dead transitions.
[2024-05-28 13:52:11] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2024-05-28 13:52:11] [INFO ] Invariant cache hit.
[2024-05-28 13:52:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 13:52:15] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2024-05-28 13:52:16] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:52:16] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:52:16] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:52:16] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:52:16] [INFO ] Deduced a trap composed of 133 places in 204 ms of which 3 ms to minimize.
[2024-05-28 13:52:16] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 13:52:21] [INFO ] Deduced a trap composed of 184 places in 181 ms of which 2 ms to minimize.
[2024-05-28 13:52:23] [INFO ] Deduced a trap composed of 114 places in 166 ms of which 3 ms to minimize.
[2024-05-28 13:52:24] [INFO ] Deduced a trap composed of 147 places in 190 ms of which 2 ms to minimize.
[2024-05-28 13:52:24] [INFO ] Deduced a trap composed of 166 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-28 13:52:28] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 1 ms to minimize.
[2024-05-28 13:52:28] [INFO ] Deduced a trap composed of 130 places in 202 ms of which 5 ms to minimize.
[2024-05-28 13:52:29] [INFO ] Deduced a trap composed of 125 places in 172 ms of which 2 ms to minimize.
[2024-05-28 13:52:29] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 3 ms to minimize.
[2024-05-28 13:52:31] [INFO ] Deduced a trap composed of 135 places in 148 ms of which 3 ms to minimize.
[2024-05-28 13:52:31] [INFO ] Deduced a trap composed of 129 places in 166 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 6 (OVERLAPS) 2/324 variables, 2/55 constraints. Problems are: Problem set: 66 solved, 612 unsolved
[2024-05-28 13:52:41] [INFO ] Deduced a trap composed of 115 places in 185 ms of which 3 ms to minimize.
[2024-05-28 13:52:41] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 2/57 constraints. Problems are: Problem set: 66 solved, 612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 324/992 variables, and 57 constraints, problems are : Problem set: 66 solved, 612 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 66 solved, 612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 12/12 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 24/36 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 17/53 constraints. Problems are: Problem set: 66 solved, 612 unsolved
[2024-05-28 13:52:45] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 3 ms to minimize.
[2024-05-28 13:52:47] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:52:47] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 3/56 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/56 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 5 (OVERLAPS) 2/324 variables, 2/58 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 2/60 constraints. Problems are: Problem set: 66 solved, 612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/992 variables, and 60 constraints, problems are : Problem set: 66 solved, 612 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 22/22 constraints]
After SMT, in 60808ms problems are : Problem set: 66 solved, 612 unsolved
Search for dead transitions found 66 dead transitions in 60821ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 324/462 places, 614/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 310 transition count 590
Applied a total of 12 rules in 16 ms. Remains 310 /324 variables (removed 14) and now considering 590/614 (removed 24) transitions.
[2024-05-28 13:53:12] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
// Phase 1: matrix 578 rows 310 cols
[2024-05-28 13:53:12] [INFO ] Computed 38 invariants in 16 ms
[2024-05-28 13:53:13] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-28 13:53:13] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-05-28 13:53:13] [INFO ] Invariant cache hit.
[2024-05-28 13:53:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:53:14] [INFO ] Implicit Places using invariants and state equation in 1796 ms returned []
Implicit Place search using SMT with State Equation took 2124 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 310/462 places, 590/818 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 106323 ms. Remains : 310/462 places, 590/818 transitions.
[2024-05-28 13:53:14] [INFO ] Flatten gal took : 33 ms
[2024-05-28 13:53:14] [INFO ] Flatten gal took : 30 ms
[2024-05-28 13:53:15] [INFO ] Input system was already deterministic with 590 transitions.
RANDOM walk for 418 steps (0 resets) in 7 ms. (52 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 13:53:15] [INFO ] Flatten gal took : 23 ms
[2024-05-28 13:53:15] [INFO ] Flatten gal took : 24 ms
[2024-05-28 13:53:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6802371502891445841.gal : 4 ms
[2024-05-28 13:53:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18339755369899941448.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/ReachabilityCardinality6802371502891445841.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18339755369899941448.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 9 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:53:15] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-05-28 13:53:15] [INFO ] Computed 38 invariants in 9 ms
[2024-05-28 13:53:15] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:53:21] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-28 13:53:21] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:53:21] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:53:21] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-05-28 13:53:21] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:53:21] [INFO ] Deduced a trap composed of 240 places in 241 ms of which 4 ms to minimize.
[2024-05-28 13:53:22] [INFO ] Deduced a trap composed of 139 places in 241 ms of which 3 ms to minimize.
[2024-05-28 13:53:22] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:53:22] [INFO ] Deduced a trap composed of 271 places in 264 ms of which 4 ms to minimize.
[2024-05-28 13:53:23] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 2 ms to minimize.
[2024-05-28 13:53:23] [INFO ] Deduced a trap composed of 265 places in 245 ms of which 4 ms to minimize.
[2024-05-28 13:53:27] [INFO ] Deduced a trap composed of 248 places in 233 ms of which 3 ms to minimize.
[2024-05-28 13:53:28] [INFO ] Deduced a trap composed of 223 places in 197 ms of which 2 ms to minimize.
[2024-05-28 13:53:28] [INFO ] Deduced a trap composed of 241 places in 187 ms of which 3 ms to minimize.
[2024-05-28 13:53:30] [INFO ] Deduced a trap composed of 110 places in 228 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:53:32] [INFO ] Deduced a trap composed of 262 places in 236 ms of which 3 ms to minimize.
[2024-05-28 13:53:32] [INFO ] Deduced a trap composed of 269 places in 224 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:53:40] [INFO ] Deduced a trap composed of 309 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:53:40] [INFO ] Deduced a trap composed of 298 places in 171 ms of which 3 ms to minimize.
[2024-05-28 13:53:41] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-05-28 13:53:45] [INFO ] Deduced a trap composed of 243 places in 256 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:53:55] [INFO ] Deduced a trap composed of 242 places in 276 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 22/22 constraints]
After SMT, in 40766ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40775ms
[2024-05-28 13:53:55] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:53:55] [INFO ] Invariant cache hit.
[2024-05-28 13:53:56] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-28 13:53:56] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:53:56] [INFO ] Invariant cache hit.
[2024-05-28 13:53:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 13:54:00] [INFO ] Implicit Places using invariants and state equation in 3941 ms returned []
Implicit Place search using SMT with State Equation took 4312 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-05-28 13:54:00] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 13:54:00] [INFO ] Invariant cache hit.
[2024-05-28 13:54:00] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:54:06] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-28 13:54:06] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-28 13:54:06] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:54:06] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-28 13:54:07] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 270 places in 214 ms of which 4 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 286 places in 253 ms of which 4 ms to minimize.
[2024-05-28 13:54:09] [INFO ] Deduced a trap composed of 256 places in 231 ms of which 3 ms to minimize.
[2024-05-28 13:54:10] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 4 ms to minimize.
[2024-05-28 13:54:10] [INFO ] Deduced a trap composed of 268 places in 232 ms of which 4 ms to minimize.
[2024-05-28 13:54:10] [INFO ] Deduced a trap composed of 245 places in 192 ms of which 3 ms to minimize.
[2024-05-28 13:54:10] [INFO ] Deduced a trap composed of 241 places in 182 ms of which 3 ms to minimize.
[2024-05-28 13:54:11] [INFO ] Deduced a trap composed of 288 places in 229 ms of which 4 ms to minimize.
[2024-05-28 13:54:11] [INFO ] Deduced a trap composed of 232 places in 215 ms of which 2 ms to minimize.
[2024-05-28 13:54:11] [INFO ] Deduced a trap composed of 248 places in 243 ms of which 4 ms to minimize.
[2024-05-28 13:54:14] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 3 ms to minimize.
[2024-05-28 13:54:14] [INFO ] Deduced a trap composed of 144 places in 228 ms of which 4 ms to minimize.
[2024-05-28 13:54:15] [INFO ] Deduced a trap composed of 302 places in 170 ms of which 2 ms to minimize.
[2024-05-28 13:54:16] [INFO ] Deduced a trap composed of 278 places in 175 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:54:16] [INFO ] Deduced a trap composed of 296 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:54:16] [INFO ] Deduced a trap composed of 249 places in 213 ms of which 4 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 261 places in 214 ms of which 3 ms to minimize.
[2024-05-28 13:54:17] [INFO ] Deduced a trap composed of 247 places in 194 ms of which 4 ms to minimize.
[2024-05-28 13:54:22] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:54:23] [INFO ] Deduced a trap composed of 242 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:54:32] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 13:54:45] [INFO ] Deduced a trap composed of 244 places in 146 ms of which 3 ms to minimize.
[2024-05-28 13:54:46] [INFO ] Deduced a trap composed of 288 places in 196 ms of which 3 ms to minimize.
[2024-05-28 13:54:46] [INFO ] Deduced a trap composed of 222 places in 175 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/455 variables, 1/67 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-05-28 13:55:00] [INFO ] Deduced a trap composed of 320 places in 159 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 68 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 31/31 constraints]
After SMT, in 60999ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 61015ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/462 places, 776/818 transitions.
Applied a total of 0 rules in 4 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106122 ms. Remains : 456/462 places, 776/818 transitions.
[2024-05-28 13:55:01] [INFO ] Flatten gal took : 19 ms
[2024-05-28 13:55:01] [INFO ] Flatten gal took : 21 ms
[2024-05-28 13:55:01] [INFO ] Input system was already deterministic with 776 transitions.
[2024-05-28 13:55:01] [INFO ] Flatten gal took : 19 ms
[2024-05-28 13:55:01] [INFO ] Flatten gal took : 19 ms
[2024-05-28 13:55:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality16750842241479611785.gal : 3 ms
[2024-05-28 13:55:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality8686035386377794977.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/CTLCardinality16750842241479611785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8686035386377794977.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 13:55:31] [INFO ] Flatten gal took : 48 ms
[2024-05-28 13:55:31] [INFO ] Applying decomposition
[2024-05-28 13:55:31] [INFO ] Flatten gal took : 37 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/graph9153425674591907000.txt' '-o' '/tmp/graph9153425674591907000.bin' '-w' '/tmp/graph9153425674591907000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9153425674591907000.bin' '-l' '-1' '-v' '-w' '/tmp/graph9153425674591907000.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:55:31] [INFO ] Decomposing Gal with order
[2024-05-28 13:55:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:55:31] [INFO ] Removed a total of 603 redundant transitions.
[2024-05-28 13:55:31] [INFO ] Flatten gal took : 48 ms
[2024-05-28 13:55:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 4 ms.
[2024-05-28 13:55:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality3049427135422151912.gal : 4 ms
[2024-05-28 13:55:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality6889874068624644111.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/CTLCardinality3049427135422151912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6889874068624644111.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 13:56:01] [INFO ] Flatten gal took : 50 ms
[2024-05-28 13:56:02] [INFO ] Flatten gal took : 38 ms
[2024-05-28 13:56:02] [INFO ] Applying decomposition
[2024-05-28 13:56:02] [INFO ] Flatten gal took : 32 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/graph11832250623205241040.txt' '-o' '/tmp/graph11832250623205241040.bin' '-w' '/tmp/graph11832250623205241040.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11832250623205241040.bin' '-l' '-1' '-v' '-w' '/tmp/graph11832250623205241040.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:56:02] [INFO ] Decomposing Gal with order
[2024-05-28 13:56:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:56:02] [INFO ] Removed a total of 719 redundant transitions.
[2024-05-28 13:56:02] [INFO ] Flatten gal took : 53 ms
[2024-05-28 13:56:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 11 ms.
[2024-05-28 13:56:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality6012572774697956942.gal : 6 ms
[2024-05-28 13:56:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality17404199275137028072.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/CTLCardinality6012572774697956942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17404199275137028072.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 7 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 14:10:31] [INFO ] Applying decomposition
[2024-05-28 14:10:31] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:10:31] [INFO ] Decomposing Gal with order
[2024-05-28 14:10:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:10:31] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, P_1617_5, ScheduleTaskE_Idle_5],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 14:10:31] [INFO ] Flatten gal took : 34 ms
[2024-05-28 14:10:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality13218200580412678944.gal : 4 ms
[2024-05-28 14:10:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality15917735015108538240.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/CTLCardinality13218200580412678944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15917735015108538240.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 7 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 14:28:06] [INFO ] Flatten gal took : 33 ms
[2024-05-28 14:28:06] [INFO ] Input system was already deterministic with 818 transitions.
[2024-05-28 14:28:06] [INFO ] Transformed 462 places.
[2024-05-28 14:28:06] [INFO ] Transformed 818 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 14:28:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality11915101798647132121.gal : 8 ms
[2024-05-28 14:28:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality9179543117925297239.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/CTLCardinality11915101798647132121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9179543117925297239.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T06"
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-COL-S02J04T06, 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-171654446300073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T06.tgz
mv PolyORBLF-COL-S02J04T06 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 ;