Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690532100321.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyElection-PT-06b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100321
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 StigmergyElection-PT-06b-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-06b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717008814265

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 18:53:35] [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-29 18:53:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:53:35] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2024-05-29 18:53:35] [INFO ] Transformed 835 places.
[2024-05-29 18:53:35] [INFO ] Transformed 2416 transitions.
[2024-05-29 18:53:35] [INFO ] Found NUPN structural information;
[2024-05-29 18:53:35] [INFO ] Parsed PT model containing 835 places and 2416 transitions and 20130 arcs in 308 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
FORMULA StigmergyElection-PT-06b-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 95 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 2416/2416 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 739 transition count 2320
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 739 transition count 2320
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 236 place count 695 transition count 2276
Iterating global reduction 0 with 44 rules applied. Total rules applied 280 place count 695 transition count 2276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 286 place count 689 transition count 2270
Iterating global reduction 0 with 6 rules applied. Total rules applied 292 place count 689 transition count 2270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 293 place count 688 transition count 2269
Iterating global reduction 0 with 1 rules applied. Total rules applied 294 place count 688 transition count 2269
Applied a total of 294 rules in 250 ms. Remains 688 /835 variables (removed 147) and now considering 2269/2416 (removed 147) transitions.
// Phase 1: matrix 2269 rows 688 cols
[2024-05-29 18:53:36] [INFO ] Computed 7 invariants in 59 ms
[2024-05-29 18:53:36] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-05-29 18:53:36] [INFO ] Invariant cache hit.
[2024-05-29 18:53:37] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
Running 2268 sub problems to find dead transitions.
[2024-05-29 18:53:37] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/687 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2268 unsolved
SMT process timed out in 49657ms, After SMT, problems are : Problem set: 0 solved, 2268 unsolved
Search for dead transitions found 0 dead transitions in 49702ms
Starting structural reductions in LTL mode, iteration 1 : 688/835 places, 2269/2416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51769 ms. Remains : 688/835 places, 2269/2416 transitions.
Support contains 95 out of 688 places after structural reductions.
[2024-05-29 18:54:28] [INFO ] Flatten gal took : 274 ms
[2024-05-29 18:54:28] [INFO ] Flatten gal took : 166 ms
[2024-05-29 18:54:28] [INFO ] Input system was already deterministic with 2269 transitions.
Support contains 82 out of 688 places (down from 95) after GAL structural reductions.
RANDOM walk for 40000 steps (379 resets) in 1960 ms. (20 steps per ms) remains 23/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
[2024-05-29 18:54:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 646/688 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 2269/2957 variables, 688/695 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2957 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 0/2957 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2957/2957 variables, and 695 constraints, problems are : Problem set: 0 solved, 23 unsolved in 2469 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 688/688 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 646/688 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 18:54:32] [INFO ] Deduced a trap composed of 225 places in 769 ms of which 38 ms to minimize.
[2024-05-29 18:54:33] [INFO ] Deduced a trap composed of 226 places in 704 ms of which 5 ms to minimize.
[2024-05-29 18:54:34] [INFO ] Deduced a trap composed of 222 places in 677 ms of which 4 ms to minimize.
[2024-05-29 18:54:34] [INFO ] Deduced a trap composed of 170 places in 613 ms of which 4 ms to minimize.
[2024-05-29 18:54:35] [INFO ] Deduced a trap composed of 173 places in 686 ms of which 4 ms to minimize.
[2024-05-29 18:54:36] [INFO ] Deduced a trap composed of 225 places in 634 ms of which 4 ms to minimize.
[2024-05-29 18:54:36] [INFO ] Deduced a trap composed of 169 places in 646 ms of which 3 ms to minimize.
[2024-05-29 18:54:37] [INFO ] Deduced a trap composed of 173 places in 579 ms of which 4 ms to minimize.
SMT process timed out in 8096ms, After SMT, problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 42 out of 688 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 688/688 places, 2269/2269 transitions.
Graph (trivial) has 624 edges and 688 vertex of which 70 / 688 are part of one of the 13 SCC in 5 ms
Free SCC test removed 57 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Graph (complete) has 1449 edges and 631 vertex of which 626 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.19 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 368 transitions
Trivial Post-agglo rules discarded 368 transitions
Performed 368 trivial Post agglomeration. Transition count delta: 368
Iterating post reduction 0 with 373 rules applied. Total rules applied 375 place count 626 transition count 1821
Reduce places removed 368 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 379 rules applied. Total rules applied 754 place count 258 transition count 1810
Reduce places removed 6 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 2 with 29 rules applied. Total rules applied 783 place count 252 transition count 1787
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 29 rules applied. Total rules applied 812 place count 229 transition count 1781
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 815 place count 226 transition count 1781
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 815 place count 226 transition count 1752
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 873 place count 197 transition count 1752
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 876 place count 194 transition count 1749
Iterating global reduction 5 with 3 rules applied. Total rules applied 879 place count 194 transition count 1749
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 879 place count 194 transition count 1747
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 883 place count 192 transition count 1747
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 884 place count 191 transition count 1746
Iterating global reduction 5 with 1 rules applied. Total rules applied 885 place count 191 transition count 1746
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 937 place count 165 transition count 1720
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 942 place count 165 transition count 1715
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 954 place count 153 transition count 436
Iterating global reduction 6 with 12 rules applied. Total rules applied 966 place count 153 transition count 436
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 972 place count 153 transition count 430
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 992 place count 143 transition count 420
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1000 place count 139 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 1014 place count 139 transition count 414
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1016 place count 138 transition count 420
Free-agglomeration rule applied 33 times.
Iterating global reduction 7 with 33 rules applied. Total rules applied 1049 place count 138 transition count 387
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 7 with 33 rules applied. Total rules applied 1082 place count 105 transition count 387
Drop transitions (Redundant composition of simpler transitions.) removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 8 with 68 rules applied. Total rules applied 1150 place count 105 transition count 319
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1151 place count 105 transition count 319
Applied a total of 1151 rules in 376 ms. Remains 105 /688 variables (removed 583) and now considering 319/2269 (removed 1950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 105/688 places, 319/2269 transitions.
RANDOM walk for 40000 steps (2455 resets) in 654 ms. (61 steps per ms) remains 3/23 properties
BEST_FIRST walk for 40004 steps (386 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (385 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (383 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
// Phase 1: matrix 319 rows 105 cols
[2024-05-29 18:54:38] [INFO ] Computed 7 invariants in 2 ms
[2024-05-29 18:54:38] [INFO ] State equation strengthened by 181 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/57 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 48/105 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 319/424 variables, 105/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 181/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/424 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 293 constraints, problems are : Problem set: 0 solved, 3 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/57 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 48/105 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 18:54:38] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:54:38] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:54:38] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:54:38] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 319/424 variables, 105/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 181/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/424 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 300 constraints, problems are : Problem set: 0 solved, 3 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 707ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 55 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 319/319 transitions.
Graph (trivial) has 81 edges and 105 vertex of which 17 / 105 are part of one of the 8 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 347 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 95 transition count 274
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 68 transition count 272
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 67 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 66 transition count 270
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 63 place count 66 transition count 266
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 71 place count 62 transition count 266
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 80 place count 53 transition count 257
Iterating global reduction 4 with 9 rules applied. Total rules applied 89 place count 53 transition count 257
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 105 place count 45 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 109 place count 45 transition count 245
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 119 place count 35 transition count 235
Iterating global reduction 5 with 10 rules applied. Total rules applied 129 place count 35 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 137 place count 35 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 139 place count 34 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 147 place count 34 transition count 225
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 156 place count 34 transition count 216
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 5 with 74 rules applied. Total rules applied 230 place count 25 transition count 151
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 236 place count 19 transition count 145
Iterating global reduction 6 with 6 rules applied. Total rules applied 242 place count 19 transition count 145
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 257 place count 19 transition count 130
Applied a total of 257 rules in 67 ms. Remains 19 /105 variables (removed 86) and now considering 130/319 (removed 189) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 19/105 places, 130/319 transitions.
RANDOM walk for 307 steps (0 resets) in 7 ms. (38 steps per ms) remains 0/1 properties
[2024-05-29 18:54:39] [INFO ] Flatten gal took : 133 ms
[2024-05-29 18:54:39] [INFO ] Flatten gal took : 141 ms
[2024-05-29 18:54:39] [INFO ] Input system was already deterministic with 2269 transitions.
Computed a total of 95 stabilizing places and 101 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2269/2269 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 668 transition count 2249
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 668 transition count 2249
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 662 transition count 2243
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 662 transition count 2243
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 659 transition count 2240
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 659 transition count 2240
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 656 transition count 2237
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 656 transition count 2237
Applied a total of 64 rules in 77 ms. Remains 656 /688 variables (removed 32) and now considering 2237/2269 (removed 32) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2024-05-29 18:54:39] [INFO ] Computed 7 invariants in 28 ms
[2024-05-29 18:54:40] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-29 18:54:40] [INFO ] Invariant cache hit.
[2024-05-29 18:54:41] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
Running 2236 sub problems to find dead transitions.
[2024-05-29 18:54:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2236 unsolved
SMT process timed out in 50594ms, After SMT, problems are : Problem set: 0 solved, 2236 unsolved
Search for dead transitions found 0 dead transitions in 50618ms
Starting structural reductions in LTL mode, iteration 1 : 656/688 places, 2237/2269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52274 ms. Remains : 656/688 places, 2237/2269 transitions.
[2024-05-29 18:55:32] [INFO ] Flatten gal took : 98 ms
[2024-05-29 18:55:32] [INFO ] Flatten gal took : 106 ms
[2024-05-29 18:55:32] [INFO ] Input system was already deterministic with 2237 transitions.
[2024-05-29 18:55:32] [INFO ] Flatten gal took : 103 ms
[2024-05-29 18:55:32] [INFO ] Flatten gal took : 100 ms
[2024-05-29 18:55:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality8569135791476027864.gal : 67 ms
[2024-05-29 18:55:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality5533562649413803263.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/CTLCardinality8569135791476027864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5533562649413803263.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-29 18:56:03] [INFO ] Flatten gal took : 98 ms
[2024-05-29 18:56:03] [INFO ] Applying decomposition
[2024-05-29 18:56:03] [INFO ] Flatten gal took : 98 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/graph11617265616418553284.txt' '-o' '/tmp/graph11617265616418553284.bin' '-w' '/tmp/graph11617265616418553284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11617265616418553284.bin' '-l' '-1' '-v' '-w' '/tmp/graph11617265616418553284.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:56:03] [INFO ] Decomposing Gal with order
[2024-05-29 18:56:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:56:04] [INFO ] Removed a total of 9217 redundant transitions.
[2024-05-29 18:56:04] [INFO ] Flatten gal took : 340 ms
[2024-05-29 18:56:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 114 ms.
[2024-05-29 18:56:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality10351986568418461823.gal : 19 ms
[2024-05-29 18:56:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality16932494158184937362.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/CTLCardinality10351986568418461823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16932494158184937362.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 688/688 places, 2269/2269 transitions.
Graph (trivial) has 691 edges and 688 vertex of which 91 / 688 are part of one of the 16 SCC in 6 ms
Free SCC test removed 75 places
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 414 transitions
Trivial Post-agglo rules discarded 414 transitions
Performed 414 trivial Post agglomeration. Transition count delta: 414
Iterating post reduction 0 with 414 rules applied. Total rules applied 415 place count 612 transition count 1769
Reduce places removed 414 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 429 rules applied. Total rules applied 844 place count 198 transition count 1754
Reduce places removed 8 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 13 rules applied. Total rules applied 857 place count 190 transition count 1749
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 864 place count 185 transition count 1747
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 865 place count 184 transition count 1747
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 865 place count 184 transition count 1726
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 907 place count 163 transition count 1726
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 924 place count 146 transition count 1705
Iterating global reduction 5 with 17 rules applied. Total rules applied 941 place count 146 transition count 1705
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 942 place count 146 transition count 1704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 943 place count 145 transition count 1704
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 943 place count 145 transition count 1700
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 951 place count 141 transition count 1700
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 956 place count 136 transition count 1691
Iterating global reduction 7 with 5 rules applied. Total rules applied 961 place count 136 transition count 1691
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 965 place count 132 transition count 1683
Iterating global reduction 7 with 4 rules applied. Total rules applied 969 place count 132 transition count 1683
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 1005 place count 114 transition count 1665
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 1023 place count 96 transition count 329
Iterating global reduction 7 with 18 rules applied. Total rules applied 1041 place count 96 transition count 329
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1051 place count 96 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1053 place count 95 transition count 318
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1054 place count 94 transition count 310
Iterating global reduction 8 with 1 rules applied. Total rules applied 1055 place count 94 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1056 place count 94 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1064 place count 94 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 1065 place count 94 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1066 place count 93 transition count 300
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 14 rules applied. Total rules applied 1080 place count 86 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1081 place count 85 transition count 292
Applied a total of 1081 rules in 232 ms. Remains 85 /688 variables (removed 603) and now considering 292/2269 (removed 1977) transitions.
[2024-05-29 18:56:34] [INFO ] Flow matrix only has 285 transitions (discarded 7 similar events)
// Phase 1: matrix 285 rows 85 cols
[2024-05-29 18:56:34] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 18:56:34] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 18:56:34] [INFO ] Flow matrix only has 285 transitions (discarded 7 similar events)
[2024-05-29 18:56:34] [INFO ] Invariant cache hit.
[2024-05-29 18:56:34] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 18:56:34] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-29 18:56:34] [INFO ] Redundant transitions in 14 ms returned []
Running 280 sub problems to find dead transitions.
[2024-05-29 18:56:34] [INFO ] Flow matrix only has 285 transitions (discarded 7 similar events)
[2024-05-29 18:56:34] [INFO ] Invariant cache hit.
[2024-05-29 18:56:34] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 6/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:56:36] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-29 18:56:36] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:56:36] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2024-05-29 18:56:36] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:56:36] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:56:36] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2024-05-29 18:56:36] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:56:36] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:56:36] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:56:37] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:56:37] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-29 18:56:37] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2024-05-29 18:56:37] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:56:37] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-05-29 18:56:37] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:56:37] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:56:37] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-29 18:56:38] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:56:38] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:56:38] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:56:39] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2024-05-29 18:56:39] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:56:39] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:56:39] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:56:39] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2024-05-29 18:56:39] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:56:39] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 3 ms to minimize.
[2024-05-29 18:56:39] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:56:39] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2024-05-29 18:56:40] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:56:40] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (OVERLAPS) 284/369 variables, 85/118 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 62/180 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:56:42] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:56:42] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (OVERLAPS) 1/370 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:56:49] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:56:49] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/370 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:56:54] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 15 (OVERLAPS) 0/370 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 186 constraints, problems are : Problem set: 0 solved, 280 unsolved in 26416 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 6/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 284/369 variables, 85/123 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 62/185 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 280/465 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:57:06] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:57:12] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:57:14] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:57:18] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:57:18] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:57:19] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:57:23] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/370 variables, and 472 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 43/43 constraints]
After SMT, in 56825ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 56829ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/688 places, 292/2269 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57328 ms. Remains : 85/688 places, 292/2269 transitions.
[2024-05-29 18:57:31] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:57:31] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:57:31] [INFO ] Input system was already deterministic with 292 transitions.
[2024-05-29 18:57:31] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:57:31] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:57:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality8784802389900665554.gal : 2 ms
[2024-05-29 18:57:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality15307049775068595813.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/CTLCardinality8784802389900665554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15307049775068595813.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.26569e+06,2.22099,74932,2,17091,5,175554,6,0,620,144710,0


Converting to forward existential form...Done !
original formula: (AG(AF((((p740!=0)&&(p544!=1))&&((p35!=0)&&(p635!=1))))) * AF((((p749==0)&&(p97==1))||(p559==0))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!((((p740!=0)&&(p544!=1))&&((p35!=0)&&(p635!=1)))))] = FALSE * [FwdG(Init,!((((p749==0)&&...188
Hit Full ! (commute/partial/dont) 284/0/8
(forward)formula 0,0,12.6441,340448,1,0,33,1.19349e+06,27,4,7800,1.00581e+06,32
FORMULA StigmergyElection-PT-06b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 688/688 places, 2269/2269 transitions.
Graph (trivial) has 692 edges and 688 vertex of which 94 / 688 are part of one of the 17 SCC in 1 ms
Free SCC test removed 77 places
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 423 place count 610 transition count 1761
Reduce places removed 422 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 432 rules applied. Total rules applied 855 place count 188 transition count 1751
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 862 place count 183 transition count 1749
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 866 place count 181 transition count 1747
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 867 place count 180 transition count 1747
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 867 place count 180 transition count 1726
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 909 place count 159 transition count 1726
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 924 place count 144 transition count 1709
Iterating global reduction 5 with 15 rules applied. Total rules applied 939 place count 144 transition count 1709
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 940 place count 144 transition count 1708
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 941 place count 143 transition count 1708
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 941 place count 143 transition count 1704
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 949 place count 139 transition count 1704
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 952 place count 136 transition count 1699
Iterating global reduction 7 with 3 rules applied. Total rules applied 955 place count 136 transition count 1699
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 956 place count 135 transition count 1697
Iterating global reduction 7 with 1 rules applied. Total rules applied 957 place count 135 transition count 1697
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 993 place count 117 transition count 1679
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 1013 place count 97 transition count 339
Iterating global reduction 7 with 20 rules applied. Total rules applied 1033 place count 97 transition count 339
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1045 place count 97 transition count 327
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1047 place count 95 transition count 323
Iterating global reduction 8 with 2 rules applied. Total rules applied 1049 place count 95 transition count 323
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1051 place count 93 transition count 319
Iterating global reduction 8 with 2 rules applied. Total rules applied 1053 place count 93 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1055 place count 92 transition count 318
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1056 place count 91 transition count 309
Iterating global reduction 8 with 1 rules applied. Total rules applied 1057 place count 91 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1058 place count 91 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1065 place count 91 transition count 301
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 1079 place count 84 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1080 place count 83 transition count 293
Applied a total of 1080 rules in 167 ms. Remains 83 /688 variables (removed 605) and now considering 293/2269 (removed 1976) transitions.
[2024-05-29 18:57:44] [INFO ] Flow matrix only has 285 transitions (discarded 8 similar events)
// Phase 1: matrix 285 rows 83 cols
[2024-05-29 18:57:44] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 18:57:44] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-29 18:57:44] [INFO ] Flow matrix only has 285 transitions (discarded 8 similar events)
[2024-05-29 18:57:44] [INFO ] Invariant cache hit.
[2024-05-29 18:57:44] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 18:57:45] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-05-29 18:57:45] [INFO ] Redundant transitions in 4 ms returned []
Running 280 sub problems to find dead transitions.
[2024-05-29 18:57:45] [INFO ] Flow matrix only has 285 transitions (discarded 8 similar events)
[2024-05-29 18:57:45] [INFO ] Invariant cache hit.
[2024-05-29 18:57:45] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 6/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:57:46] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-29 18:57:46] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:57:46] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:57:46] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:57:46] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2024-05-29 18:57:46] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:57:47] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:57:47] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 18:57:47] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:57:47] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:57:47] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2024-05-29 18:57:47] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:57:47] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:57:47] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:57:47] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:57:47] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2024-05-29 18:57:47] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 0 ms to minimize.
[2024-05-29 18:57:47] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:57:48] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:57:48] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:57:48] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2024-05-29 18:57:48] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:57:48] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:57:48] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:57:48] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:57:49] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:57:49] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:57:49] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:57:49] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2024-05-29 18:57:49] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2024-05-29 18:57:49] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2024-05-29 18:57:49] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:57:51] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:57:51] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2024-05-29 18:57:51] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2024-05-29 18:57:51] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:57:54] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2024-05-29 18:57:54] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:57:54] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2024-05-29 18:57:54] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (OVERLAPS) 284/367 variables, 83/142 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 62/204 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 13 (OVERLAPS) 1/368 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 15 (OVERLAPS) 0/368 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 205 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20334 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 6/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 284/367 variables, 83/142 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 62/204 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 280/484 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 1/368 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-29 18:58:22] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:58:22] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/368 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 13 (OVERLAPS) 0/368 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 487 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 59/59 constraints]
After SMT, in 50800ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 50803ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/688 places, 293/2269 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51254 ms. Remains : 83/688 places, 293/2269 transitions.
[2024-05-29 18:58:35] [INFO ] Flatten gal took : 22 ms
[2024-05-29 18:58:35] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:58:35] [INFO ] Input system was already deterministic with 293 transitions.
[2024-05-29 18:58:35] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:58:35] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:58:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality7399800860132914627.gal : 2 ms
[2024-05-29 18:58:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality9800179303212999606.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/CTLCardinality7399800860132914627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9800179303212999606.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.7239e+06,2.24875,76364,2,20077,5,173556,6,0,612,172783,0


Converting to forward existential form...Done !
original formula: AF((AG(((p198==0)&&(p196==1))) + EG((EF((p148==1)) * (((p339==1)||(p430==0))||(p288==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((p198==0)&&(p196==1))))) + EG((E(TRUE U (p148==1)) * (((p339==1)||(p430==0))||(p288=...173
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t7, t8, t9, t10, t13, t14, t16, t17, t21, t22, t102, t104, t111, t113, t114, t115, t1...397
Detected timeout of ITS tools.
[2024-05-29 18:59:06] [INFO ] Flatten gal took : 21 ms
[2024-05-29 18:59:06] [INFO ] Applying decomposition
[2024-05-29 18:59:06] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2476887261679594450.txt' '-o' '/tmp/graph2476887261679594450.bin' '-w' '/tmp/graph2476887261679594450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2476887261679594450.bin' '-l' '-1' '-v' '-w' '/tmp/graph2476887261679594450.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:59:06] [INFO ] Decomposing Gal with order
[2024-05-29 18:59:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:59:06] [INFO ] Removed a total of 1163 redundant transitions.
[2024-05-29 18:59:06] [INFO ] Flatten gal took : 23 ms
[2024-05-29 18:59:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 6 ms.
[2024-05-29 18:59:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality5321628534760024132.gal : 2 ms
[2024-05-29 18:59:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality5363593496857304328.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/CTLCardinality5321628534760024132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5363593496857304328.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.7239e+06,6.36173,203412,3679,49,164752,541,740,2.03739e+06,43,2540,0


Converting to forward existential form...Done !
original formula: AF((AG(((i2.u7.p198==0)&&(i2.u7.p196==1))) + EG((EF((i2.u5.p148==1)) * (((i3.u14.p339==1)||(i5.u18.p430==0))||(i3.u12.p288==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((i2.u7.p198==0)&&(i2.u7.p196==1))))) + EG((E(TRUE U (i2.u5.p148==1)) * (((i3.u14.p33...212
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t9, t13, t16, t21, t177, t278, t279, t280, t281, t282, t283, t290, i0.t171, i0.u0.t10...522
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,19.1475,490328,1,0,450385,840,4604,4.5628e+06,225,5012,878809
FORMULA StigmergyElection-PT-06b-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2269/2269 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 670 transition count 2251
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 670 transition count 2251
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 665 transition count 2246
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 665 transition count 2246
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 663 transition count 2244
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 663 transition count 2244
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 661 transition count 2242
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 661 transition count 2242
Applied a total of 54 rules in 89 ms. Remains 661 /688 variables (removed 27) and now considering 2242/2269 (removed 27) transitions.
// Phase 1: matrix 2242 rows 661 cols
[2024-05-29 18:59:25] [INFO ] Computed 7 invariants in 34 ms
[2024-05-29 18:59:25] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-29 18:59:25] [INFO ] Invariant cache hit.
[2024-05-29 18:59:27] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
Running 2241 sub problems to find dead transitions.
[2024-05-29 18:59:27] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/2903 variables, and 0 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 31092 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/661 constraints, PredecessorRefiner: 2241/2241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/660 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
At refinement iteration 1 (OVERLAPS) 1/661 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
[2024-05-29 19:00:39] [INFO ] Deduced a trap composed of 167 places in 559 ms of which 5 ms to minimize.
[2024-05-29 19:00:39] [INFO ] Deduced a trap composed of 164 places in 552 ms of which 3 ms to minimize.
[2024-05-29 19:00:40] [INFO ] Deduced a trap composed of 165 places in 510 ms of which 2 ms to minimize.
[2024-05-29 19:00:40] [INFO ] Deduced a trap composed of 166 places in 542 ms of which 3 ms to minimize.
[2024-05-29 19:00:41] [INFO ] Deduced a trap composed of 222 places in 554 ms of which 3 ms to minimize.
[2024-05-29 19:00:42] [INFO ] Deduced a trap composed of 166 places in 543 ms of which 2 ms to minimize.
[2024-05-29 19:00:42] [INFO ] Deduced a trap composed of 163 places in 518 ms of which 3 ms to minimize.
[2024-05-29 19:00:43] [INFO ] Deduced a trap composed of 166 places in 481 ms of which 2 ms to minimize.
[2024-05-29 19:00:43] [INFO ] Deduced a trap composed of 162 places in 527 ms of which 2 ms to minimize.
[2024-05-29 19:00:44] [INFO ] Deduced a trap composed of 163 places in 488 ms of which 3 ms to minimize.
[2024-05-29 19:00:46] [INFO ] Deduced a trap composed of 164 places in 496 ms of which 3 ms to minimize.
[2024-05-29 19:00:47] [INFO ] Deduced a trap composed of 165 places in 531 ms of which 3 ms to minimize.
SMT process timed out in 80347ms, After SMT, problems are : Problem set: 0 solved, 2241 unsolved
Search for dead transitions found 0 dead transitions in 80368ms
Starting structural reductions in LTL mode, iteration 1 : 661/688 places, 2242/2269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81932 ms. Remains : 661/688 places, 2242/2269 transitions.
[2024-05-29 19:00:47] [INFO ] Flatten gal took : 91 ms
[2024-05-29 19:00:47] [INFO ] Flatten gal took : 101 ms
[2024-05-29 19:00:47] [INFO ] Input system was already deterministic with 2242 transitions.
[2024-05-29 19:00:47] [INFO ] Flatten gal took : 94 ms
[2024-05-29 19:00:48] [INFO ] Flatten gal took : 131 ms
[2024-05-29 19:00:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality17052984614802749348.gal : 37 ms
[2024-05-29 19:00:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality8212647033657814630.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/CTLCardinality17052984614802749348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8212647033657814630.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-29 19:01:18] [INFO ] Flatten gal took : 96 ms
[2024-05-29 19:01:18] [INFO ] Applying decomposition
[2024-05-29 19:01:18] [INFO ] Flatten gal took : 95 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/graph18165907709270316871.txt' '-o' '/tmp/graph18165907709270316871.bin' '-w' '/tmp/graph18165907709270316871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18165907709270316871.bin' '-l' '-1' '-v' '-w' '/tmp/graph18165907709270316871.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:01:18] [INFO ] Decomposing Gal with order
[2024-05-29 19:01:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:01:19] [INFO ] Removed a total of 9343 redundant transitions.
[2024-05-29 19:01:19] [INFO ] Flatten gal took : 163 ms
[2024-05-29 19:01:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 24 ms.
[2024-05-29 19:01:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality885509494018303159.gal : 11 ms
[2024-05-29 19:01:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality3205327925520315942.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/CTLCardinality885509494018303159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3205327925520315942.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 688/688 places, 2269/2269 transitions.
Graph (trivial) has 696 edges and 688 vertex of which 105 / 688 are part of one of the 18 SCC in 4 ms
Free SCC test removed 87 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 412 transitions
Trivial Post-agglo rules discarded 412 transitions
Performed 412 trivial Post agglomeration. Transition count delta: 412
Iterating post reduction 0 with 412 rules applied. Total rules applied 413 place count 600 transition count 1757
Reduce places removed 412 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 424 rules applied. Total rules applied 837 place count 188 transition count 1745
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 846 place count 182 transition count 1742
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 849 place count 179 transition count 1742
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 849 place count 179 transition count 1722
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 889 place count 159 transition count 1722
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 905 place count 143 transition count 1702
Iterating global reduction 4 with 16 rules applied. Total rules applied 921 place count 143 transition count 1702
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 922 place count 143 transition count 1701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 923 place count 142 transition count 1701
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 923 place count 142 transition count 1698
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 929 place count 139 transition count 1698
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 934 place count 134 transition count 1689
Iterating global reduction 6 with 5 rules applied. Total rules applied 939 place count 134 transition count 1689
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 943 place count 130 transition count 1681
Iterating global reduction 6 with 4 rules applied. Total rules applied 947 place count 130 transition count 1681
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 985 place count 111 transition count 1662
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1004 place count 92 transition count 323
Iterating global reduction 6 with 19 rules applied. Total rules applied 1023 place count 92 transition count 323
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1035 place count 92 transition count 311
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1037 place count 90 transition count 307
Iterating global reduction 7 with 2 rules applied. Total rules applied 1039 place count 90 transition count 307
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1041 place count 88 transition count 303
Iterating global reduction 7 with 2 rules applied. Total rules applied 1043 place count 88 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1045 place count 87 transition count 302
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1046 place count 86 transition count 296
Iterating global reduction 7 with 1 rules applied. Total rules applied 1047 place count 86 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1048 place count 86 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1054 place count 86 transition count 289
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 1066 place count 80 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1067 place count 79 transition count 282
Applied a total of 1067 rules in 167 ms. Remains 79 /688 variables (removed 609) and now considering 282/2269 (removed 1987) transitions.
[2024-05-29 19:01:49] [INFO ] Flow matrix only has 275 transitions (discarded 7 similar events)
// Phase 1: matrix 275 rows 79 cols
[2024-05-29 19:01:49] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 19:01:49] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-29 19:01:49] [INFO ] Flow matrix only has 275 transitions (discarded 7 similar events)
[2024-05-29 19:01:49] [INFO ] Invariant cache hit.
[2024-05-29 19:01:49] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-29 19:01:49] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-29 19:01:49] [INFO ] Redundant transitions in 8 ms returned []
Running 270 sub problems to find dead transitions.
[2024-05-29 19:01:49] [INFO ] Flow matrix only has 275 transitions (discarded 7 similar events)
[2024-05-29 19:01:49] [INFO ] Invariant cache hit.
[2024-05-29 19:01:49] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 6/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:01:51] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:01:52] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:01:52] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 3 ms to minimize.
[2024-05-29 19:01:52] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:01:52] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:01:52] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:01:52] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 19:01:52] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:01:53] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:01:53] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:01:53] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:01:53] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:01:53] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:01:53] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:01:53] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:01:53] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:01:53] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:01:53] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:01:53] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:01:54] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2024-05-29 19:01:54] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:01:54] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:01:54] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:01:54] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:01:54] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:01:54] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:01:55] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 19:01:55] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:01:55] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 19:01:55] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 274/353 variables, 79/124 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 62/186 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 11 (OVERLAPS) 1/354 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 13 (OVERLAPS) 0/354 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 187 constraints, problems are : Problem set: 0 solved, 270 unsolved in 16340 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 6/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 274/353 variables, 79/125 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 62/187 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 270/457 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 1/354 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 12 (OVERLAPS) 0/354 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 458 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 44/44 constraints]
After SMT, in 46713ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 46716ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/688 places, 282/2269 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47166 ms. Remains : 79/688 places, 282/2269 transitions.
[2024-05-29 19:02:36] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:02:36] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:02:36] [INFO ] Input system was already deterministic with 282 transitions.
[2024-05-29 19:02:36] [INFO ] Flatten gal took : 44 ms
[2024-05-29 19:02:36] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:02:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality17340072696763591467.gal : 3 ms
[2024-05-29 19:02:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality3729683408956833932.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/CTLCardinality17340072696763591467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3729683408956833932.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.3641e+06,5.59682,143172,2,12227,5,278928,6,0,586,265425,0


Converting to forward existential form...Done !
original formula: E((EG(EF(((p757==0)||(p264==1)))) + (p519==0)) U AF(!((AF((p135==1)) * (p354==0)))))
=> equivalent forward existential formula: [(FwdU(Init,(EG(E(TRUE U ((p757==0)||(p264==1)))) + (p519==0))) * !(EG(!(!((!(EG(!((p135==1)))) * (p354==0))))))...166
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t8, t9, t12, t17, t18, t21, t22, t24, t25, t26, t27, t69, t79, t80, t82, t83, t84, t1...349
Detected timeout of ITS tools.
[2024-05-29 19:03:06] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:03:06] [INFO ] Applying decomposition
[2024-05-29 19:03:06] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1137972513275216008.txt' '-o' '/tmp/graph1137972513275216008.bin' '-w' '/tmp/graph1137972513275216008.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1137972513275216008.bin' '-l' '-1' '-v' '-w' '/tmp/graph1137972513275216008.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:03:06] [INFO ] Decomposing Gal with order
[2024-05-29 19:03:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:03:06] [INFO ] Removed a total of 1215 redundant transitions.
[2024-05-29 19:03:06] [INFO ] Flatten gal took : 19 ms
[2024-05-29 19:03:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2024-05-29 19:03:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality11491542826460947592.gal : 2 ms
[2024-05-29 19:03:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality792772795475053061.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/CTLCardinality11491542826460947592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality792772795475053061.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.3641e+06,0.86246,37872,1736,51,37128,445,816,275863,43,1001,0


Converting to forward existential form...Done !
original formula: E((EG(EF(((i7.u24.p757==0)||(i2.u8.p264==1)))) + (i4.u17.p519==0)) U AF(!((AF((i0.u0.p135==1)) * (i5.u11.p354==0)))))
=> equivalent forward existential formula: [(FwdU(Init,(EG(E(TRUE U ((i7.u24.p757==0)||(i2.u8.p264==1)))) + (i4.u17.p519==0))) * !(EG(!(!((!(EG(!((i0.u0.p1...199
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t17, t21, t25, t115, t269, t271, t272, t274, t275, i0.u4.t24, i1.t22, i1.t18, i1.t12,...467
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2269/2269 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 669 transition count 2250
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 669 transition count 2250
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 663 transition count 2244
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 663 transition count 2244
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 660 transition count 2241
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 660 transition count 2241
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 657 transition count 2238
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 657 transition count 2238
Applied a total of 62 rules in 86 ms. Remains 657 /688 variables (removed 31) and now considering 2238/2269 (removed 31) transitions.
// Phase 1: matrix 2238 rows 657 cols
[2024-05-29 19:03:36] [INFO ] Computed 7 invariants in 28 ms
[2024-05-29 19:03:37] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-29 19:03:37] [INFO ] Invariant cache hit.
[2024-05-29 19:03:38] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
Running 2237 sub problems to find dead transitions.
[2024-05-29 19:03:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2237 unsolved
SMT process timed out in 51499ms, After SMT, problems are : Problem set: 0 solved, 2237 unsolved
Search for dead transitions found 0 dead transitions in 51520ms
Starting structural reductions in LTL mode, iteration 1 : 657/688 places, 2238/2269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53019 ms. Remains : 657/688 places, 2238/2269 transitions.
[2024-05-29 19:04:29] [INFO ] Flatten gal took : 92 ms
[2024-05-29 19:04:29] [INFO ] Flatten gal took : 100 ms
[2024-05-29 19:04:30] [INFO ] Input system was already deterministic with 2238 transitions.
[2024-05-29 19:04:30] [INFO ] Flatten gal took : 107 ms
[2024-05-29 19:04:30] [INFO ] Flatten gal took : 94 ms
[2024-05-29 19:04:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality11270775050377776670.gal : 19 ms
[2024-05-29 19:04:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality15870554641884262046.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/CTLCardinality11270775050377776670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15870554641884262046.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.

BK_STOP 1717009491197

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="StigmergyElection-PT-06b"
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 StigmergyElection-PT-06b, 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 r400-tall-171690532100321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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