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-171654447000377.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 PolyORBNT-COL-S05J40, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447000377
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 09:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 10:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 10:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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 PolyORBNT-COL-S05J40-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716923759206

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-28 19:16:00] [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 19:16:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:16:00] [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 19:16:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 19:16:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 627 ms
[2024-05-28 19:16:01] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
[2024-05-28 19:16:01] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-28 19:16:01] [INFO ] Skeletonized 16 HLPN properties in 2 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 40004 steps (3195 resets) in 1834 ms. (21 steps per ms) remains 68/85 properties
BEST_FIRST walk for 4002 steps (169 resets) in 49 ms. (80 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (96 resets) in 31 ms. (125 steps per ms) remains 60/68 properties
BEST_FIRST walk for 4003 steps (105 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (104 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (99 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (138 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (97 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (99 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (92 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4005 steps (104 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (115 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (141 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (97 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (107 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (101 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (99 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (94 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (95 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (94 resets) in 38 ms. (102 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (169 resets) in 51 ms. (76 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (87 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (90 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (96 resets) in 28 ms. (138 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (105 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (133 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (96 resets) in 33 ms. (117 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (108 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (95 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (98 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (127 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (155 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (145 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (102 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (101 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (97 resets) in 25 ms. (154 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (86 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (170 resets) in 27 ms. (142 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (100 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (92 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (92 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (97 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4005 steps (99 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (103 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (155 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (108 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (98 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (122 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (86 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (93 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4007 steps (165 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (137 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 19:16:02] [INFO ] Computed 13 invariants in 5 ms
[2024-05-28 19:16:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp60 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 58 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/46 variables, 5/7 constraints. Problems are: Problem set: 26 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 26 solved, 34 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/48 variables, 6/13 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 58 solved, 2 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 7 (OVERLAPS) 38/86 variables, 48/61 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 1/62 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/62 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/62 constraints. Problems are: Problem set: 59 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 62 constraints, problems are : Problem set: 59 solved, 1 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 59 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/39 variables, 7/7 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/46 variables, 5/12 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/47 variables, 1/13 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/85 variables, 47/60 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 1/61 constraints. Problems are: Problem set: 59 solved, 1 unsolved
Problem AtomicPropp46 is UNSAT
After SMT solving in domain Int declared 85/86 variables, and 62 constraints, problems are : Problem set: 60 solved, 0 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 47/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 607ms 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 PolyORBNT-COL-S05J40-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 19:16:03] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 19:16:03] [INFO ] Flatten gal took : 24 ms
[2024-05-28 19:16:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 19:16:03] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 19:16:03] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 52 ms.
[2024-05-28 19:16:03] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 374 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Applied a total of 0 rules in 36 ms. Remains 629 /629 variables (removed 0) and now considering 935/935 (removed 0) transitions.
Running 929 sub problems to find dead transitions.
[2024-05-28 19:16:03] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2024-05-28 19:16:03] [INFO ] Computed 102 invariants in 48 ms
[2024-05-28 19:16:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 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 TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 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 TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD416 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/627 variables, 9/100 constraints. Problems are: Problem set: 78 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1560 variables, and 100 constraints, problems are : Problem set: 78 solved, 851 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 851 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 3 (OVERLAPS) 9/627 variables, 9/100 constraints. Problems are: Problem set: 78 solved, 851 unsolved
[2024-05-28 19:16:38] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 34 ms to minimize.
[2024-05-28 19:16:45] [INFO ] Deduced a trap composed of 212 places in 243 ms of which 5 ms to minimize.
[2024-05-28 19:16:45] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:16:45] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:16:45] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
SMT process timed out in 42263ms, After SMT, problems are : Problem set: 78 solved, 851 unsolved
Search for dead transitions found 78 dead transitions in 42277ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 78 transitions.
[2024-05-28 19:16:45] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
// Phase 1: matrix 853 rows 629 cols
[2024-05-28 19:16:45] [INFO ] Computed 102 invariants in 35 ms
[2024-05-28 19:16:46] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-28 19:16:46] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 19:16:46] [INFO ] Invariant cache hit.
[2024-05-28 19:16:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:16:48] [INFO ] Implicit Places using invariants and state equation in 2311 ms returned []
Implicit Place search using SMT with State Equation took 2694 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 629/629 places, 857/935 transitions.
Applied a total of 0 rules in 27 ms. Remains 629 /629 variables (removed 0) and now considering 857/857 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45055 ms. Remains : 629/629 places, 857/935 transitions.
Support contains 374 out of 629 places after structural reductions.
[2024-05-28 19:16:48] [INFO ] Flatten gal took : 123 ms
[2024-05-28 19:16:48] [INFO ] Flatten gal took : 92 ms
[2024-05-28 19:16:48] [INFO ] Input system was already deterministic with 857 transitions.
RANDOM walk for 40000 steps (2749 resets) in 1434 ms. (27 steps per ms) remains 33/54 properties
BEST_FIRST walk for 4003 steps (57 resets) in 65 ms. (60 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (54 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (59 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (96 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (72 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (82 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (55 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (61 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (57 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (71 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (69 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (120 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (90 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (77 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (69 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (44 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (98 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (81 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (63 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (98 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (100 resets) in 22 ms. (173 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (53 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (65 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (52 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (63 resets) in 43 ms. (90 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (98 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (73 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (62 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (63 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (68 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (56 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (61 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (120 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
[2024-05-28 19:16:49] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 19:16:49] [INFO ] Invariant cache hit.
[2024-05-28 19:16:49] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 1 (OVERLAPS) 420/606 variables, 87/87 constraints. Problems are: Problem set: 22 solved, 11 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 2/89 constraints. Problems are: Problem set: 26 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/606 variables, 0/89 constraints. Problems are: Problem set: 26 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 16/622 variables, 8/97 constraints. Problems are: Problem set: 26 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 0/97 constraints. Problems are: Problem set: 26 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp49 is UNSAT
After SMT solving in domain Real declared 628/1482 variables, and 102 constraints, problems are : Problem set: 33 solved, 0 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 590ms problems are : Problem set: 33 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 33 atomic propositions for a total of 9 simplifications.
[2024-05-28 19:16:50] [INFO ] Flatten gal took : 44 ms
[2024-05-28 19:16:50] [INFO ] Flatten gal took : 42 ms
[2024-05-28 19:16:50] [INFO ] Input system was already deterministic with 857 transitions.
Support contains 234 out of 629 places (down from 281) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 43 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-05-28 19:16:50] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-05-28 19:16:50] [INFO ] Computed 97 invariants in 25 ms
[2024-05-28 19:16:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 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 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-05-28 19:17:24] [INFO ] Deduced a trap composed of 204 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:17:24] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:17:25] [INFO ] Deduced a trap composed of 15 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:17:28] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 100 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 4/4 constraints]
After SMT, in 41451ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41459ms
[2024-05-28 19:17:31] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:17:31] [INFO ] Invariant cache hit.
[2024-05-28 19:17:32] [INFO ] Implicit Places using invariants in 620 ms returned []
[2024-05-28 19:17:32] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:17:32] [INFO ] Invariant cache hit.
[2024-05-28 19:17:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:17:35] [INFO ] Implicit Places using invariants and state equation in 2691 ms returned []
Implicit Place search using SMT with State Equation took 3313 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-28 19:17:35] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:17:35] [INFO ] Invariant cache hit.
[2024-05-28 19:17:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/623 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:18:01] [INFO ] Deduced a trap composed of 259 places in 240 ms of which 5 ms to minimize.
[2024-05-28 19:18:01] [INFO ] Deduced a trap composed of 271 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:18:02] [INFO ] Deduced a trap composed of 253 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:18:02] [INFO ] Deduced a trap composed of 256 places in 190 ms of which 4 ms to minimize.
[2024-05-28 19:18:02] [INFO ] Deduced a trap composed of 262 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:18:02] [INFO ] Deduced a trap composed of 259 places in 208 ms of which 4 ms to minimize.
[2024-05-28 19:18:02] [INFO ] Deduced a trap composed of 247 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:18:03] [INFO ] Deduced a trap composed of 259 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:18:03] [INFO ] Deduced a trap composed of 256 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:18:05] [INFO ] Deduced a trap composed of 96 places in 271 ms of which 5 ms to minimize.
[2024-05-28 19:18:06] [INFO ] Deduced a trap composed of 241 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:18:06] [INFO ] Deduced a trap composed of 96 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:18:06] [INFO ] Deduced a trap composed of 204 places in 189 ms of which 4 ms to minimize.
SMT process timed out in 31399ms, After SMT, problems are : Problem set: 17 solved, 833 unsolved
Search for dead transitions found 17 dead transitions in 31417ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/857 transitions.
Applied a total of 0 rules in 33 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76273 ms. Remains : 623/629 places, 839/857 transitions.
[2024-05-28 19:18:06] [INFO ] Flatten gal took : 66 ms
[2024-05-28 19:18:06] [INFO ] Flatten gal took : 54 ms
[2024-05-28 19:18:06] [INFO ] Input system was already deterministic with 839 transitions.
[2024-05-28 19:18:06] [INFO ] Flatten gal took : 42 ms
[2024-05-28 19:18:06] [INFO ] Flatten gal took : 41 ms
[2024-05-28 19:18:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality14296157877214377214.gal : 24 ms
[2024-05-28 19:18:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality4078765815463981041.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/CTLCardinality14296157877214377214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4078765815463981041.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 19:18:37] [INFO ] Flatten gal took : 67 ms
[2024-05-28 19:18:37] [INFO ] Applying decomposition
[2024-05-28 19:18:37] [INFO ] Flatten gal took : 48 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/graph17633741117679245560.txt' '-o' '/tmp/graph17633741117679245560.bin' '-w' '/tmp/graph17633741117679245560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17633741117679245560.bin' '-l' '-1' '-v' '-w' '/tmp/graph17633741117679245560.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:18:37] [INFO ] Decomposing Gal with order
[2024-05-28 19:18:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:18:37] [INFO ] Removed a total of 1001 redundant transitions.
[2024-05-28 19:18:37] [INFO ] Flatten gal took : 181 ms
[2024-05-28 19:18:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 26 ms.
[2024-05-28 19:18:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality4817477709386115759.gal : 18 ms
[2024-05-28 19:18:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality9281141879525610423.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/CTLCardinality4817477709386115759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9281141879525610423.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 SI_CTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 812
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 579 transition count 811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 578 transition count 811
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 767
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 534 transition count 767
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 532 transition count 765
Applied a total of 184 rules in 153 ms. Remains 532 /629 variables (removed 97) and now considering 765/857 (removed 92) transitions.
Running 759 sub problems to find dead transitions.
[2024-05-28 19:19:08] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
// Phase 1: matrix 761 rows 532 cols
[2024-05-28 19:19:08] [INFO ] Computed 97 invariants in 20 ms
[2024-05-28 19:19:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:19:14] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 5 ms to minimize.
[2024-05-28 19:19:14] [INFO ] Deduced a trap composed of 163 places in 190 ms of which 3 ms to minimize.
[2024-05-28 19:19:14] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:19:14] [INFO ] Deduced a trap composed of 138 places in 197 ms of which 3 ms to minimize.
[2024-05-28 19:19:15] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 3 ms to minimize.
[2024-05-28 19:19:15] [INFO ] Deduced a trap composed of 166 places in 152 ms of which 2 ms to minimize.
[2024-05-28 19:19:15] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:19:15] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:19:15] [INFO ] Deduced a trap composed of 139 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:19:16] [INFO ] Deduced a trap composed of 139 places in 206 ms of which 3 ms to minimize.
[2024-05-28 19:19:16] [INFO ] Deduced a trap composed of 138 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:19:16] [INFO ] Deduced a trap composed of 138 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:19:17] [INFO ] Deduced a trap composed of 151 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:19:17] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 3 ms to minimize.
[2024-05-28 19:19:17] [INFO ] Deduced a trap composed of 138 places in 194 ms of which 3 ms to minimize.
[2024-05-28 19:19:17] [INFO ] Deduced a trap composed of 138 places in 197 ms of which 4 ms to minimize.
[2024-05-28 19:19:17] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 5 ms to minimize.
[2024-05-28 19:19:18] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 4 ms to minimize.
[2024-05-28 19:19:18] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:19:18] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:19:23] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1293 variables, and 113 constraints, problems are : Problem set: 0 solved, 759 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 21/113 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:19:30] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 4 ms to minimize.
[2024-05-28 19:19:30] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:19:30] [INFO ] Deduced a trap composed of 141 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:19:30] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
[2024-05-28 19:19:31] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:19:31] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 2 ms to minimize.
[2024-05-28 19:19:31] [INFO ] Deduced a trap composed of 141 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:19:31] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 2 ms to minimize.
[2024-05-28 19:19:31] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:19:32] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:19:32] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:19:32] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:19:32] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:19:32] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:19:32] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:19:33] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 4 ms to minimize.
[2024-05-28 19:19:33] [INFO ] Deduced a trap composed of 141 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:19:33] [INFO ] Deduced a trap composed of 138 places in 223 ms of which 3 ms to minimize.
[2024-05-28 19:19:33] [INFO ] Deduced a trap composed of 141 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:19:34] [INFO ] Deduced a trap composed of 138 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:19:35] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 6 ms to minimize.
[2024-05-28 19:19:36] [INFO ] Deduced a trap composed of 141 places in 200 ms of which 4 ms to minimize.
[2024-05-28 19:19:36] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 4 ms to minimize.
[2024-05-28 19:19:37] [INFO ] Deduced a trap composed of 141 places in 175 ms of which 4 ms to minimize.
[2024-05-28 19:19:37] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:19:37] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-05-28 19:19:37] [INFO ] Deduced a trap composed of 141 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:19:37] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:19:38] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:19:38] [INFO ] Deduced a trap composed of 169 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:19:38] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:19:38] [INFO ] Deduced a trap composed of 141 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:19:39] [INFO ] Deduced a trap composed of 181 places in 216 ms of which 3 ms to minimize.
[2024-05-28 19:19:39] [INFO ] Deduced a trap composed of 141 places in 195 ms of which 4 ms to minimize.
[2024-05-28 19:19:39] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 4 ms to minimize.
[2024-05-28 19:19:39] [INFO ] Deduced a trap composed of 141 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:19:40] [INFO ] Deduced a trap composed of 141 places in 200 ms of which 4 ms to minimize.
[2024-05-28 19:19:40] [INFO ] Deduced a trap composed of 138 places in 210 ms of which 4 ms to minimize.
[2024-05-28 19:19:40] [INFO ] Deduced a trap composed of 141 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:19:40] [INFO ] Deduced a trap composed of 141 places in 223 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:19:43] [INFO ] Deduced a trap composed of 138 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:19:43] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 3 ms to minimize.
[2024-05-28 19:19:43] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:19:43] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:19:44] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:19:44] [INFO ] Deduced a trap composed of 138 places in 201 ms of which 4 ms to minimize.
[2024-05-28 19:19:44] [INFO ] Deduced a trap composed of 141 places in 195 ms of which 4 ms to minimize.
[2024-05-28 19:19:44] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 4 ms to minimize.
[2024-05-28 19:19:44] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 2 ms to minimize.
[2024-05-28 19:19:45] [INFO ] Deduced a trap composed of 138 places in 199 ms of which 3 ms to minimize.
[2024-05-28 19:19:45] [INFO ] Deduced a trap composed of 141 places in 244 ms of which 4 ms to minimize.
[2024-05-28 19:19:45] [INFO ] Deduced a trap composed of 138 places in 245 ms of which 3 ms to minimize.
[2024-05-28 19:19:45] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 4 ms to minimize.
[2024-05-28 19:19:46] [INFO ] Deduced a trap composed of 138 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:19:46] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:19:46] [INFO ] Deduced a trap composed of 141 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:19:46] [INFO ] Deduced a trap composed of 138 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:19:47] [INFO ] Deduced a trap composed of 141 places in 237 ms of which 5 ms to minimize.
[2024-05-28 19:19:47] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 4 ms to minimize.
[2024-05-28 19:19:47] [INFO ] Deduced a trap composed of 141 places in 259 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:19:48] [INFO ] Deduced a trap composed of 141 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:19:49] [INFO ] Deduced a trap composed of 141 places in 221 ms of which 4 ms to minimize.
[2024-05-28 19:19:49] [INFO ] Deduced a trap composed of 141 places in 208 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 1)
(s54 1)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1293 variables, and 176 constraints, problems are : Problem set: 0 solved, 759 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/759 constraints, Known Traps: 84/84 constraints]
After SMT, in 41295ms problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 41304ms
[2024-05-28 19:19:49] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:19:49] [INFO ] Invariant cache hit.
[2024-05-28 19:19:49] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-28 19:19:49] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:19:49] [INFO ] Invariant cache hit.
[2024-05-28 19:19:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:19:52] [INFO ] Implicit Places using invariants and state equation in 2840 ms returned []
Implicit Place search using SMT with State Equation took 3309 ms to find 0 implicit places.
[2024-05-28 19:19:52] [INFO ] Redundant transitions in 62 ms returned []
Running 759 sub problems to find dead transitions.
[2024-05-28 19:19:52] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:19:52] [INFO ] Invariant cache hit.
[2024-05-28 19:19:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:19:59] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 4 ms to minimize.
[2024-05-28 19:19:59] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 4 ms to minimize.
[2024-05-28 19:19:59] [INFO ] Deduced a trap composed of 157 places in 191 ms of which 3 ms to minimize.
[2024-05-28 19:20:00] [INFO ] Deduced a trap composed of 138 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:20:00] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:20:00] [INFO ] Deduced a trap composed of 138 places in 227 ms of which 3 ms to minimize.
[2024-05-28 19:20:00] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 3 ms to minimize.
[2024-05-28 19:20:00] [INFO ] Deduced a trap composed of 138 places in 227 ms of which 4 ms to minimize.
[2024-05-28 19:20:01] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:20:01] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:20:01] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 3 ms to minimize.
[2024-05-28 19:20:01] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 5 ms to minimize.
[2024-05-28 19:20:02] [INFO ] Deduced a trap composed of 138 places in 216 ms of which 4 ms to minimize.
[2024-05-28 19:20:02] [INFO ] Deduced a trap composed of 154 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:20:02] [INFO ] Deduced a trap composed of 154 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:20:02] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 3 ms to minimize.
[2024-05-28 19:20:03] [INFO ] Deduced a trap composed of 138 places in 216 ms of which 3 ms to minimize.
[2024-05-28 19:20:03] [INFO ] Deduced a trap composed of 138 places in 214 ms of which 3 ms to minimize.
[2024-05-28 19:20:03] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 3 ms to minimize.
[2024-05-28 19:20:03] [INFO ] Deduced a trap composed of 138 places in 216 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:20:06] [INFO ] Deduced a trap composed of 98 places in 205 ms of which 3 ms to minimize.
[2024-05-28 19:20:06] [INFO ] Deduced a trap composed of 98 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:20:06] [INFO ] Deduced a trap composed of 98 places in 206 ms of which 3 ms to minimize.
[2024-05-28 19:20:07] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 3 ms to minimize.
[2024-05-28 19:20:07] [INFO ] Deduced a trap composed of 138 places in 205 ms of which 4 ms to minimize.
[2024-05-28 19:20:07] [INFO ] Deduced a trap composed of 138 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:20:07] [INFO ] Deduced a trap composed of 98 places in 204 ms of which 4 ms to minimize.
[2024-05-28 19:20:08] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 4 ms to minimize.
[2024-05-28 19:20:08] [INFO ] Deduced a trap composed of 98 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:20:08] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:20:08] [INFO ] Deduced a trap composed of 98 places in 205 ms of which 4 ms to minimize.
[2024-05-28 19:20:08] [INFO ] Deduced a trap composed of 98 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:20:09] [INFO ] Deduced a trap composed of 138 places in 201 ms of which 4 ms to minimize.
[2024-05-28 19:20:09] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 4 ms to minimize.
[2024-05-28 19:20:09] [INFO ] Deduced a trap composed of 98 places in 202 ms of which 4 ms to minimize.
[2024-05-28 19:20:09] [INFO ] Deduced a trap composed of 98 places in 180 ms of which 5 ms to minimize.
[2024-05-28 19:20:09] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 4 ms to minimize.
[2024-05-28 19:20:10] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 3 ms to minimize.
[2024-05-28 19:20:10] [INFO ] Deduced a trap composed of 138 places in 247 ms of which 3 ms to minimize.
[2024-05-28 19:20:10] [INFO ] Deduced a trap composed of 138 places in 217 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 5 (OVERLAPS) 4/531 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:20:23] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1293 variables, and 137 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 41/133 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:20:25] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-28 19:20:27] [INFO ] Deduced a trap composed of 163 places in 206 ms of which 3 ms to minimize.
[2024-05-28 19:20:27] [INFO ] Deduced a trap composed of 172 places in 183 ms of which 4 ms to minimize.
[2024-05-28 19:20:27] [INFO ] Deduced a trap composed of 141 places in 200 ms of which 3 ms to minimize.
[2024-05-28 19:20:27] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:20:27] [INFO ] Deduced a trap composed of 141 places in 200 ms of which 4 ms to minimize.
[2024-05-28 19:20:28] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:20:28] [INFO ] Deduced a trap composed of 141 places in 205 ms of which 3 ms to minimize.
[2024-05-28 19:20:28] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 3 ms to minimize.
[2024-05-28 19:20:28] [INFO ] Deduced a trap composed of 152 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:20:28] [INFO ] Deduced a trap composed of 141 places in 172 ms of which 3 ms to minimize.
[2024-05-28 19:20:29] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
[2024-05-28 19:20:29] [INFO ] Deduced a trap composed of 141 places in 229 ms of which 3 ms to minimize.
[2024-05-28 19:20:29] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:20:29] [INFO ] Deduced a trap composed of 138 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:20:29] [INFO ] Deduced a trap composed of 141 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:20:30] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:20:30] [INFO ] Deduced a trap composed of 156 places in 183 ms of which 2 ms to minimize.
[2024-05-28 19:20:30] [INFO ] Deduced a trap composed of 141 places in 179 ms of which 3 ms to minimize.
[2024-05-28 19:20:30] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:20:33] [INFO ] Deduced a trap composed of 169 places in 223 ms of which 3 ms to minimize.
[2024-05-28 19:20:33] [INFO ] Deduced a trap composed of 175 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:20:33] [INFO ] Deduced a trap composed of 175 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:20:34] [INFO ] Deduced a trap composed of 178 places in 198 ms of which 3 ms to minimize.
[2024-05-28 19:20:34] [INFO ] Deduced a trap composed of 163 places in 214 ms of which 6 ms to minimize.
[2024-05-28 19:20:34] [INFO ] Deduced a trap composed of 178 places in 227 ms of which 4 ms to minimize.
[2024-05-28 19:20:34] [INFO ] Deduced a trap composed of 169 places in 197 ms of which 3 ms to minimize.
[2024-05-28 19:20:34] [INFO ] Deduced a trap composed of 169 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:20:35] [INFO ] Deduced a trap composed of 163 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:20:35] [INFO ] Deduced a trap composed of 172 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:20:35] [INFO ] Deduced a trap composed of 172 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:20:35] [INFO ] Deduced a trap composed of 175 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:20:36] [INFO ] Deduced a trap composed of 141 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:20:36] [INFO ] Deduced a trap composed of 154 places in 215 ms of which 3 ms to minimize.
[2024-05-28 19:20:36] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:20:36] [INFO ] Deduced a trap composed of 141 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:20:37] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:20:37] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:20:37] [INFO ] Deduced a trap composed of 175 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:20:37] [INFO ] Deduced a trap composed of 175 places in 220 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:20:40] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 2 ms to minimize.
[2024-05-28 19:20:41] [INFO ] Deduced a trap composed of 138 places in 194 ms of which 4 ms to minimize.
[2024-05-28 19:20:41] [INFO ] Deduced a trap composed of 141 places in 192 ms of which 3 ms to minimize.
[2024-05-28 19:20:41] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 3 ms to minimize.
[2024-05-28 19:20:41] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 4 ms to minimize.
[2024-05-28 19:20:41] [INFO ] Deduced a trap composed of 138 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:20:42] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 4 ms to minimize.
[2024-05-28 19:20:42] [INFO ] Deduced a trap composed of 138 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:20:42] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:20:42] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 10 ms to minimize.
[2024-05-28 19:20:43] [INFO ] Deduced a trap composed of 138 places in 208 ms of which 4 ms to minimize.
[2024-05-28 19:20:43] [INFO ] Deduced a trap composed of 138 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:20:43] [INFO ] Deduced a trap composed of 138 places in 205 ms of which 4 ms to minimize.
[2024-05-28 19:20:43] [INFO ] Deduced a trap composed of 138 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:20:44] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 4 ms to minimize.
[2024-05-28 19:20:44] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:20:44] [INFO ] Deduced a trap composed of 138 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:20:44] [INFO ] Deduced a trap composed of 138 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:20:45] [INFO ] Deduced a trap composed of 141 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:20:45] [INFO ] Deduced a trap composed of 141 places in 221 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:20:48] [INFO ] Deduced a trap composed of 141 places in 209 ms of which 3 ms to minimize.
[2024-05-28 19:20:49] [INFO ] Deduced a trap composed of 141 places in 200 ms of which 4 ms to minimize.
[2024-05-28 19:20:49] [INFO ] Deduced a trap composed of 141 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:20:49] [INFO ] Deduced a trap composed of 141 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:20:49] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 3 ms to minimize.
[2024-05-28 19:20:49] [INFO ] Deduced a trap composed of 141 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:20:50] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 4 ms to minimize.
[2024-05-28 19:20:50] [INFO ] Deduced a trap composed of 141 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:20:50] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 4 ms to minimize.
[2024-05-28 19:20:50] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 4 ms to minimize.
[2024-05-28 19:20:50] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:20:50] [INFO ] Deduced a trap composed of 141 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:20:51] [INFO ] Deduced a trap composed of 141 places in 137 ms of which 3 ms to minimize.
[2024-05-28 19:20:51] [INFO ] Deduced a trap composed of 141 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:20:51] [INFO ] Deduced a trap composed of 141 places in 179 ms of which 3 ms to minimize.
[2024-05-28 19:20:51] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 2 ms to minimize.
[2024-05-28 19:20:51] [INFO ] Deduced a trap composed of 138 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:20:52] [INFO ] Deduced a trap composed of 141 places in 209 ms of which 3 ms to minimize.
[2024-05-28 19:20:52] [INFO ] Deduced a trap composed of 141 places in 243 ms of which 3 ms to minimize.
[2024-05-28 19:20:52] [INFO ] Deduced a trap composed of 141 places in 218 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1293 variables, and 213 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/759 constraints, Known Traps: 121/121 constraints]
After SMT, in 61411ms problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 61423ms
Starting structural reductions in SI_CTL mode, iteration 1 : 532/629 places, 765/857 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 106266 ms. Remains : 532/629 places, 765/857 transitions.
[2024-05-28 19:20:54] [INFO ] Flatten gal took : 52 ms
[2024-05-28 19:20:54] [INFO ] Flatten gal took : 54 ms
[2024-05-28 19:20:54] [INFO ] Input system was already deterministic with 765 transitions.
[2024-05-28 19:20:54] [INFO ] Flatten gal took : 38 ms
[2024-05-28 19:20:54] [INFO ] Flatten gal took : 38 ms
[2024-05-28 19:20:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality9307169201849927872.gal : 7 ms
[2024-05-28 19:20:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality16685168763788741072.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/CTLCardinality9307169201849927872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16685168763788741072.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 19:21:24] [INFO ] Flatten gal took : 53 ms
[2024-05-28 19:21:24] [INFO ] Applying decomposition
[2024-05-28 19:21:24] [INFO ] Flatten gal took : 41 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/graph3666263075694241241.txt' '-o' '/tmp/graph3666263075694241241.bin' '-w' '/tmp/graph3666263075694241241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3666263075694241241.bin' '-l' '-1' '-v' '-w' '/tmp/graph3666263075694241241.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:21:24] [INFO ] Decomposing Gal with order
[2024-05-28 19:21:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:21:24] [INFO ] Removed a total of 665 redundant transitions.
[2024-05-28 19:21:25] [INFO ] Flatten gal took : 163 ms
[2024-05-28 19:21:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 636 labels/synchronizations in 61 ms.
[2024-05-28 19:21:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality11289817980200631230.gal : 12 ms
[2024-05-28 19:21:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality14260651669321433552.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/CTLCardinality11289817980200631230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14260651669321433552.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 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 812
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 579 transition count 811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 578 transition count 811
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 767
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 534 transition count 767
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 533 transition count 766
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 533 transition count 766
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 532 transition count 765
Applied a total of 184 rules in 108 ms. Remains 532 /629 variables (removed 97) and now considering 765/857 (removed 92) transitions.
Running 759 sub problems to find dead transitions.
[2024-05-28 19:21:55] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
// Phase 1: matrix 761 rows 532 cols
[2024-05-28 19:21:55] [INFO ] Computed 97 invariants in 17 ms
[2024-05-28 19:21:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:22:02] [INFO ] Deduced a trap composed of 138 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:22:02] [INFO ] Deduced a trap composed of 138 places in 194 ms of which 4 ms to minimize.
[2024-05-28 19:22:02] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 4 ms to minimize.
[2024-05-28 19:22:02] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:22:03] [INFO ] Deduced a trap composed of 138 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:22:03] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:22:03] [INFO ] Deduced a trap composed of 138 places in 210 ms of which 4 ms to minimize.
[2024-05-28 19:22:03] [INFO ] Deduced a trap composed of 138 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:22:04] [INFO ] Deduced a trap composed of 138 places in 228 ms of which 3 ms to minimize.
[2024-05-28 19:22:04] [INFO ] Deduced a trap composed of 138 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:22:04] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:22:04] [INFO ] Deduced a trap composed of 138 places in 221 ms of which 4 ms to minimize.
[2024-05-28 19:22:05] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 3 ms to minimize.
[2024-05-28 19:22:05] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 4 ms to minimize.
[2024-05-28 19:22:05] [INFO ] Deduced a trap composed of 138 places in 208 ms of which 4 ms to minimize.
[2024-05-28 19:22:05] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:22:05] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 2 ms to minimize.
[2024-05-28 19:22:07] [INFO ] Deduced a trap composed of 138 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:22:07] [INFO ] Deduced a trap composed of 98 places in 182 ms of which 4 ms to minimize.
[2024-05-28 19:22:08] [INFO ] Deduced a trap composed of 98 places in 256 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:22:08] [INFO ] Deduced a trap composed of 158 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:22:09] [INFO ] Deduced a trap composed of 138 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:22:09] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:22:09] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:22:09] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 4 ms to minimize.
[2024-05-28 19:22:10] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:22:10] [INFO ] Deduced a trap composed of 138 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:22:10] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 4 ms to minimize.
[2024-05-28 19:22:10] [INFO ] Deduced a trap composed of 138 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:22:11] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 3 ms to minimize.
[2024-05-28 19:22:11] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:22:11] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:22:11] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:22:11] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:22:12] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 3 ms to minimize.
[2024-05-28 19:22:12] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 4 ms to minimize.
[2024-05-28 19:22:12] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 4 ms to minimize.
[2024-05-28 19:22:12] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:22:12] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 4 ms to minimize.
[2024-05-28 19:22:13] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1293 variables, and 132 constraints, problems are : Problem set: 0 solved, 759 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:22:18] [INFO ] Deduced a trap composed of 139 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:22:18] [INFO ] Deduced a trap composed of 139 places in 187 ms of which 4 ms to minimize.
[2024-05-28 19:22:18] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 3 ms to minimize.
[2024-05-28 19:22:18] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:22:18] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 4 ms to minimize.
[2024-05-28 19:22:19] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:22:19] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:22:19] [INFO ] Deduced a trap composed of 138 places in 240 ms of which 3 ms to minimize.
[2024-05-28 19:22:19] [INFO ] Deduced a trap composed of 142 places in 251 ms of which 3 ms to minimize.
[2024-05-28 19:22:20] [INFO ] Deduced a trap composed of 139 places in 204 ms of which 4 ms to minimize.
[2024-05-28 19:22:20] [INFO ] Deduced a trap composed of 142 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:22:20] [INFO ] Deduced a trap composed of 138 places in 236 ms of which 3 ms to minimize.
[2024-05-28 19:22:20] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:22:21] [INFO ] Deduced a trap composed of 138 places in 207 ms of which 4 ms to minimize.
[2024-05-28 19:22:21] [INFO ] Deduced a trap composed of 142 places in 263 ms of which 4 ms to minimize.
[2024-05-28 19:22:21] [INFO ] Deduced a trap composed of 138 places in 216 ms of which 4 ms to minimize.
[2024-05-28 19:22:22] [INFO ] Deduced a trap composed of 138 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:22:22] [INFO ] Deduced a trap composed of 138 places in 238 ms of which 3 ms to minimize.
[2024-05-28 19:22:22] [INFO ] Deduced a trap composed of 138 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:22:22] [INFO ] Deduced a trap composed of 139 places in 203 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:22:23] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:22:25] [INFO ] Deduced a trap composed of 138 places in 197 ms of which 3 ms to minimize.
[2024-05-28 19:22:25] [INFO ] Deduced a trap composed of 139 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:22:25] [INFO ] Deduced a trap composed of 142 places in 171 ms of which 4 ms to minimize.
[2024-05-28 19:22:25] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 3 ms to minimize.
[2024-05-28 19:22:25] [INFO ] Deduced a trap composed of 139 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:22:26] [INFO ] Deduced a trap composed of 138 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:22:26] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 7 ms to minimize.
[2024-05-28 19:22:26] [INFO ] Deduced a trap composed of 138 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:22:26] [INFO ] Deduced a trap composed of 138 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:22:27] [INFO ] Deduced a trap composed of 139 places in 202 ms of which 4 ms to minimize.
[2024-05-28 19:22:27] [INFO ] Deduced a trap composed of 138 places in 246 ms of which 6 ms to minimize.
[2024-05-28 19:22:27] [INFO ] Deduced a trap composed of 142 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:22:27] [INFO ] Deduced a trap composed of 139 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:22:28] [INFO ] Deduced a trap composed of 142 places in 199 ms of which 4 ms to minimize.
[2024-05-28 19:22:28] [INFO ] Deduced a trap composed of 138 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:22:28] [INFO ] Deduced a trap composed of 142 places in 223 ms of which 3 ms to minimize.
[2024-05-28 19:22:28] [INFO ] Deduced a trap composed of 139 places in 205 ms of which 3 ms to minimize.
[2024-05-28 19:22:29] [INFO ] Deduced a trap composed of 142 places in 181 ms of which 4 ms to minimize.
[2024-05-28 19:22:29] [INFO ] Deduced a trap composed of 138 places in 188 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:22:30] [INFO ] Deduced a trap composed of 143 places in 229 ms of which 3 ms to minimize.
[2024-05-28 19:22:30] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 3 ms to minimize.
[2024-05-28 19:22:30] [INFO ] Deduced a trap composed of 142 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:22:30] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:22:31] [INFO ] Deduced a trap composed of 142 places in 166 ms of which 3 ms to minimize.
[2024-05-28 19:22:31] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 2 ms to minimize.
[2024-05-28 19:22:31] [INFO ] Deduced a trap composed of 138 places in 208 ms of which 3 ms to minimize.
[2024-05-28 19:22:31] [INFO ] Deduced a trap composed of 138 places in 219 ms of which 3 ms to minimize.
[2024-05-28 19:22:31] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:22:32] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:22:32] [INFO ] Deduced a trap composed of 142 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:22:32] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 3 ms to minimize.
[2024-05-28 19:22:32] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 2 ms to minimize.
[2024-05-28 19:22:32] [INFO ] Deduced a trap composed of 142 places in 164 ms of which 2 ms to minimize.
[2024-05-28 19:22:33] [INFO ] Deduced a trap composed of 142 places in 194 ms of which 4 ms to minimize.
[2024-05-28 19:22:33] [INFO ] Deduced a trap composed of 139 places in 205 ms of which 4 ms to minimize.
[2024-05-28 19:22:33] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 4 ms to minimize.
[2024-05-28 19:22:33] [INFO ] Deduced a trap composed of 139 places in 185 ms of which 4 ms to minimize.
[2024-05-28 19:22:33] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 4 ms to minimize.
[2024-05-28 19:22:36] [INFO ] Deduced a trap composed of 142 places in 258 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1293 variables, and 192 constraints, problems are : Problem set: 0 solved, 759 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/759 constraints, Known Traps: 100/100 constraints]
After SMT, in 41232ms problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 41240ms
[2024-05-28 19:22:36] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:22:36] [INFO ] Invariant cache hit.
[2024-05-28 19:22:37] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-28 19:22:37] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:22:37] [INFO ] Invariant cache hit.
[2024-05-28 19:22:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:22:39] [INFO ] Implicit Places using invariants and state equation in 1928 ms returned []
Implicit Place search using SMT with State Equation took 2348 ms to find 0 implicit places.
[2024-05-28 19:22:39] [INFO ] Redundant transitions in 6 ms returned []
Running 759 sub problems to find dead transitions.
[2024-05-28 19:22:39] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
[2024-05-28 19:22:39] [INFO ] Invariant cache hit.
[2024-05-28 19:22:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:22:45] [INFO ] Deduced a trap composed of 138 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:22:45] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 3 ms to minimize.
[2024-05-28 19:22:45] [INFO ] Deduced a trap composed of 138 places in 188 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:22:51] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 2 ms to minimize.
[2024-05-28 19:22:51] [INFO ] Deduced a trap composed of 159 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:22:51] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:22:51] [INFO ] Deduced a trap composed of 138 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:22:52] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 4 ms to minimize.
[2024-05-28 19:22:52] [INFO ] Deduced a trap composed of 159 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:22:52] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:22:52] [INFO ] Deduced a trap composed of 138 places in 190 ms of which 4 ms to minimize.
[2024-05-28 19:22:53] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 4 ms to minimize.
[2024-05-28 19:22:53] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:22:53] [INFO ] Deduced a trap composed of 174 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:22:53] [INFO ] Deduced a trap composed of 177 places in 164 ms of which 4 ms to minimize.
[2024-05-28 19:22:53] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:22:53] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 3 ms to minimize.
[2024-05-28 19:22:54] [INFO ] Deduced a trap composed of 171 places in 132 ms of which 3 ms to minimize.
[2024-05-28 19:22:54] [INFO ] Deduced a trap composed of 138 places in 128 ms of which 3 ms to minimize.
[2024-05-28 19:22:54] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 3 ms to minimize.
[2024-05-28 19:22:54] [INFO ] Deduced a trap composed of 138 places in 128 ms of which 3 ms to minimize.
[2024-05-28 19:22:54] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:22:54] [INFO ] Deduced a trap composed of 138 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:22:59] [INFO ] Deduced a trap composed of 138 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:23:00] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 4 ms to minimize.
[2024-05-28 19:23:00] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 2 ms to minimize.
[2024-05-28 19:23:00] [INFO ] Deduced a trap composed of 138 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:23:00] [INFO ] Deduced a trap composed of 138 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:23:00] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 2 ms to minimize.
[2024-05-28 19:23:01] [INFO ] Deduced a trap composed of 138 places in 216 ms of which 3 ms to minimize.
[2024-05-28 19:23:01] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
[2024-05-28 19:23:01] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:23:01] [INFO ] Deduced a trap composed of 138 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:23:01] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 4 ms to minimize.
[2024-05-28 19:23:02] [INFO ] Deduced a trap composed of 138 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:23:02] [INFO ] Deduced a trap composed of 138 places in 199 ms of which 2 ms to minimize.
[2024-05-28 19:23:02] [INFO ] Deduced a trap composed of 138 places in 143 ms of which 3 ms to minimize.
[2024-05-28 19:23:02] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:23:02] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:23:03] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:23:03] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 3 ms to minimize.
[2024-05-28 19:23:03] [INFO ] Deduced a trap composed of 138 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:23:03] [INFO ] Deduced a trap composed of 138 places in 207 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:23:04] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 2 ms to minimize.
[2024-05-28 19:23:04] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:23:04] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 4 ms to minimize.
[2024-05-28 19:23:04] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:23:05] [INFO ] Deduced a trap composed of 138 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:23:05] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 4 ms to minimize.
[2024-05-28 19:23:05] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 3 ms to minimize.
[2024-05-28 19:23:05] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:23:06] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:23:06] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 3 ms to minimize.
[2024-05-28 19:23:06] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 3 ms to minimize.
[2024-05-28 19:23:06] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:23:06] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 3 ms to minimize.
[2024-05-28 19:23:07] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:23:07] [INFO ] Deduced a trap composed of 138 places in 216 ms of which 3 ms to minimize.
[2024-05-28 19:23:07] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:23:07] [INFO ] Deduced a trap composed of 138 places in 227 ms of which 3 ms to minimize.
[2024-05-28 19:23:08] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 4 ms to minimize.
[2024-05-28 19:23:08] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:23:08] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-05-28 19:23:09] [INFO ] Deduced a trap composed of 155 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:23:09] [INFO ] Deduced a trap composed of 138 places in 207 ms of which 4 ms to minimize.
[2024-05-28 19:23:09] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 4 ms to minimize.
[2024-05-28 19:23:09] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 3 ms to minimize.
[2024-05-28 19:23:09] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 3 ms to minimize.
[2024-05-28 19:23:10] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:23:10] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:23:10] [INFO ] Deduced a trap composed of 138 places in 197 ms of which 4 ms to minimize.
SMT process timed out in 31276ms, After SMT, problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 31284ms
Starting structural reductions in SI_CTL mode, iteration 1 : 532/629 places, 765/857 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 75003 ms. Remains : 532/629 places, 765/857 transitions.
[2024-05-28 19:23:10] [INFO ] Flatten gal took : 48 ms
[2024-05-28 19:23:10] [INFO ] Flatten gal took : 62 ms
[2024-05-28 19:23:10] [INFO ] Input system was already deterministic with 765 transitions.
[2024-05-28 19:23:10] [INFO ] Flatten gal took : 56 ms
[2024-05-28 19:23:10] [INFO ] Flatten gal took : 33 ms
[2024-05-28 19:23:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14921251968706317484.gal : 4 ms
[2024-05-28 19:23:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality3840210312632034125.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/CTLCardinality14921251968706317484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3840210312632034125.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 19:23:40] [INFO ] Flatten gal took : 32 ms
[2024-05-28 19:23:40] [INFO ] Applying decomposition
[2024-05-28 19:23:40] [INFO ] Flatten gal took : 31 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/graph15365050901424630519.txt' '-o' '/tmp/graph15365050901424630519.bin' '-w' '/tmp/graph15365050901424630519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15365050901424630519.bin' '-l' '-1' '-v' '-w' '/tmp/graph15365050901424630519.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:23:40] [INFO ] Decomposing Gal with order
[2024-05-28 19:23:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:23:41] [INFO ] Removed a total of 251 redundant transitions.
[2024-05-28 19:23:41] [INFO ] Flatten gal took : 111 ms
[2024-05-28 19:23:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 10 ms.
[2024-05-28 19:23:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality11313789105969055271.gal : 7 ms
[2024-05-28 19:23:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality16426719079053959922.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/CTLCardinality11313789105969055271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16426719079053959922.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 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 812
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 812
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 579 transition count 767
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 534 transition count 767
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 533 transition count 766
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 533 transition count 766
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 186 place count 531 transition count 764
Applied a total of 186 rules in 122 ms. Remains 531 /629 variables (removed 98) and now considering 764/857 (removed 93) transitions.
Running 758 sub problems to find dead transitions.
[2024-05-28 19:24:11] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
// Phase 1: matrix 760 rows 531 cols
[2024-05-28 19:24:11] [INFO ] Computed 97 invariants in 22 ms
[2024-05-28 19:24:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:24:18] [INFO ] Deduced a trap composed of 138 places in 216 ms of which 4 ms to minimize.
[2024-05-28 19:24:18] [INFO ] Deduced a trap composed of 137 places in 189 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:24:23] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:24:23] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:24:23] [INFO ] Deduced a trap composed of 180 places in 222 ms of which 4 ms to minimize.
[2024-05-28 19:24:24] [INFO ] Deduced a trap composed of 165 places in 192 ms of which 4 ms to minimize.
[2024-05-28 19:24:24] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 3 ms to minimize.
[2024-05-28 19:24:24] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:24:24] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 4 ms to minimize.
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 4 ms to minimize.
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 4 ms to minimize.
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 3 ms to minimize.
[2024-05-28 19:24:26] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:24:26] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 3 ms to minimize.
[2024-05-28 19:24:26] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 4 ms to minimize.
[2024-05-28 19:24:26] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 4 ms to minimize.
[2024-05-28 19:24:26] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 4 ms to minimize.
[2024-05-28 19:24:27] [INFO ] Deduced a trap composed of 137 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:24:27] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:24:27] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 4 ms to minimize.
[2024-05-28 19:24:27] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1291 variables, and 114 constraints, problems are : Problem set: 0 solved, 758 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 758 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 22/114 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:24:33] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:24:34] [INFO ] Deduced a trap composed of 141 places in 209 ms of which 3 ms to minimize.
[2024-05-28 19:24:34] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:24:34] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 3 ms to minimize.
[2024-05-28 19:24:34] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 3 ms to minimize.
[2024-05-28 19:24:34] [INFO ] Deduced a trap composed of 141 places in 141 ms of which 2 ms to minimize.
[2024-05-28 19:24:34] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 2 ms to minimize.
[2024-05-28 19:24:35] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 3 ms to minimize.
[2024-05-28 19:24:35] [INFO ] Deduced a trap composed of 141 places in 238 ms of which 3 ms to minimize.
[2024-05-28 19:24:35] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 3 ms to minimize.
[2024-05-28 19:24:35] [INFO ] Deduced a trap composed of 141 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:24:36] [INFO ] Deduced a trap composed of 137 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:24:36] [INFO ] Deduced a trap composed of 137 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:24:36] [INFO ] Deduced a trap composed of 141 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:24:36] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 141 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 141 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 3 ms to minimize.
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:24:38] [INFO ] Deduced a trap composed of 141 places in 185 ms of which 2 ms to minimize.
[2024-05-28 19:24:38] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:24:38] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:24:38] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:24:39] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 2 ms to minimize.
[2024-05-28 19:24:39] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:24:39] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 4 ms to minimize.
[2024-05-28 19:24:39] [INFO ] Deduced a trap composed of 141 places in 197 ms of which 4 ms to minimize.
[2024-05-28 19:24:40] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:24:40] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:24:40] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:24:40] [INFO ] Deduced a trap composed of 137 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:24:41] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 4 ms to minimize.
[2024-05-28 19:24:41] [INFO ] Deduced a trap composed of 137 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:24:41] [INFO ] Deduced a trap composed of 141 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:24:41] [INFO ] Deduced a trap composed of 171 places in 225 ms of which 3 ms to minimize.
[2024-05-28 19:24:42] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:24:42] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:24:42] [INFO ] Deduced a trap composed of 137 places in 230 ms of which 3 ms to minimize.
[2024-05-28 19:24:42] [INFO ] Deduced a trap composed of 186 places in 218 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:24:43] [INFO ] Deduced a trap composed of 141 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:24:44] [INFO ] Deduced a trap composed of 141 places in 198 ms of which 4 ms to minimize.
[2024-05-28 19:24:44] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 4 ms to minimize.
[2024-05-28 19:24:44] [INFO ] Deduced a trap composed of 141 places in 215 ms of which 3 ms to minimize.
[2024-05-28 19:24:44] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:24:44] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 3 ms to minimize.
[2024-05-28 19:24:45] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 3 ms to minimize.
[2024-05-28 19:24:45] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 4 ms to minimize.
[2024-05-28 19:24:45] [INFO ] Deduced a trap composed of 137 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:24:45] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 4 ms to minimize.
[2024-05-28 19:24:46] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 4 ms to minimize.
[2024-05-28 19:24:46] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 4 ms to minimize.
[2024-05-28 19:24:46] [INFO ] Deduced a trap composed of 152 places in 186 ms of which 4 ms to minimize.
[2024-05-28 19:24:46] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 4 ms to minimize.
[2024-05-28 19:24:46] [INFO ] Deduced a trap composed of 137 places in 222 ms of which 4 ms to minimize.
[2024-05-28 19:24:47] [INFO ] Deduced a trap composed of 137 places in 222 ms of which 4 ms to minimize.
[2024-05-28 19:24:47] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:24:47] [INFO ] Deduced a trap composed of 137 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:24:47] [INFO ] Deduced a trap composed of 141 places in 237 ms of which 3 ms to minimize.
[2024-05-28 19:24:48] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:24:49] [INFO ] Deduced a trap composed of 168 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:24:49] [INFO ] Deduced a trap composed of 168 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:24:50] [INFO ] Deduced a trap composed of 172 places in 236 ms of which 5 ms to minimize.
[2024-05-28 19:24:50] [INFO ] Deduced a trap composed of 174 places in 194 ms of which 3 ms to minimize.
[2024-05-28 19:24:50] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 19:24:52] [INFO ] Deduced a trap composed of 235 places in 246 ms of which 4 ms to minimize.
SMT process timed out in 41383ms, After SMT, problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 41395ms
[2024-05-28 19:24:52] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 19:24:52] [INFO ] Invariant cache hit.
[2024-05-28 19:24:53] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-28 19:24:53] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 19:24:53] [INFO ] Invariant cache hit.
[2024-05-28 19:24:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:24:55] [INFO ] Implicit Places using invariants and state equation in 2376 ms returned []
Implicit Place search using SMT with State Equation took 2885 ms to find 0 implicit places.
[2024-05-28 19:24:55] [INFO ] Redundant transitions in 10 ms returned []
Running 758 sub problems to find dead transitions.
[2024-05-28 19:24:55] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 19:24:55] [INFO ] Invariant cache hit.
[2024-05-28 19:24:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:25:02] [INFO ] Deduced a trap composed of 159 places in 196 ms of which 4 ms to minimize.
[2024-05-28 19:25:02] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 3 ms to minimize.
[2024-05-28 19:25:02] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 3 ms to minimize.
[2024-05-28 19:25:03] [INFO ] Deduced a trap composed of 150 places in 192 ms of which 3 ms to minimize.
[2024-05-28 19:25:03] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 4 ms to minimize.
[2024-05-28 19:25:03] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 3 ms to minimize.
[2024-05-28 19:25:04] [INFO ] Deduced a trap composed of 137 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:25:04] [INFO ] Deduced a trap composed of 137 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:25:04] [INFO ] Deduced a trap composed of 137 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:25:04] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:25:04] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:25:05] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:25:05] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 2 ms to minimize.
[2024-05-28 19:25:05] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:25:05] [INFO ] Deduced a trap composed of 137 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:25:05] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:25:05] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 3 ms to minimize.
[2024-05-28 19:25:06] [INFO ] Deduced a trap composed of 168 places in 140 ms of which 3 ms to minimize.
[2024-05-28 19:25:06] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:25:06] [INFO ] Deduced a trap composed of 137 places in 136 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:25:06] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 4 ms to minimize.
[2024-05-28 19:25:07] [INFO ] Deduced a trap composed of 137 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:25:07] [INFO ] Deduced a trap composed of 137 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:25:07] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 3 ms to minimize.
[2024-05-28 19:25:11] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:25:12] [INFO ] Deduced a trap composed of 201 places in 215 ms of which 6 ms to minimize.
[2024-05-28 19:25:13] [INFO ] Deduced a trap composed of 207 places in 194 ms of which 4 ms to minimize.
[2024-05-28 19:25:13] [INFO ] Deduced a trap composed of 232 places in 190 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:25:19] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 4 ms to minimize.
[2024-05-28 19:25:19] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 3 ms to minimize.
[2024-05-28 19:25:19] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:25:20] [INFO ] Deduced a trap composed of 138 places in 204 ms of which 4 ms to minimize.
[2024-05-28 19:25:20] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 5 ms to minimize.
[2024-05-28 19:25:20] [INFO ] Deduced a trap composed of 137 places in 201 ms of which 4 ms to minimize.
[2024-05-28 19:25:20] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 3 ms to minimize.
[2024-05-28 19:25:20] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:25:21] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:25:21] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 2 ms to minimize.
[2024-05-28 19:25:21] [INFO ] Deduced a trap composed of 137 places in 228 ms of which 3 ms to minimize.
[2024-05-28 19:25:21] [INFO ] Deduced a trap composed of 137 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:25:22] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 4 ms to minimize.
[2024-05-28 19:25:22] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 4 ms to minimize.
[2024-05-28 19:25:22] [INFO ] Deduced a trap composed of 137 places in 220 ms of which 3 ms to minimize.
[2024-05-28 19:25:22] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 4 ms to minimize.
[2024-05-28 19:25:23] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 4 ms to minimize.
[2024-05-28 19:25:23] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 3 ms to minimize.
[2024-05-28 19:25:23] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 3 ms to minimize.
[2024-05-28 19:25:23] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 19:25:24] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 3 ms to minimize.
[2024-05-28 19:25:24] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 2 ms to minimize.
[2024-05-28 19:25:24] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 2 ms to minimize.
[2024-05-28 19:25:24] [INFO ] Deduced a trap composed of 137 places in 212 ms of which 3 ms to minimize.
[2024-05-28 19:25:25] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 2 ms to minimize.
[2024-05-28 19:25:25] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 4 ms to minimize.
[2024-05-28 19:25:25] [INFO ] Deduced a trap composed of 137 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:25:25] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 4 ms to minimize.
[2024-05-28 19:25:26] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 3 ms to minimize.
[2024-05-28 19:25:26] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:25:26] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 4 ms to minimize.
[2024-05-28 19:25:26] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 3 ms to minimize.
[2024-05-28 19:25:26] [INFO ] Deduced a trap composed of 137 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:25:27] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 4 ms to minimize.
SMT process timed out in 31498ms, After SMT, problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 31514ms
Starting structural reductions in SI_CTL mode, iteration 1 : 531/629 places, 764/857 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 75942 ms. Remains : 531/629 places, 764/857 transitions.
[2024-05-28 19:25:27] [INFO ] Flatten gal took : 39 ms
[2024-05-28 19:25:27] [INFO ] Flatten gal took : 35 ms
[2024-05-28 19:25:27] [INFO ] Input system was already deterministic with 764 transitions.
[2024-05-28 19:25:27] [INFO ] Flatten gal took : 40 ms
[2024-05-28 19:25:27] [INFO ] Flatten gal took : 35 ms
[2024-05-28 19:25:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality5871267731173441583.gal : 6 ms
[2024-05-28 19:25:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality5666819798213176965.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/CTLCardinality5871267731173441583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5666819798213176965.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 19:25:57] [INFO ] Flatten gal took : 59 ms
[2024-05-28 19:25:57] [INFO ] Applying decomposition
[2024-05-28 19:25:57] [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/graph8777536949450403755.txt' '-o' '/tmp/graph8777536949450403755.bin' '-w' '/tmp/graph8777536949450403755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8777536949450403755.bin' '-l' '-1' '-v' '-w' '/tmp/graph8777536949450403755.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:25:57] [INFO ] Decomposing Gal with order
[2024-05-28 19:25:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:25:57] [INFO ] Removed a total of 660 redundant transitions.
[2024-05-28 19:25:57] [INFO ] Flatten gal took : 125 ms
[2024-05-28 19:25:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 22 ms.
[2024-05-28 19:25:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality8274520253474574218.gal : 11 ms
[2024-05-28 19:25:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality10208073676482160746.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/CTLCardinality8274520253474574218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10208073676482160746.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 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 43 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-05-28 19:26:28] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-05-28 19:26:28] [INFO ] Computed 97 invariants in 9 ms
[2024-05-28 19:26:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-05-28 19:27:01] [INFO ] Deduced a trap composed of 204 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:27:01] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:27:02] [INFO ] Deduced a trap composed of 15 places in 298 ms of which 5 ms to minimize.
[2024-05-28 19:27:05] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 100 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 4/4 constraints]
After SMT, in 41639ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41656ms
[2024-05-28 19:27:09] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:27:09] [INFO ] Invariant cache hit.
[2024-05-28 19:27:10] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-28 19:27:10] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:27:10] [INFO ] Invariant cache hit.
[2024-05-28 19:27:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:27:12] [INFO ] Implicit Places using invariants and state equation in 2593 ms returned []
Implicit Place search using SMT with State Equation took 3090 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-28 19:27:12] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:27:12] [INFO ] Invariant cache hit.
[2024-05-28 19:27:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/623 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:27:40] [INFO ] Deduced a trap composed of 259 places in 255 ms of which 6 ms to minimize.
[2024-05-28 19:27:41] [INFO ] Deduced a trap composed of 271 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:27:41] [INFO ] Deduced a trap composed of 253 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:27:41] [INFO ] Deduced a trap composed of 256 places in 228 ms of which 3 ms to minimize.
[2024-05-28 19:27:41] [INFO ] Deduced a trap composed of 262 places in 209 ms of which 3 ms to minimize.
[2024-05-28 19:27:42] [INFO ] Deduced a trap composed of 259 places in 210 ms of which 3 ms to minimize.
[2024-05-28 19:27:42] [INFO ] Deduced a trap composed of 247 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:27:42] [INFO ] Deduced a trap composed of 259 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:27:42] [INFO ] Deduced a trap composed of 256 places in 181 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 Real declared 623/1475 variables, and 106 constraints, problems are : Problem set: 17 solved, 833 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 17 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:27:47] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:27:48] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 0/93 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 4 (OVERLAPS) 5/622 variables, 5/98 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 9/107 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:28:02] [INFO ] Deduced a trap composed of 268 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:28:04] [INFO ] Deduced a trap composed of 298 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:28:05] [INFO ] Deduced a trap composed of 294 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:28:05] [INFO ] Deduced a trap composed of 304 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:28:05] [INFO ] Deduced a trap composed of 292 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:28:05] [INFO ] Deduced a trap composed of 290 places in 194 ms of which 3 ms to minimize.
[2024-05-28 19:28:05] [INFO ] Deduced a trap composed of 300 places in 191 ms of which 4 ms to minimize.
[2024-05-28 19:28:06] [INFO ] Deduced a trap composed of 300 places in 192 ms of which 4 ms to minimize.
[2024-05-28 19:28:06] [INFO ] Deduced a trap composed of 299 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:28:06] [INFO ] Deduced a trap composed of 284 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:28:06] [INFO ] Deduced a trap composed of 292 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:28:07] [INFO ] Deduced a trap composed of 297 places in 241 ms of which 5 ms to minimize.
[2024-05-28 19:28:07] [INFO ] Deduced a trap composed of 296 places in 255 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 120 constraints, problems are : Problem set: 17 solved, 833 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 24/24 constraints]
After SMT, in 61258ms problems are : Problem set: 17 solved, 833 unsolved
Search for dead transitions found 17 dead transitions in 61266ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/857 transitions.
Applied a total of 0 rules in 9 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106071 ms. Remains : 623/629 places, 839/857 transitions.
[2024-05-28 19:28:14] [INFO ] Flatten gal took : 21 ms
[2024-05-28 19:28:14] [INFO ] Flatten gal took : 24 ms
[2024-05-28 19:28:14] [INFO ] Input system was already deterministic with 839 transitions.
[2024-05-28 19:28:14] [INFO ] Flatten gal took : 27 ms
[2024-05-28 19:28:14] [INFO ] Flatten gal took : 27 ms
[2024-05-28 19:28:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality5738998061019897831.gal : 4 ms
[2024-05-28 19:28:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality12761366544820713891.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/CTLCardinality5738998061019897831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12761366544820713891.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 19:28:44] [INFO ] Flatten gal took : 60 ms
[2024-05-28 19:28:44] [INFO ] Applying decomposition
[2024-05-28 19:28:44] [INFO ] Flatten gal took : 47 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/graph10273255094405560065.txt' '-o' '/tmp/graph10273255094405560065.bin' '-w' '/tmp/graph10273255094405560065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10273255094405560065.bin' '-l' '-1' '-v' '-w' '/tmp/graph10273255094405560065.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:28:44] [INFO ] Decomposing Gal with order
[2024-05-28 19:28:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:28:44] [INFO ] Removed a total of 907 redundant transitions.
[2024-05-28 19:28:44] [INFO ] Flatten gal took : 87 ms
[2024-05-28 19:28:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 10 ms.
[2024-05-28 19:28:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4045737395281455361.gal : 5 ms
[2024-05-28 19:28:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality1987056262186618736.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/CTLCardinality4045737395281455361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1987056262186618736.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 624 transition count 854
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 621 transition count 854
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 621 transition count 851
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 618 transition count 851
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 617 transition count 850
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 617 transition count 850
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 615 transition count 848
Applied a total of 18 rules in 106 ms. Remains 615 /629 variables (removed 14) and now considering 848/857 (removed 9) transitions.
Running 842 sub problems to find dead transitions.
[2024-05-28 19:29:14] [INFO ] Flow matrix only has 844 transitions (discarded 4 similar events)
// Phase 1: matrix 844 rows 615 cols
[2024-05-28 19:29:14] [INFO ] Computed 97 invariants in 24 ms
[2024-05-28 19:29:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-05-28 19:29:22] [INFO ] Deduced a trap composed of 255 places in 281 ms of which 4 ms to minimize.
[2024-05-28 19:29:23] [INFO ] Deduced a trap composed of 221 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:29:23] [INFO ] Deduced a trap composed of 221 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:29:23] [INFO ] Deduced a trap composed of 221 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:29:23] [INFO ] Deduced a trap composed of 258 places in 269 ms of which 4 ms to minimize.
[2024-05-28 19:29:24] [INFO ] Deduced a trap composed of 246 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:29:24] [INFO ] Deduced a trap composed of 249 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:29:24] [INFO ] Deduced a trap composed of 221 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:29:24] [INFO ] Deduced a trap composed of 221 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:29:25] [INFO ] Deduced a trap composed of 221 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:29:25] [INFO ] Deduced a trap composed of 249 places in 216 ms of which 4 ms to minimize.
[2024-05-28 19:29:25] [INFO ] Deduced a trap composed of 255 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:29:25] [INFO ] Deduced a trap composed of 246 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:29:26] [INFO ] Deduced a trap composed of 221 places in 214 ms of which 3 ms to minimize.
[2024-05-28 19:29:26] [INFO ] Deduced a trap composed of 221 places in 274 ms of which 4 ms to minimize.
[2024-05-28 19:29:26] [INFO ] Deduced a trap composed of 258 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:29:27] [INFO ] Deduced a trap composed of 221 places in 196 ms of which 3 ms to minimize.
[2024-05-28 19:29:27] [INFO ] Deduced a trap composed of 221 places in 205 ms of which 4 ms to minimize.
[2024-05-28 19:29:27] [INFO ] Deduced a trap composed of 221 places in 187 ms of which 3 ms to minimize.
[2024-05-28 19:29:27] [INFO ] Deduced a trap composed of 221 places in 225 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-05-28 19:29:33] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 4 ms to minimize.
[2024-05-28 19:29:35] [INFO ] Deduced a trap composed of 301 places in 249 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/610 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1459 variables, and 114 constraints, problems are : Problem set: 0 solved, 842 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/615 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 842/842 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 842 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 22/114 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-05-28 19:29:37] [INFO ] Deduced a trap composed of 249 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:29:38] [INFO ] Deduced a trap composed of 258 places in 192 ms of which 3 ms to minimize.
[2024-05-28 19:29:38] [INFO ] Deduced a trap composed of 249 places in 179 ms of which 3 ms to minimize.
[2024-05-28 19:29:38] [INFO ] Deduced a trap composed of 261 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:29:38] [INFO ] Deduced a trap composed of 264 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:29:39] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 2 ms to minimize.
[2024-05-28 19:29:40] [INFO ] Deduced a trap composed of 225 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:29:41] [INFO ] Deduced a trap composed of 221 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:29:41] [INFO ] Deduced a trap composed of 225 places in 271 ms of which 4 ms to minimize.
[2024-05-28 19:29:41] [INFO ] Deduced a trap composed of 221 places in 258 ms of which 5 ms to minimize.
[2024-05-28 19:29:41] [INFO ] Deduced a trap composed of 221 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:29:42] [INFO ] Deduced a trap composed of 221 places in 206 ms of which 3 ms to minimize.
[2024-05-28 19:29:42] [INFO ] Deduced a trap composed of 221 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:29:42] [INFO ] Deduced a trap composed of 221 places in 191 ms of which 3 ms to minimize.
[2024-05-28 19:29:42] [INFO ] Deduced a trap composed of 221 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:29:42] [INFO ] Deduced a trap composed of 225 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:29:43] [INFO ] Deduced a trap composed of 221 places in 238 ms of which 5 ms to minimize.
[2024-05-28 19:29:43] [INFO ] Deduced a trap composed of 225 places in 230 ms of which 3 ms to minimize.
[2024-05-28 19:29:43] [INFO ] Deduced a trap composed of 221 places in 269 ms of which 4 ms to minimize.
[2024-05-28 19:29:44] [INFO ] Deduced a trap composed of 225 places in 258 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/610 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-05-28 19:29:45] [INFO ] Deduced a trap composed of 237 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:29:45] [INFO ] Deduced a trap composed of 247 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:29:45] [INFO ] Deduced a trap composed of 237 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:29:46] [INFO ] Deduced a trap composed of 244 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:29:46] [INFO ] Deduced a trap composed of 243 places in 204 ms of which 4 ms to minimize.
[2024-05-28 19:29:47] [INFO ] Deduced a trap composed of 249 places in 202 ms of which 4 ms to minimize.
[2024-05-28 19:29:47] [INFO ] Deduced a trap composed of 234 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:29:47] [INFO ] Deduced a trap composed of 243 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:29:47] [INFO ] Deduced a trap composed of 252 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:29:48] [INFO ] Deduced a trap composed of 247 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:29:48] [INFO ] Deduced a trap composed of 249 places in 284 ms of which 7 ms to minimize.
[2024-05-28 19:29:48] [INFO ] Deduced a trap composed of 249 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:29:49] [INFO ] Deduced a trap composed of 267 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:29:49] [INFO ] Deduced a trap composed of 252 places in 259 ms of which 5 ms to minimize.
[2024-05-28 19:29:49] [INFO ] Deduced a trap composed of 243 places in 243 ms of which 7 ms to minimize.
[2024-05-28 19:29:51] [INFO ] Deduced a trap composed of 225 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:29:51] [INFO ] Deduced a trap composed of 225 places in 253 ms of which 5 ms to minimize.
[2024-05-28 19:29:52] [INFO ] Deduced a trap composed of 225 places in 245 ms of which 5 ms to minimize.
[2024-05-28 19:29:52] [INFO ] Deduced a trap composed of 225 places in 269 ms of which 4 ms to minimize.
[2024-05-28 19:29:52] [INFO ] Deduced a trap composed of 225 places in 246 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-05-28 19:29:54] [INFO ] Deduced a trap composed of 240 places in 245 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1459 variables, and 155 constraints, problems are : Problem set: 0 solved, 842 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/615 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/842 constraints, Known Traps: 63/63 constraints]
After SMT, in 41352ms problems are : Problem set: 0 solved, 842 unsolved
Search for dead transitions found 0 dead transitions in 41365ms
[2024-05-28 19:29:56] [INFO ] Flow matrix only has 844 transitions (discarded 4 similar events)
[2024-05-28 19:29:56] [INFO ] Invariant cache hit.
[2024-05-28 19:29:56] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-28 19:29:56] [INFO ] Flow matrix only has 844 transitions (discarded 4 similar events)
[2024-05-28 19:29:56] [INFO ] Invariant cache hit.
[2024-05-28 19:29:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:30:00] [INFO ] Implicit Places using invariants and state equation in 3174 ms returned []
Implicit Place search using SMT with State Equation took 3737 ms to find 0 implicit places.
[2024-05-28 19:30:00] [INFO ] Redundant transitions in 13 ms returned []
Running 842 sub problems to find dead transitions.
[2024-05-28 19:30:00] [INFO ] Flow matrix only has 844 transitions (discarded 4 similar events)
[2024-05-28 19:30:00] [INFO ] Invariant cache hit.
[2024-05-28 19:30:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-05-28 19:30:08] [INFO ] Deduced a trap composed of 249 places in 270 ms of which 4 ms to minimize.
[2024-05-28 19:30:08] [INFO ] Deduced a trap composed of 246 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:30:08] [INFO ] Deduced a trap composed of 255 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:30:08] [INFO ] Deduced a trap composed of 221 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:30:09] [INFO ] Deduced a trap composed of 221 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:30:09] [INFO ] Deduced a trap composed of 221 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:30:09] [INFO ] Deduced a trap composed of 221 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:30:09] [INFO ] Deduced a trap composed of 221 places in 231 ms of which 5 ms to minimize.
[2024-05-28 19:30:10] [INFO ] Deduced a trap composed of 221 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:30:10] [INFO ] Deduced a trap composed of 221 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:30:10] [INFO ] Deduced a trap composed of 221 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:30:10] [INFO ] Deduced a trap composed of 221 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:30:10] [INFO ] Deduced a trap composed of 221 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:30:11] [INFO ] Deduced a trap composed of 221 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:30:11] [INFO ] Deduced a trap composed of 261 places in 190 ms of which 3 ms to minimize.
[2024-05-28 19:30:11] [INFO ] Deduced a trap composed of 237 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:30:11] [INFO ] Deduced a trap composed of 258 places in 213 ms of which 3 ms to minimize.
[2024-05-28 19:30:12] [INFO ] Deduced a trap composed of 221 places in 212 ms of which 3 ms to minimize.
[2024-05-28 19:30:12] [INFO ] Deduced a trap composed of 252 places in 208 ms of which 3 ms to minimize.
[2024-05-28 19:30:12] [INFO ] Deduced a trap composed of 249 places in 210 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-05-28 19:30:13] [INFO ] Deduced a trap composed of 255 places in 271 ms of which 4 ms to minimize.
[2024-05-28 19:30:13] [INFO ] Deduced a trap composed of 221 places in 230 ms of which 5 ms to minimize.
[2024-05-28 19:30:14] [INFO ] Deduced a trap composed of 255 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:30:14] [INFO ] Deduced a trap composed of 221 places in 218 ms of which 4 ms to minimize.
[2024-05-28 19:30:14] [INFO ] Deduced a trap composed of 221 places in 170 ms of which 2 ms to minimize.
[2024-05-28 19:30:14] [INFO ] Deduced a trap composed of 221 places in 152 ms of which 2 ms to minimize.
[2024-05-28 19:30:14] [INFO ] Deduced a trap composed of 221 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:30:14] [INFO ] Deduced a trap composed of 221 places in 154 ms of which 3 ms to minimize.
[2024-05-28 19:30:15] [INFO ] Deduced a trap composed of 221 places in 194 ms of which 4 ms to minimize.
[2024-05-28 19:30:15] [INFO ] Deduced a trap composed of 221 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:30:15] [INFO ] Deduced a trap composed of 221 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:30:15] [INFO ] Deduced a trap composed of 221 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:30:16] [INFO ] Deduced a trap composed of 221 places in 320 ms of which 4 ms to minimize.
[2024-05-28 19:30:16] [INFO ] Deduced a trap composed of 221 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:30:16] [INFO ] Deduced a trap composed of 243 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:30:17] [INFO ] Deduced a trap composed of 237 places in 247 ms of which 4 ms to minimize.
[2024-05-28 19:30:17] [INFO ] Deduced a trap composed of 221 places in 204 ms of which 4 ms to minimize.
[2024-05-28 19:30:17] [INFO ] Deduced a trap composed of 221 places in 201 ms of which 4 ms to minimize.
[2024-05-28 19:30:17] [INFO ] Deduced a trap composed of 221 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:30:17] [INFO ] Deduced a trap composed of 221 places in 201 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/610 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 5 (OVERLAPS) 4/614 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1459 variables, and 136 constraints, problems are : Problem set: 0 solved, 842 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/615 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 842/842 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 842 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-05-28 19:30:33] [INFO ] Deduced a trap composed of 261 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:30:33] [INFO ] Deduced a trap composed of 255 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:30:33] [INFO ] Deduced a trap composed of 270 places in 210 ms of which 4 ms to minimize.
[2024-05-28 19:30:33] [INFO ] Deduced a trap composed of 264 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:30:34] [INFO ] Deduced a trap composed of 273 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:30:34] [INFO ] Deduced a trap composed of 261 places in 240 ms of which 6 ms to minimize.
[2024-05-28 19:30:34] [INFO ] Deduced a trap composed of 221 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:30:34] [INFO ] Deduced a trap composed of 221 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:30:35] [INFO ] Deduced a trap composed of 252 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:30:35] [INFO ] Deduced a trap composed of 221 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:30:35] [INFO ] Deduced a trap composed of 221 places in 218 ms of which 4 ms to minimize.
[2024-05-28 19:30:35] [INFO ] Deduced a trap composed of 221 places in 206 ms of which 4 ms to minimize.
[2024-05-28 19:30:35] [INFO ] Deduced a trap composed of 221 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:30:36] [INFO ] Deduced a trap composed of 221 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:30:36] [INFO ] Deduced a trap composed of 221 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:30:36] [INFO ] Deduced a trap composed of 221 places in 195 ms of which 3 ms to minimize.
[2024-05-28 19:30:36] [INFO ] Deduced a trap composed of 221 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:30:37] [INFO ] Deduced a trap composed of 221 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:30:37] [INFO ] Deduced a trap composed of 221 places in 202 ms of which 4 ms to minimize.
[2024-05-28 19:30:37] [INFO ] Deduced a trap composed of 221 places in 234 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/610 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-05-28 19:30:39] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 2 ms to minimize.
[2024-05-28 19:30:41] [INFO ] Deduced a trap composed of 225 places in 281 ms of which 4 ms to minimize.
[2024-05-28 19:30:41] [INFO ] Deduced a trap composed of 221 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:30:41] [INFO ] Deduced a trap composed of 244 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:30:42] [INFO ] Deduced a trap composed of 240 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:30:42] [INFO ] Deduced a trap composed of 225 places in 270 ms of which 5 ms to minimize.
[2024-05-28 19:30:42] [INFO ] Deduced a trap composed of 221 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:30:42] [INFO ] Deduced a trap composed of 221 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:30:43] [INFO ] Deduced a trap composed of 225 places in 237 ms of which 5 ms to minimize.
[2024-05-28 19:30:43] [INFO ] Deduced a trap composed of 221 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:30:43] [INFO ] Deduced a trap composed of 221 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:30:43] [INFO ] Deduced a trap composed of 225 places in 211 ms of which 4 ms to minimize.
[2024-05-28 19:30:44] [INFO ] Deduced a trap composed of 221 places in 210 ms of which 4 ms to minimize.
[2024-05-28 19:30:44] [INFO ] Deduced a trap composed of 221 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:30:44] [INFO ] Deduced a trap composed of 221 places in 214 ms of which 3 ms to minimize.
[2024-05-28 19:30:44] [INFO ] Deduced a trap composed of 225 places in 194 ms of which 4 ms to minimize.
[2024-05-28 19:30:45] [INFO ] Deduced a trap composed of 221 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:30:45] [INFO ] Deduced a trap composed of 221 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:30:45] [INFO ] Deduced a trap composed of 225 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:30:45] [INFO ] Deduced a trap composed of 221 places in 192 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-05-28 19:30:47] [INFO ] Deduced a trap composed of 317 places in 278 ms of which 4 ms to minimize.
[2024-05-28 19:30:47] [INFO ] Deduced a trap composed of 317 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:30:48] [INFO ] Deduced a trap composed of 315 places in 283 ms of which 4 ms to minimize.
[2024-05-28 19:30:48] [INFO ] Deduced a trap composed of 320 places in 319 ms of which 4 ms to minimize.
[2024-05-28 19:30:48] [INFO ] Deduced a trap composed of 320 places in 278 ms of which 4 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 315 places in 269 ms of which 4 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 323 places in 319 ms of which 5 ms to minimize.
[2024-05-28 19:30:49] [INFO ] Deduced a trap composed of 317 places in 266 ms of which 5 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 326 places in 269 ms of which 5 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 318 places in 266 ms of which 3 ms to minimize.
[2024-05-28 19:30:50] [INFO ] Deduced a trap composed of 311 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:30:51] [INFO ] Deduced a trap composed of 315 places in 286 ms of which 3 ms to minimize.
[2024-05-28 19:30:51] [INFO ] Deduced a trap composed of 321 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:30:51] [INFO ] Deduced a trap composed of 321 places in 196 ms of which 3 ms to minimize.
[2024-05-28 19:30:51] [INFO ] Deduced a trap composed of 321 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:30:51] [INFO ] Deduced a trap composed of 318 places in 211 ms of which 4 ms to minimize.
[2024-05-28 19:30:52] [INFO ] Deduced a trap composed of 317 places in 224 ms of which 3 ms to minimize.
[2024-05-28 19:30:52] [INFO ] Deduced a trap composed of 322 places in 273 ms of which 5 ms to minimize.
[2024-05-28 19:30:52] [INFO ] Deduced a trap composed of 325 places in 261 ms of which 4 ms to minimize.
[2024-05-28 19:30:53] [INFO ] Deduced a trap composed of 320 places in 244 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/610 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1459 variables, and 192 constraints, problems are : Problem set: 0 solved, 842 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/615 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/842 constraints, Known Traps: 100/100 constraints]
After SMT, in 61342ms problems are : Problem set: 0 solved, 842 unsolved
Search for dead transitions found 0 dead transitions in 61357ms
Starting structural reductions in SI_CTL mode, iteration 1 : 615/629 places, 848/857 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 106593 ms. Remains : 615/629 places, 848/857 transitions.
[2024-05-28 19:31:01] [INFO ] Flatten gal took : 23 ms
[2024-05-28 19:31:01] [INFO ] Flatten gal took : 24 ms
[2024-05-28 19:31:01] [INFO ] Input system was already deterministic with 848 transitions.
[2024-05-28 19:31:01] [INFO ] Flatten gal took : 23 ms
[2024-05-28 19:31:01] [INFO ] Flatten gal took : 23 ms
[2024-05-28 19:31:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality827717669998334503.gal : 4 ms
[2024-05-28 19:31:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality14458108605988457889.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/CTLCardinality827717669998334503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14458108605988457889.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 19:31:31] [INFO ] Flatten gal took : 64 ms
[2024-05-28 19:31:31] [INFO ] Applying decomposition
[2024-05-28 19:31:31] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12880747650996978619.txt' '-o' '/tmp/graph12880747650996978619.bin' '-w' '/tmp/graph12880747650996978619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12880747650996978619.bin' '-l' '-1' '-v' '-w' '/tmp/graph12880747650996978619.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:31:31] [INFO ] Decomposing Gal with order
[2024-05-28 19:31:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:31:32] [INFO ] Removed a total of 724 redundant transitions.
[2024-05-28 19:31:32] [INFO ] Flatten gal took : 110 ms
[2024-05-28 19:31:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 788 labels/synchronizations in 21 ms.
[2024-05-28 19:31:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality5787793852017632530.gal : 9 ms
[2024-05-28 19:31:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality15233906338680489007.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/CTLCardinality5787793852017632530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15233906338680489007.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 624 transition count 811
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 578 transition count 811
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 767
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 180 place count 534 transition count 767
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 533 transition count 766
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 533 transition count 766
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 186 place count 531 transition count 764
Applied a total of 186 rules in 111 ms. Remains 531 /629 variables (removed 98) and now considering 764/857 (removed 93) transitions.
Running 758 sub problems to find dead transitions.
[2024-05-28 19:32:02] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
// Phase 1: matrix 760 rows 531 cols
[2024-05-28 19:32:02] [INFO ] Computed 97 invariants in 11 ms
[2024-05-28 19:32:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 3 (OVERLAPS) 4/530 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/531 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 741 unsolved
[2024-05-28 19:32:19] [INFO ] Deduced a trap composed of 171 places in 223 ms of which 6 ms to minimize.
[2024-05-28 19:32:23] [INFO ] Deduced a trap composed of 107 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:32:23] [INFO ] Deduced a trap composed of 110 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:32:23] [INFO ] Deduced a trap composed of 109 places in 205 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1291 variables, and 101 constraints, problems are : Problem set: 17 solved, 741 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 17 solved, 741 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 741 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 17 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 4/96 constraints. Problems are: Problem set: 17 solved, 741 unsolved
[2024-05-28 19:32:24] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:32:24] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 2 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 137 places in 205 ms of which 3 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 4 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 4 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 3 ms to minimize.
[2024-05-28 19:32:25] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:32:26] [INFO ] Deduced a trap composed of 159 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:32:26] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:32:26] [INFO ] Deduced a trap composed of 159 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:32:26] [INFO ] Deduced a trap composed of 137 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:32:27] [INFO ] Deduced a trap composed of 137 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:32:27] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:32:27] [INFO ] Deduced a trap composed of 137 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:32:27] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:32:28] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 4 ms to minimize.
[2024-05-28 19:32:28] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 4 ms to minimize.
[2024-05-28 19:32:28] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 4 ms to minimize.
[2024-05-28 19:32:28] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 4 ms to minimize.
[2024-05-28 19:32:28] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/116 constraints. Problems are: Problem set: 17 solved, 741 unsolved
[2024-05-28 19:32:29] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:32:31] [INFO ] Deduced a trap composed of 168 places in 220 ms of which 3 ms to minimize.
[2024-05-28 19:32:31] [INFO ] Deduced a trap composed of 140 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:32:31] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 4 ms to minimize.
[2024-05-28 19:32:31] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 4 ms to minimize.
[2024-05-28 19:32:31] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 4 ms to minimize.
[2024-05-28 19:32:32] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 3 ms to minimize.
[2024-05-28 19:32:32] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-28 19:32:32] [INFO ] Deduced a trap composed of 140 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:32:32] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:32:32] [INFO ] Deduced a trap composed of 140 places in 143 ms of which 3 ms to minimize.
[2024-05-28 19:32:32] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 3 ms to minimize.
[2024-05-28 19:32:33] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 3 ms to minimize.
[2024-05-28 19:32:33] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 3 ms to minimize.
[2024-05-28 19:32:33] [INFO ] Deduced a trap composed of 140 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:32:33] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 3 ms to minimize.
[2024-05-28 19:32:33] [INFO ] Deduced a trap composed of 140 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:32:33] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 3 ms to minimize.
[2024-05-28 19:32:33] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:32:34] [INFO ] Deduced a trap composed of 177 places in 203 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/136 constraints. Problems are: Problem set: 17 solved, 741 unsolved
[2024-05-28 19:32:34] [INFO ] Deduced a trap composed of 137 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:32:35] [INFO ] Deduced a trap composed of 137 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:32:35] [INFO ] Deduced a trap composed of 140 places in 198 ms of which 4 ms to minimize.
[2024-05-28 19:32:35] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:32:35] [INFO ] Deduced a trap composed of 137 places in 230 ms of which 3 ms to minimize.
[2024-05-28 19:32:35] [INFO ] Deduced a trap composed of 137 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:32:36] [INFO ] Deduced a trap composed of 140 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:32:36] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 3 ms to minimize.
[2024-05-28 19:32:36] [INFO ] Deduced a trap composed of 140 places in 200 ms of which 3 ms to minimize.
[2024-05-28 19:32:36] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 4 ms to minimize.
[2024-05-28 19:32:36] [INFO ] Deduced a trap composed of 140 places in 179 ms of which 2 ms to minimize.
[2024-05-28 19:32:37] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:32:37] [INFO ] Deduced a trap composed of 140 places in 165 ms of which 2 ms to minimize.
[2024-05-28 19:32:37] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:32:37] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 2 ms to minimize.
[2024-05-28 19:32:37] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 3 ms to minimize.
[2024-05-28 19:32:38] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:32:38] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:32:38] [INFO ] Deduced a trap composed of 140 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:32:38] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 20/156 constraints. Problems are: Problem set: 17 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1291 variables, and 156 constraints, problems are : Problem set: 17 solved, 741 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/758 constraints, Known Traps: 64/64 constraints]
After SMT, in 41294ms problems are : Problem set: 17 solved, 741 unsolved
Search for dead transitions found 17 dead transitions in 41338ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
[2024-05-28 19:32:43] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2024-05-28 19:32:43] [INFO ] Computed 97 invariants in 20 ms
[2024-05-28 19:32:44] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-28 19:32:44] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2024-05-28 19:32:44] [INFO ] Invariant cache hit.
[2024-05-28 19:32:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:32:45] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
[2024-05-28 19:32:45] [INFO ] Redundant transitions in 9 ms returned []
Starting structural reductions in SI_CTL mode, iteration 1 : 531/629 places, 747/857 transitions.
Applied a total of 0 rules in 27 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43675 ms. Remains : 531/629 places, 747/857 transitions.
[2024-05-28 19:32:45] [INFO ] Flatten gal took : 21 ms
[2024-05-28 19:32:45] [INFO ] Flatten gal took : 22 ms
[2024-05-28 19:32:46] [INFO ] Input system was already deterministic with 747 transitions.
[2024-05-28 19:32:46] [INFO ] Flatten gal took : 22 ms
[2024-05-28 19:32:46] [INFO ] Flatten gal took : 21 ms
[2024-05-28 19:32:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality2701719465028869009.gal : 4 ms
[2024-05-28 19:32:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality14787609625202958175.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/CTLCardinality2701719465028869009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14787609625202958175.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 19:33:16] [INFO ] Flatten gal took : 56 ms
[2024-05-28 19:33:16] [INFO ] Applying decomposition
[2024-05-28 19:33:16] [INFO ] Flatten gal took : 51 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/graph3449374152106893659.txt' '-o' '/tmp/graph3449374152106893659.bin' '-w' '/tmp/graph3449374152106893659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3449374152106893659.bin' '-l' '-1' '-v' '-w' '/tmp/graph3449374152106893659.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:33:16] [INFO ] Decomposing Gal with order
[2024-05-28 19:33:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:33:16] [INFO ] Removed a total of 936 redundant transitions.
[2024-05-28 19:33:16] [INFO ] Flatten gal took : 84 ms
[2024-05-28 19:33:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 8 ms.
[2024-05-28 19:33:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality9850657239425243294.gal : 7 ms
[2024-05-28 19:33:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality3877065035973579177.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/CTLCardinality9850657239425243294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3877065035973579177.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 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 42 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-05-28 19:33:46] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-05-28 19:33:46] [INFO ] Computed 97 invariants in 11 ms
[2024-05-28 19:33:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-05-28 19:34:19] [INFO ] Deduced a trap composed of 204 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:34:20] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:34:20] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 3 ms to minimize.
[2024-05-28 19:34:25] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 100 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 4/4 constraints]
After SMT, in 41431ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41445ms
[2024-05-28 19:34:28] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:34:28] [INFO ] Invariant cache hit.
[2024-05-28 19:34:28] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-28 19:34:28] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:34:28] [INFO ] Invariant cache hit.
[2024-05-28 19:34:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:34:30] [INFO ] Implicit Places using invariants and state equation in 2172 ms returned []
Implicit Place search using SMT with State Equation took 2640 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-28 19:34:30] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-05-28 19:34:30] [INFO ] Invariant cache hit.
[2024-05-28 19:34:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/623 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:34:58] [INFO ] Deduced a trap composed of 259 places in 252 ms of which 5 ms to minimize.
[2024-05-28 19:34:58] [INFO ] Deduced a trap composed of 271 places in 228 ms of which 5 ms to minimize.
[2024-05-28 19:34:58] [INFO ] Deduced a trap composed of 253 places in 264 ms of which 4 ms to minimize.
[2024-05-28 19:34:59] [INFO ] Deduced a trap composed of 256 places in 263 ms of which 5 ms to minimize.
[2024-05-28 19:34:59] [INFO ] Deduced a trap composed of 262 places in 244 ms of which 4 ms to minimize.
[2024-05-28 19:34:59] [INFO ] Deduced a trap composed of 259 places in 258 ms of which 4 ms to minimize.
[2024-05-28 19:34:59] [INFO ] Deduced a trap composed of 247 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:35:00] [INFO ] Deduced a trap composed of 259 places in 247 ms of which 4 ms to minimize.
[2024-05-28 19:35:00] [INFO ] Deduced a trap composed of 256 places in 242 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1475 variables, and 106 constraints, problems are : Problem set: 17 solved, 833 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 17 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:35:05] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 3 ms to minimize.
[2024-05-28 19:35:05] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 0/93 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 4 (OVERLAPS) 5/622 variables, 5/98 constraints. Problems are: Problem set: 17 solved, 833 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 9/107 constraints. Problems are: Problem set: 17 solved, 833 unsolved
[2024-05-28 19:35:20] [INFO ] Deduced a trap composed of 268 places in 239 ms of which 5 ms to minimize.
[2024-05-28 19:35:21] [INFO ] Deduced a trap composed of 298 places in 258 ms of which 4 ms to minimize.
[2024-05-28 19:35:22] [INFO ] Deduced a trap composed of 294 places in 231 ms of which 5 ms to minimize.
[2024-05-28 19:35:22] [INFO ] Deduced a trap composed of 304 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:35:22] [INFO ] Deduced a trap composed of 292 places in 231 ms of which 5 ms to minimize.
[2024-05-28 19:35:22] [INFO ] Deduced a trap composed of 290 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:35:23] [INFO ] Deduced a trap composed of 300 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:35:23] [INFO ] Deduced a trap composed of 300 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:35:23] [INFO ] Deduced a trap composed of 299 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:35:23] [INFO ] Deduced a trap composed of 284 places in 261 ms of which 4 ms to minimize.
[2024-05-28 19:35:24] [INFO ] Deduced a trap composed of 292 places in 267 ms of which 4 ms to minimize.
[2024-05-28 19:35:24] [INFO ] Deduced a trap composed of 297 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:35:24] [INFO ] Deduced a trap composed of 296 places in 280 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 13/120 constraints. Problems are: Problem set: 17 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 120 constraints, problems are : Problem set: 17 solved, 833 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 24/24 constraints]
After SMT, in 61414ms problems are : Problem set: 17 solved, 833 unsolved
Search for dead transitions found 17 dead transitions in 61430ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 623/629 places, 839/857 transitions.
Applied a total of 0 rules in 12 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105575 ms. Remains : 623/629 places, 839/857 transitions.
[2024-05-28 19:35:32] [INFO ] Flatten gal took : 33 ms
[2024-05-28 19:35:32] [INFO ] Flatten gal took : 34 ms
[2024-05-28 19:35:32] [INFO ] Input system was already deterministic with 839 transitions.
[2024-05-28 19:35:32] [INFO ] Flatten gal took : 32 ms
[2024-05-28 19:35:32] [INFO ] Flatten gal took : 32 ms
[2024-05-28 19:35:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality10040013561262883105.gal : 6 ms
[2024-05-28 19:35:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality7600747587551150962.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/CTLCardinality10040013561262883105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7600747587551150962.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 19:36:02] [INFO ] Flatten gal took : 29 ms
[2024-05-28 19:36:02] [INFO ] Applying decomposition
[2024-05-28 19:36:02] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2445557131289854496.txt' '-o' '/tmp/graph2445557131289854496.bin' '-w' '/tmp/graph2445557131289854496.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2445557131289854496.bin' '-l' '-1' '-v' '-w' '/tmp/graph2445557131289854496.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:36:02] [INFO ] Decomposing Gal with order
[2024-05-28 19:36:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:36:02] [INFO ] Removed a total of 1062 redundant transitions.
[2024-05-28 19:36:02] [INFO ] Flatten gal took : 112 ms
[2024-05-28 19:36:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 202 labels/synchronizations in 11 ms.
[2024-05-28 19:36:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality8211209883581249919.gal : 8 ms
[2024-05-28 19:36:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality9521485938671091135.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/CTLCardinality8211209883581249919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9521485938671091135.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 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Applied a total of 5 rules in 9 ms. Remains 624 /629 variables (removed 5) and now considering 857/857 (removed 0) transitions.
Running 851 sub problems to find dead transitions.
[2024-05-28 19:36:33] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
// Phase 1: matrix 853 rows 624 cols
[2024-05-28 19:36:33] [INFO ] Computed 97 invariants in 11 ms
[2024-05-28 19:36:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (OVERLAPS) 5/623 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 851 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.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 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 (/ 2.0 3.0))
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 (/ 1.0 3.0))
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 (/ 1.0 3.0))
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 (/ 2.0 3.0))
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 4.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 9.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1477 variables, and 96 constraints, problems are : Problem set: 0 solved, 851 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 851/851 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 851 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
[2024-05-28 19:36:57] [INFO ] Deduced a trap composed of 99 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:36:57] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 4 (OVERLAPS) 5/623 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 851 unsolved
[2024-05-28 19:37:14] [INFO ] Deduced a trap composed of 266 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:37:14] [INFO ] Deduced a trap composed of 303 places in 236 ms of which 4 ms to minimize.
SMT process timed out in 41270ms, After SMT, problems are : Problem set: 0 solved, 851 unsolved
Search for dead transitions found 0 dead transitions in 41277ms
[2024-05-28 19:37:14] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 19:37:14] [INFO ] Invariant cache hit.
[2024-05-28 19:37:14] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-28 19:37:14] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 19:37:14] [INFO ] Invariant cache hit.
[2024-05-28 19:37:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:37:16] [INFO ] Implicit Places using invariants and state equation in 1845 ms returned []
Implicit Place search using SMT with State Equation took 2352 ms to find 0 implicit places.
Running 851 sub problems to find dead transitions.
[2024-05-28 19:37:16] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 19:37:16] [INFO ] Invariant cache hit.
[2024-05-28 19:37:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (OVERLAPS) 5/623 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 851 unsolved
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/624 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 834 unsolved
[2024-05-28 19:37:45] [INFO ] Deduced a trap composed of 200 places in 212 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1477 variables, and 98 constraints, problems are : Problem set: 17 solved, 834 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 851/851 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 17 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 17 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 17 solved, 834 unsolved
At refinement iteration 3 (OVERLAPS) 5/623 variables, 5/96 constraints. Problems are: Problem set: 17 solved, 834 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 834 unsolved
[2024-05-28 19:38:05] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:38:05] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 2/99 constraints. Problems are: Problem set: 17 solved, 834 unsolved
[2024-05-28 19:38:09] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 4 ms to minimize.
[2024-05-28 19:38:12] [INFO ] Deduced a trap composed of 260 places in 241 ms of which 5 ms to minimize.
[2024-05-28 19:38:12] [INFO ] Deduced a trap composed of 245 places in 252 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 3/102 constraints. Problems are: Problem set: 17 solved, 834 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1477 variables, and 102 constraints, problems are : Problem set: 17 solved, 834 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/851 constraints, Known Traps: 6/6 constraints]
After SMT, in 61252ms problems are : Problem set: 17 solved, 834 unsolved
Search for dead transitions found 17 dead transitions in 61269ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 624/629 places, 840/857 transitions.
Applied a total of 0 rules in 9 ms. Remains 624 /624 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104921 ms. Remains : 624/629 places, 840/857 transitions.
[2024-05-28 19:38:17] [INFO ] Flatten gal took : 26 ms
[2024-05-28 19:38:17] [INFO ] Flatten gal took : 27 ms
[2024-05-28 19:38:18] [INFO ] Input system was already deterministic with 840 transitions.
[2024-05-28 19:38:18] [INFO ] Flatten gal took : 28 ms
[2024-05-28 19:38:18] [INFO ] Flatten gal took : 27 ms
[2024-05-28 19:38:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality12093558090235020800.gal : 5 ms
[2024-05-28 19:38:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality10580273425801725821.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/CTLCardinality12093558090235020800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10580273425801725821.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 19:38:48] [INFO ] Flatten gal took : 57 ms
[2024-05-28 19:38:48] [INFO ] Applying decomposition
[2024-05-28 19:38:48] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14217378012895883228.txt' '-o' '/tmp/graph14217378012895883228.bin' '-w' '/tmp/graph14217378012895883228.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14217378012895883228.bin' '-l' '-1' '-v' '-w' '/tmp/graph14217378012895883228.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:38:48] [INFO ] Decomposing Gal with order
[2024-05-28 19:38:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:38:48] [INFO ] Removed a total of 914 redundant transitions.
[2024-05-28 19:38:48] [INFO ] Flatten gal took : 83 ms
[2024-05-28 19:38:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 166 labels/synchronizations in 10 ms.
[2024-05-28 19:38:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality3173913607285165740.gal : 7 ms
[2024-05-28 19:38:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality4519416124835508452.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/CTLCardinality3173913607285165740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4519416124835508452.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 19:39:18] [INFO ] Flatten gal took : 53 ms
[2024-05-28 19:39:18] [INFO ] Flatten gal took : 43 ms
[2024-05-28 19:39:18] [INFO ] Applying decomposition
[2024-05-28 19:39:18] [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/graph2653241413003333219.txt' '-o' '/tmp/graph2653241413003333219.bin' '-w' '/tmp/graph2653241413003333219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2653241413003333219.bin' '-l' '-1' '-v' '-w' '/tmp/graph2653241413003333219.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:39:18] [INFO ] Decomposing Gal with order
[2024-05-28 19:39:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:39:19] [INFO ] Removed a total of 1337 redundant transitions.
[2024-05-28 19:39:19] [INFO ] Flatten gal took : 156 ms
[2024-05-28 19:39:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 451 labels/synchronizations in 18 ms.
[2024-05-28 19:39:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality7448628016661184135.gal : 8 ms
[2024-05-28 19:39:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality13558227068881525818.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/CTLCardinality7448628016661184135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13558227068881525818.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 9 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 19:48:07] [INFO ] Applying decomposition
[2024-05-28 19:48:07] [INFO ] Flatten gal took : 52 ms
[2024-05-28 19:48:07] [INFO ] Decomposing Gal with order
[2024-05-28 19:48:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:48:07] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to block in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[CreatedJobs_42],[CreatedJobs_43],[CreatedJobs_44],[CreatedJobs_45],[CreatedJobs_46],[CreatedJobs_47],[CreatedJobs_48],[CreatedJobs_49],[CreatedJobs_50],[CreatedJobs_51],[CreatedJobs_52],[CreatedJobs_53],[CreatedJobs_54],[CreatedJobs_55],[CreatedJobs_56],[CreatedJobs_57],[CreatedJobs_58],[CreatedJobs_59],[CreatedJobs_60],[CreatedJobs_61],[CreatedJobs_62],[CreatedJobs_63],[CreatedJobs_64],[CreatedJobs_65],[CreatedJobs_66],[CreatedJobs_67],[CreatedJobs_68],[CreatedJobs_69],[CreatedJobs_70],[CreatedJobs_71],[CreatedJobs_72],[CreatedJobs_73],[CreatedJobs_74],[CreatedJobs_75],[CreatedJobs_76],[CreatedJobs_77],[CreatedJobs_78],[CreatedJobs_79],[CreatedJobs_80],[CreatedJobs_81],[CreatedJobs_82],[CreatedJobs_83],[CreatedJobs_84],[CreatedJobs_85],[CreatedJobs_86],[CreatedJobs_87],[CreatedJobs_88],[CreatedJobs_89],[CreatedJobs_90],[CreatedJobs_91],[CreatedJobs_92],[CreatedJobs_93],[CreatedJobs_94],[CreatedJobs_95],[CreatedJobs_96],[CreatedJobs_97],[CreatedJobs_98],[CreatedJobs_99],[CreatedJobs_100],[CreatedJobs_101],[CreatedJobs_102],[CreatedJobs_103],[CreatedJobs_104],[CreatedJobs_105],[CreatedJobs_106],[CreatedJobs_107],[CreatedJobs_108],[CreatedJobs_109],[CreatedJobs_110],[CreatedJobs_111],[CreatedJobs_112],[CreatedJobs_113],[CreatedJobs_114],[CreatedJobs_115],[CreatedJobs_116],[CreatedJobs_117],[CreatedJobs_118],[CreatedJobs_119],[CreatedJobs_120],[CreatedJobs_121],[CreatedJobs_122],[CreatedJobs_123],[CreatedJobs_124],[CreatedJobs_125],[CreatedJobs_126],[CreatedJobs_127],[CreatedJobs_128],[CreatedJobs_129],[CreatedJobs_130],[CreatedJobs_131],[CreatedJobs_132],[CreatedJobs_133],[CreatedJobs_134],[CreatedJobs_135],[CreatedJobs_136],[CreatedJobs_137],[CreatedJobs_138],[CreatedJobs_139],[CreatedJobs_140],[CreatedJobs_141],[CreatedJobs_142],[CreatedJobs_143],[CreatedJobs_144],[CreatedJobs_145],[CreatedJobs_146],[CreatedJobs_147],[CreatedJobs_148],[CreatedJobs_149],[CreatedJobs_150],[CreatedJobs_151],[CreatedJobs_152],[CreatedJobs_153],[CreatedJobs_154],[CreatedJobs_155],[CreatedJobs_156],[CreatedJobs_157],[CreatedJobs_158],[CreatedJobs_159],[CreatedJobs_160],[CreatedJobs_161],[CreatedJobs_162],[CreatedJobs_163],[CreatedJobs_164],[CreatedJobs_165],[CreatedJobs_166],[CreatedJobs_167],[CreatedJobs_168],[CreatedJobs_169],[CreatedJobs_170],[CreatedJobs_171],[CreatedJobs_172],[CreatedJobs_173],[CreatedJobs_174],[CreatedJobs_175],[CreatedJobs_176],[CreatedJobs_177],[CreatedJobs_178],[CreatedJobs_179],[CreatedJobs_180],[CreatedJobs_181],[CreatedJobs_182],[CreatedJobs_183],[CreatedJobs_184],[CreatedJobs_185],[CreatedJobs_186],[CreatedJobs_187],[CreatedJobs_188],[CreatedJobs_189],[CreatedJobs_190],[CreatedJobs_191],[CreatedJobs_192],[CreatedJobs_193],[CreatedJobs_194],[CreatedJobs_195],[CreatedJobs_196],[CreatedJobs_197],[CreatedJobs_198],[CreatedJobs_199],[CreatedJobs_200],[CreatedJobs_201],[CreatedJobs_202],[CreatedJobs_203],[CreatedJobs_204],[Schedule_Task_E_0],[Schedule_Task_E_1],[Schedule_Task_E_2],[Schedule_Task_E_3],[Schedule_Task_E_4],[Schedule_Task_E_5],[Schedule_Task_E_6],[Schedule_Task_E_7],[Schedule_Task_E_8],[Schedule_Task_E_9],[Schedule_Task_E_10],[Schedule_Task_E_11],[Schedule_Task_E_12],[Schedule_Task_E_13],[Schedule_Task_E_14],[Schedule_Task_E_15],[Schedule_Task_E_16],[Schedule_Task_E_17],[Schedule_Task_E_18],[Schedule_Task_E_19],[Schedule_Task_E_20],[Schedule_Task_E_21],[Schedule_Task_E_22],[Schedule_Task_E_23],[Schedule_Task_E_24],[Schedule_Task_E_25],[Schedule_Task_E_26],[Schedule_Task_E_27],[Schedule_Task_E_28],[Schedule_Task_E_29],[Schedule_Task_E_30],[Schedule_Task_E_31],[Schedule_Task_E_32],[Schedule_Task_E_33],[Schedule_Task_E_34],[Schedule_Task_E_35],[Schedule_Task_E_36],[Schedule_Task_E_37],[Schedule_Task_E_38],[Schedule_Task_E_39],[Schedule_Task_E_40],[Schedule_Task_E_41],[f3_0, f2_0, f1_0, AvailableJobId_0],[f3_1, f2_1, f1_1, AvailableJobId_1],[f3_2, f2_2, f1_2, AvailableJobId_2],[f3_3, f2_3, f1_3, AvailableJobId_3],[f3_4, f2_4, f1_4, AvailableJobId_4],[f3_5, f2_5, f1_5, AvailableJobId_5],[f3_6, f2_6, f1_6, AvailableJobId_6],[f3_7, f2_7, f1_7, AvailableJobId_7],[f3_8, f2_8, f1_8, AvailableJobId_8],[f3_9, f2_9, f1_9, AvailableJobId_9],[f3_10, f2_10, f1_10, AvailableJobId_10],[f3_11, f2_11, f1_11, AvailableJobId_11],[f3_12, f2_12, f1_12, AvailableJobId_12],[f3_13, f2_13, f1_13, AvailableJobId_13],[f3_14, f2_14, f1_14, AvailableJobId_14],[f3_15, f2_15, f1_15, AvailableJobId_15],[f3_16, f2_16, f1_16, AvailableJobId_16],[f3_17, f2_17, f1_17, AvailableJobId_17],[f3_18, f2_18, f1_18, AvailableJobId_18],[f3_19, f2_19, f1_19, AvailableJobId_19],[f3_20, f2_20, f1_20, AvailableJobId_20],[f3_21, f2_21, f1_21, AvailableJobId_21],[f3_22, f2_22, f1_22, AvailableJobId_22],[f3_23, f2_23, f1_23, AvailableJobId_23],[f3_24, f2_24, f1_24, AvailableJobId_24],[f3_25, f2_25, f1_25, AvailableJobId_25],[f3_26, f2_26, f1_26, AvailableJobId_26],[f3_27, f2_27, f1_27, AvailableJobId_27],[f3_28, f2_28, f1_28, AvailableJobId_28],[f3_29, f2_29, f1_29, AvailableJobId_29],[f3_30, f2_30, f1_30, AvailableJobId_30],[f3_31, f2_31, f1_31, AvailableJobId_31],[f3_32, f2_32, f1_32, AvailableJobId_32],[f3_33, f2_33, f1_33, AvailableJobId_33],[f3_34, f2_34, f1_34, AvailableJobId_34],[f3_35, f2_35, f1_35, AvailableJobId_35],[f3_36, f2_36, f1_36, AvailableJobId_36],[f3_37, f2_37, f1_37, AvailableJobId_37],[f3_38, f2_38, f1_38, AvailableJobId_38],[f3_39, f2_39, f1_39, AvailableJobId_39],[f3_40, f2_40, f1_40, AvailableJobId_40],[FetchJobE_0, QueueJobB_0, NotifyEventJobQueuedB_0, Perform_Work_B_0],[FetchJobE_1, QueueJobB_1, NotifyEventJobQueuedB_1, Perform_Work_B_1],[FetchJobE_2, QueueJobB_2, NotifyEventJobQueuedB_2, Perform_Work_B_2],[FetchJobE_3, QueueJobB_3, NotifyEventJobQueuedB_3, Perform_Work_B_3],[FetchJobE_4, QueueJobB_4, NotifyEventJobQueuedB_4, Perform_Work_B_4],[FetchJobE_5, QueueJobB_5, NotifyEventJobQueuedB_5, Perform_Work_B_5],[FetchJobE_6, QueueJobB_6, NotifyEventJobQueuedB_6, Perform_Work_B_6],[FetchJobE_7, QueueJobB_7, NotifyEventJobQueuedB_7, Perform_Work_B_7],[FetchJobE_8, QueueJobB_8, NotifyEventJobQueuedB_8, Perform_Work_B_8],[FetchJobE_9, QueueJobB_9, NotifyEventJobQueuedB_9, Perform_Work_B_9],[FetchJobE_10, QueueJobB_10, NotifyEventJobQueuedB_10, Perform_Work_B_10],[FetchJobE_11, QueueJobB_11, NotifyEventJobQueuedB_11, Perform_Work_B_11],[FetchJobE_12, QueueJobB_12, NotifyEventJobQueuedB_12, Perform_Work_B_12],[FetchJobE_13, QueueJobB_13, NotifyEventJobQueuedB_13, Perform_Work_B_13],[FetchJobE_14, QueueJobB_14, NotifyEventJobQueuedB_14, Perform_Work_B_14],[FetchJobE_15, QueueJobB_15, NotifyEventJobQueuedB_15, Perform_Work_B_15],[FetchJobE_16, QueueJobB_16, NotifyEventJobQueuedB_16, Perform_Work_B_16],[FetchJobE_17, QueueJobB_17, NotifyEventJobQueuedB_17, Perform_Work_B_17],[FetchJobE_18, QueueJobB_18, NotifyEventJobQueuedB_18, Perform_Work_B_18],[FetchJobE_19, QueueJobB_19, NotifyEventJobQueuedB_19, Perform_Work_B_19],[FetchJobE_20, QueueJobB_20, NotifyEventJobQueuedB_20, Perform_Work_B_20],[FetchJobE_21, QueueJobB_21, NotifyEventJobQueuedB_21, Perform_Work_B_21],[FetchJobE_22, QueueJobB_22, NotifyEventJobQueuedB_22, Perform_Work_B_22],[FetchJobE_23, QueueJobB_23, NotifyEventJobQueuedB_23, Perform_Work_B_23],[FetchJobE_24, QueueJobB_24, NotifyEventJobQueuedB_24, Perform_Work_B_24],[FetchJobE_25, QueueJobB_25, NotifyEventJobQueuedB_25, Perform_Work_B_25],[FetchJobE_26, QueueJobB_26, NotifyEventJobQueuedB_26, Perform_Work_B_26],[FetchJobE_27, QueueJobB_27, NotifyEventJobQueuedB_27, Perform_Work_B_27],[FetchJobE_28, QueueJobB_28, NotifyEventJobQueuedB_28, Perform_Work_B_28],[FetchJobE_29, QueueJobB_29, NotifyEventJobQueuedB_29, Perform_Work_B_29],[FetchJobE_30, QueueJobB_30, NotifyEventJobQueuedB_30, Perform_Work_B_30],[FetchJobE_31, QueueJobB_31, NotifyEventJobQueuedB_31, Perform_Work_B_31],[FetchJobE_32, QueueJobB_32, NotifyEventJobQueuedB_32, Perform_Work_B_32],[FetchJobE_33, QueueJobB_33, NotifyEventJobQueuedB_33, Perform_Work_B_33],[FetchJobE_34, QueueJobB_34, NotifyEventJobQueuedB_34, Perform_Work_B_34],[FetchJobE_35, QueueJobB_35, NotifyEventJobQueuedB_35, Perform_Work_B_35],[FetchJobE_36, QueueJobB_36, NotifyEventJobQueuedB_36, Perform_Work_B_36],[FetchJobE_37, QueueJobB_37, NotifyEventJobQueuedB_37, Perform_Work_B_37],[FetchJobE_38, QueueJobB_38, NotifyEventJobQueuedB_38, Perform_Work_B_38],[FetchJobE_39, QueueJobB_39, NotifyEventJobQueuedB_39, Perform_Work_B_39],[FetchJobE_40, QueueJobB_40, NotifyEventJobQueuedB_40, Perform_Work_B_40],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[ModifiedSrc_0, DataOnSrc_0, TheSour_0],[ModifiedSrc_1, DataOnSrc_1, TheSour_1],[ModifiedSrc_2, DataOnSrc_2, TheSour_2],[ModifiedSrc_3, DataOnSrc_3, TheSour_3],[ModifiedSrc_4, DataOnSrc_4, TheSour_4],

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 19:48:07] [INFO ] Flatten gal took : 26 ms
[2024-05-28 19:48:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality16032940317751814860.gal : 4 ms
[2024-05-28 19:48:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality7043718150539232127.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/CTLCardinality16032940317751814860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7043718150539232127.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 9 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 19:57:16] [INFO ] Flatten gal took : 60 ms
[2024-05-28 19:57:16] [INFO ] Input system was already deterministic with 857 transitions.
[2024-05-28 19:57:16] [INFO ] Transformed 629 places.
[2024-05-28 19:57:16] [INFO ] Transformed 857 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 19:57:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality2956793212869280159.gal : 8 ms
[2024-05-28 19:57:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality1404844639422057046.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/CTLCardinality2956793212869280159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1404844639422057046.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

BK_STOP 1716926762603

--------------------
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="PolyORBNT-COL-S05J40"
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 PolyORBNT-COL-S05J40, 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-171654447000377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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